Ouvrages édités à titre de seul éditeur ou en collaboration (1)
  1. 1. Cardinal, J., Cerf, N., Delgrange, O., & Markowitch, O. (2005). 26th Symposium on Information Theory in the Benelux.
    2.   Parties d'ouvrages collectifs (1)
  2. 1. Cardinal, J. (1999). Faster fractal image coding using similarity search in a KL-transformed feature space. In E. Lutton, M. Dekking, J. Lévy-Véhel, & C. Tricot (Eds.), Fractals: theory and applications in engineering (pp. 293-306). London ; New York: Springer.
    3.   Articles dans des revues avec comité de lecture (115)
  3. 1. Aloupis, G., Cardinal, J., Collette, S., Hurtado, F., Langerman, S., & O'Rourke, J. (2010). Draining a Polygon - or - Rolling a Ball out of a Polygon. Computational geometry. doi:10.1016/j.comgeo.2009.08.002
  4. 2. Aronov, B. B., Cardinal, J., Dallant, J., & Iacono, J. (2026). A General Technique for Searching in Implicit Sets via Function Inversion. Algorithmica, 88(3), 37. doi:10.1007/S00453-026-01385-5
  5. 3. Brenner, S., Cardinal, J., McConville, T., Merino, A., & Mütze, T. (2026). Combinatorial generation via permutation languages. VII. Supersolvable hyperplane arrangements. European journal of combinatorics, 135, 104367. doi:10.1016/j.ejc.2026.104367
  6. 4. Bose, P., Cardinal, J., Iacono, J., Koumoutsos, G., & Langerman, S. (2023). Competitive Online Search Trees on Trees. ACM transactions on algorithms, 19(3), 1-19. doi:10.1145/3595180
  7. 5. Aronov, B. B., Cardinal, J., Dallant, J., & Iacono, J. (2023). A General Technique for Searching in Implicit Sets via Function Inversion. arXiv.org, abs/2311.12471. doi:10.48550/ARXIV.2311.12471
  8. 6. Aronov, B. B., de Berg, M., Cardinal, J., Ezra, E., Iacono, J., & Sharir, M. M. (2023). Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision-tree model. Computational geometry, 109, 101945. doi:10.1016/j.comgeo.2022.101945
  9. 7. Aronov, B. B., de Berg, M., Cardinal, J., Ezra, E., Iacono, J., & Sharir, M. M. (2021). Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model. Leibniz international proceedings in informatics, 212, 3. doi:10.4230/LIPIcs.ISAAC.2021.3
  10. 8. Cardinal, J., Iacono, J., & Koumoutsos, G. (2021). Worst-case efficient dynamic geometric independent set. Leibniz international proceedings in informatics, 204, 25. doi:10.4230/LIPIcs.ESA.2021.25
  11. 9. Cardinal, J., Pournin, L., & Valencia-Pabon, M. M. (2021). Bounds on the Diameter of Graph Associahedra. Procedia Computer Science, 195, 239-247. doi:10.1016/j.procs.2021.11.030
  12. 10. Barba Flores, L., Cardinal, J., Iacono, J., Langerman, S., Ooms, A., & Solomon, N. (2019). Subquadratic Algorithms for Algebraic Generalizations of 3SUM. Discrete & computational geometry, 61(4), 698-734. doi:10.1007/s00454-018-0040-y
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Suivant >>