Communications publiées lors de congrès ou colloques nationaux et internationaux (81)
  1. 55. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Retroactive data structures. In Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, New Orleans, Louisiana, USA, January 11-14, 2004 (pp. 281-290) SIAM.
  2. 56. Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H., Overmars, M. M., & Whitesides, S. S. (2004). Separating point sets in polygonal environments. In Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 Proceedings of the 20th ACM Symposium on Computational Geometry, Brooklyn, New York, USA, June 8-11, 2004 (pp. 10-16) ACM. doi:10.1145/997817.997822
  3. 57. Aloupis, G., Fevens, T. T., Langerman, S., Matsui, T. T., Mesa, A. A., Nuñez, Y. Y., Rappaport, D. D., & Toussaint, G. G. (2003). Computing a geometric measure of the similarity between two melodies. Proceedings of the 15th Canadian Conference on Computational Geometry (pp. 81-84) Canadian Conference on Computational Geometry(15).
  4. 58. Iacono, J., & Langerman, S. (2003). Proximate point location. Proceedings of the 2003 ACM Symposium on Computational Geometry (pp. 220-226).
  5. 59. Demaine, E. D., Erickson, J. J., & Langerman, S. (2003). On the complexity of halfspace volume queries. Proceedings of the 15th Canadian Conference on Computational Geometry (pp. 159-160) Canadian Conference on Computational Geometry(15).
  6. 60. Bremner, D., Demaine, E. D., Erickson, J. J., Iacono, J., Langerman, S., Morin, P., & Toussaint, G. G. (2003). Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. In Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings Algorithms and Data Structures, 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 - August 1, 2003, Proceedings: Vol. 2748 (pp. 451-461). (Lecture Notes in Computer Science). Springer. doi:10.1007/978-3-540-45078-8_39
  7. 61. Iacono, J., & Langerman, S. (2003). Proximate planar point location. In Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003 Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003 (pp. 220-226) ACM. doi:10.1145/777792.777826
  8. 62. Aloupis, G., Bose, P., Demaine, E. D., Langerman, S., Meijer, H. H., Overmars, M. M., & Toussaint, G. G. (2002). Computing Signed Permutations of Polygons. Proceedings of the 14th Canadian Conference on Computational Geometry (pp. 68-71) Canadian Conference on Computational Geometry(14: 12-14 August 2002: University of Lethbridge, Alberta, Canada).
  9. 63. Golin, M., Langerman, S., & Steiger, W. W. (2002). The convex hull for random lines in the plane. Proceedings of the Japan Conference on Discrete and Computational Geometry (pp. 14-15).
  10. 64. 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).
  11. 65. Bose, P., Krizanc, D. D., Langerman, S., & Morin, P. P. (2002). Asymmetric communication protocols via hotlink assignments. Proceedings of the IX International Colloquium on Structural Information and Com- munication Complexity (pp. 33-40).
  12. 66. Demaine, E. D., Langerman, S., O'Rourke, J., & Snoeyink, J. (2002). Interlocked open linkages with few joints. Proceedings of the 2002 ACM Symposium on Computational Geometry (pp. 189-198).
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Suivant >>