Articles dans des revues avec comité de lecture (99)
  1. 73. Ballinger, B., Charlton, D., Demaine, E. D., Demaine, M. L., Iacono, J., Liu, C. H., & Poon, S. H. (2009). Minimal locked trees. Lecture notes in computer science, 5664, 61-73. doi:10.1007/978-3-642-03367-4_6
  2. 74. Bremner, D., Chen, D., Iacono, J., Langerman, S., & Morin, P. P. (2008). Output-sensitive algorithms for Tukey depth and related problems. Statistics and computing, 18(3), 259-266. doi:10.1007/s11222-008-9054-2
  3. 75. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. P. (2008). Distribution-sensitive point location in convex subdivisions. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 912-921.
  4. 76. Collette, S., Dujmović, V. V., Iacono, J., Langerman, S., & Morin, P. (2008). Distribution-sensitive point location in convex subdivisions. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 912-921.
  5. 77. Bădoiu, M., Cole, R., Demaine, E. D., & Iacono, J. (2007). A unified access bound on comparison-based dynamic dictionaries. Theoretical computer science, 382(2), 86-96. doi:10.1016/j.tcs.2007.03.002
  6. 78. Demaine, E. D., Iacono, J., & Langerman, S. (2007). Retroactive data structures. ACM transactions on algorithms, 3(2), 1240236. doi:10.1145/1240233.1240236
  7. 79. Bose, P., Demaine, E. D., Hurtado, F., Iacono, J., Langerman, S., & Morin, P. (2007). Geodesic Ham-Sandwich Cuts. Discrete & computational geometry, 37(3), 325-339. doi:10.1007/s00454-006-1287-2
  8. 80. Demaine, E. D., Harmon, D., Iacono, J., & Ptraşcu, M. (2007). Dynamic Optimality—Almost. SIAM journal on computing, 37(1), 240-251. doi:10.1137/S0097539705447347
  9. 81. Colannino, J. J., Damian, M., Hurtado, F., Iacono, J., Meijer, H., Ramaswami, S. S., & Toussaint, G. G. (2006). An O ( n log n )-Time Algorithm for the Restriction Scaffold Assignment Problem. Journal of computational biology, 13(4), 979-989. doi:10.1089/cmb.2006.13.979
  10. 82. Bremner, D., Chan, T. M., Demaine, E. D., Erickson, J. J., Hurtado, F., Iacono, J., Langerman, S., & Taslakian, P. (2006). Necklaces, convolutions, and X + Y. Lecture notes in computer science, 4168, 160-171. doi:10.1007/11841036\_17
  11. 83. El-Khechen, D., Fevens, T. T., & Iacono, J. (2006). Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n. Proceedings of the annual ACM Symposium on Computational Geometry.
  12. 84. Aronov, B. B., Davis, A. A., Iacono, J., & Yu, A. S. C. (2006). The complexity of diffuse reflections in a simple polygon. Lecture notes in computer science, 3887, 93-104. doi:10.1007/11682462_13
    13. << Précédent 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 Suivant >>