Articles dans des revues avec comité de lecture (99)
  1. 85. Aronov, B. B., Bose, P., Demaine, E. D., Gudmundsson, J., Iacono, J., Langerman, S., & Smid, M. M. (2006). Data structures for halfplane proximity queries and incremental Voronoi diagrams. Lecture notes in computer science, 3887, 80-92. doi:10.1007/11682462_12
  2. 86. Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., Meijer, H. H., Overmars, M. M., & Whitesides, S. S. (2005). Separating point sets in polygonal environments. International journal of Computational geometry and applications, 15(4), 403-419. doi:10.1142/S0218195905001762
  3. 87. Bremner, D., Demaine, E. D., Erickson, J. J., Iacono, J., Langerman, S., Morin, P. P., & Toussaint, G. G. (2005). Output-sensitive algorithms for computing nearest-neighbour decision boundaries. Discrete & computational geometry, 33(4), 593-604. doi:10.1007/s00454-004-1152-0
  4. 88. Iacono, J., & Langerman, S. (2005). Queaps. Algorithmica, 42(1), 49-56. doi:10.1007/s00453-004-1139-5
  5. 89. Iacono, J. (2005). Key-independent optimality. Algorithmica, 42(1), 3-10. doi:10.1007/s00453-004-1136-8
  6. 90. Demaine, E. D., Iacono, J., & Langerman, S. (2005). Grid vertex-unfolding orthostacks. Lecture notes in computer science, 3742 LNCS, 76-82. doi:10.1007/11589440_8
  7. 91. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Proximate point searching. Computational geometry, 28(1), 29-40. doi:10.1016/j.comgeo.2004.01.005
  8. 92. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Retroactive Data Structures. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 15, 274-283.
  9. 93. Demaine, E. D., Iacono, J., & Langerman, S. (2004). Worst-Case Optimal Tree Layout in a Memory Hierarchy. arXiv.org, cs.DS/0410048.
  10. 94. Br"onnimann, H., Iacono, J., Katajainen, J., Morin, P., Morrison, J., & Toussaint, G. G. (2004). Space-efficient planar convex hull algorithms. Theoretical computer science, 321(1), 25-40. doi:10.1016/j.tcs.2003.05.004
  11. 95. Iacono, J. (2004). Expected asymptotically optimal planar point location. Computational geometry, 29(1), 19-22. doi:10.1016/j.comgeo.2004.03.010
  12. 96. Bender, M., Duan, Z., Iacono, J., & Wu, J. (2004). A locality-preserving cache-oblivious dynamic dictionary. Journal of algorithms, 53(2), 115-136. doi:10.1016/j.jalgor.2004.04.014
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>