| Output-sensitive algorithms for computing nearest-neighbour decision boundaries D Bremner, E Demaine, J Erickson, J Iacono, S Langerman, P Morin, ... Discrete & Computational Geometry 33 (4), 593-604, 2005 | 255 | 2005 |
| Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface M Abe, K Aoki, G Ateniese, R Avanzi, Z Beerliová, O Billet, A Biryukov, ... Lecture Notes in Computer Science (including subseries Lecture Notes in …, 2006 | 191* | 2006 |
| Dynamic optimality—almost ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu SIAM Journal on Computing 37 (1), 240-251, 2007 | 117 | 2007 |
| Space-efficient planar convex hull algorithms H Brönnimann, J Iacono, J Katajainen, P Morin, J Morrison, G Toussaint Theoretical Computer Science 321 (1), 25-40, 2004 | 93* | 2004 |
| A locality-preserving cache-oblivious dynamic dictionary MA Bender, Z Duan, J Iacono, J Wu Journal of Algorithms 53 (2), 115-136, 2004 | 89 | 2004 |
| Alternatives to splay trees with O(log n) worst-case access times J Iacono Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001 | 87 | 2001 |
| Improved upper bounds for pairing heaps J Iacono arXiv preprint arXiv:1110.4428, 2011 | 76* | 2011 |
| The geometry of binary search trees ED Demaine, D Harmon, J Iacono, D Kane, M Patraşcu Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009 | 66 | 2009 |
| Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... European Symposium on Algorithms, 160-171, 2006 | 57 | 2006 |
| Retroactive data structures ED Demaine, J Iacono, S Langerman ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007 | 56 | 2007 |
| Expected asymptotically optimal planar point location J Iacono Computational Geometry 29 (1), 19-22, 2004 | 53* | 2004 |
| Necklaces, Convolutions, and X+Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithmica 69 (2), 294-314, 2014 | 50 | 2014 |
| A unified access bound on comparison-based dynamic dictionaries M Bădoiu, R Cole, ED Demaine, J Iacono Theoretical Computer Science 382 (2), 86-96, 2007 | 50 | 2007 |
| The cost of cache-oblivious searching MA Bender, GS Brodal, R Fagerberg, D Ge, S He, H Hu, J Iacono, ... Algorithmica 61 (2), 463-505, 2011 | 49 | 2011 |
| Output-sensitive algorithms for Tukey depth and related problems D Bremner, D Chen, J Iacono, S Langerman, P Morin Statistics and Computing 18 (3), 259-266, 2008 | 47 | 2008 |
| Cache-oblivious dynamic dictionaries with update/query tradeoffs GS Brodal, ED Demaine, JT Fineman, J Iacono, S Langerman, JI Munro Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 44 | 2010 |
| Proximity graphs: E, δ, Δ, χ and ω P Bose, V Dujmović, F Hurtado, J Iacono, S Langerman, H Meijer, ... International Journal of Computational Geometry & Applications 22 (05), 439-469, 2012 | 41 | 2012 |
| Key-independent optimality J Iacono Algorithmica 42 (1), 3-10, 2005 | 39 | 2005 |
| Using hashing to solve the dictionary problem (in external memory) J Iacono, M Pătraşcu Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012 | 36 | 2012 |
| Geodesic ham-sandwich cuts P Bose, ED Demaine, F Hurtado, J Iacono, S Langerman, P Morin Discrete & Computational Geometry 37 (3), 325-339, 2007 | 35 | 2007 |
Stefan LangermanDépartement d'Informatique, Université Libre de Bruxellesulb.ac.be의 이메일 확인됨
