Communications publiées lors de congrès ou colloques nationaux et internationaux (47)
  1. 35. Demaine, E. D., Iacono, J., & Langerman, S. (2002). Proximate point searching. Proceedings of the 14th Canadian Conference on Computational Geometry (pp. 1-4) Canadian Conference on Computational Geometry(14).
  2. 36. Bose, P., Demaine, E. D., Iacono, J., & Langerman, S. (2002). Quartering a square optimally. Proceedings of the Japan Conference on Discrete and Computational Geometry (pp. 5-6).
  3. 37. Bender, M., Duan, Z., Iacono, J., & Wu, J. (2002). A locality-preserving cache-oblivious dynamic dictionary. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA (pp. 29-38) ACM/SIAM.
  4. 38. Demaine, E. D., Iacono, J., & Langerman, S. (2002). Proximate point searching.
  5. 39. Br"onnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., & Toussaint, G. G. (2002). In-Place Planar Convex Hull Algorithms. In LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings LATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Cancun, Mexico, April 3-6, 2002, Proceedings: Vol. 2286 (pp. 494-507). (Lecture Notes in Computer Science). Springer. doi:10.1007/3-540-45995-2_43
  6. 40. 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
  7. 41. 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
  8. 42. 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.
  9. 43. 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.
  10. 44. 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).
  11. 45. 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
  12. 46. 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
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>