Articles dans des revues avec comité de lecture (104)
77.
Demaine, E. D., Harmon, D., Iacono, J., Kane, D. D., & Pǎtraşcu, M. (2009). The geometry of binary search trees. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms, 496-505. doi:10.1137/1.9781611973068.5578.
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_679.
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-280.
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.81.
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.84.
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