Communications publiées lors de congrès ou colloques nationaux et internationaux (49)
  1. 42. Iacono, J. (2002). Key Independent Optimality. In Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings: Vol. 2518 (pp. 25-31). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-36136-7_3
  2. 43. Iacono, J., & Langerman, S. (2002). Queaps. In Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings Algorithms and Computation, 13th International Symposium, ISAAC 2002 Vancouver, BC, Canada, November 21-23, 2002, Proceedings: Vol. 2518 (pp. 211-218). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-36136-7_19
  3. 44. Iacono, J. (2001). Optimal planar point location. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA (pp. 340-341) ACM/SIAM.
  4. 45. Iacono, J. (2001). Alternatives to splay trees with O(log n) worst-case access times. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA (pp. 516-522) ACM/SIAM.
  5. 46. Iacono, J., & Langerman, S. (2000). Dynamic point location in fat hyperrectangles with integer coordinates. Proceedings of the 12th Canadian Conference on Computational Geometry (pp. 181-186) Canadian Conference on Computational Geometry(12).
  6. 47. Iacono, J., & Langerman, S. (2000). Dynamic point location in fat hyperrectangles with integer coordinates.
  7. 48. Iacono, J. (2000). Improved Upper Bounds for Pairing Heaps. In Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings Algorithm Theory - SWAT 2000, 7th Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 5-7, 2000, Proceedings: Vol. 1851 (pp. 32-45). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-44985-X_5
  8. 49. Iacono, J., & Langerman, S. (2000). Volume Queries in Polyhedra. In Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers: Vol. 2098 (pp. 156-159). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-47738-1_13
    9.   Rapports de recherche, comptes rendus, lettres à l'éditeur, working papers (3)
  9. 1. Aloupis, G., Cardinal, J., Collette, S., Iacono, J., & Langerman, S. (2009). Detecting all regular polygons in a point set.
  10. 2. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2009). Entropy, triangulation, and point location in planar subdivisions.
  11. 3. Collette, S., Iacono, J., Langerman, S., & Morin, P. P. (2006). Distribution-sensitive point location in convex subdivisions.
    12.   Participation aux jurys de thèse (2)
  12. 1. Ooms, A. (2019). Algorithms and Data Structures for 3SUM and Friends (Thèse doctorale non-publiée). Université libre de Bruxelles, Faculté des Sciences – Informatique, Bruxelles.
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 Suivant >>