| 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, 593-604, 2005 | 285 | 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 | 177* | 2006 |
| Dynamic optimality—almost ED Demaine, D Harmon, J Iacono, M P a ˇ traşcu SIAM Journal on Computing 37 (1), 240-251, 2007 | 140 | 2007 |
| A locality-preserving cache-oblivious dynamic dictionary MA Bender, Z Duan, J Iacono, J Wu Journal of Algorithms 53 (2), 115-136, 2004 | 96 | 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 | 92 | 2001 |
| 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 | 89 | 2009 |
| 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 | 84 | 2004 |
| Improved upper bounds for pairing heaps J Iacono arXiv preprint arXiv:1110.4428, 2011 | 83* | 2011 |
| Necklaces, Convolutions, and X+Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... Algorithmica 69 (2), 294-314, 2014 | 69 | 2014 |
| Necklaces, Convolutions, and X + Y D Bremner, TM Chan, ED Demaine, J Erickson, F Hurtado, J Iacono, ... European Symposium on Algorithms, 160-171, 2006 | 69 | 2006 |
| Retroactive data structures ED Demaine, J Iacono, S Langerman ACM Transactions on Algorithms (TALG) 3 (2), 13-es, 2007 | 65 | 2007 |
| Output-sensitive algorithms for Tukey depth and related problems D Bremner, D Chen, J Iacono, S Langerman, P Morin Statistics and Computing 18, 259-266, 2008 | 57 | 2008 |
| Expected asymptotically optimal planar point location J Iacono Computational Geometry 29 (1), 19-22, 2004 | 52* | 2004 |
| 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 | 51 | 2011 |
| 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 | 51 | 2007 |
| 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 | 49 | 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 | 47 | 2012 |
| 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 | 44 | 2012 |
| Key-independent optimality J Iacono Algorithmica 42, 3-10, 2005 | 43 | 2005 |
| Wrapping spheres with flat paper ED Demaine, ML Demaine, J Iacono, S Langerman Computational geometry 42 (8), 748-757, 2009 | 39* | 2009 |
Stefan LangermanDépartement d'Informatique, Université Libre de Bruxellesبريد إلكتروني تم التحقق منه على ulb.ac.beErik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of Technologyبريد إلكتروني تم التحقق منه على mit.edu
Pat MorinCarleton Universityبريد إلكتروني تم التحقق منه على scs.carleton.ca
Prosenjit BoseCarleton Universityبريد إلكتروني تم التحقق منه على scs.carleton.ca
Jean CardinalUniversité libre de Bruxelles (ULB)بريد إلكتروني تم التحقق منه على ulb.be
Jeff EricksonProfessor of Computer Science, University of Illinois Urbana-Champaignبريد إلكتروني تم التحقق منه على illinois.edu
Vida DujmovicUniversity of Ottawaبريد إلكتروني تم التحقق منه على uottawa.ca
Martin DemaineMITبريد إلكتروني تم التحقق منه على mit.edu
Perouz TaslakianService Nowبريد إلكتروني تم التحقق منه على servicenow.com
Mihai PatrascuAT&T Labsبريد إلكتروني تم التحقق منه على alum.mit.edu
Michael A. BenderStony Brook Universityبريد إلكتروني تم التحقق منه على cs.stonybrook.edu
Rajeev RamanProfessor, Department of Computing and Mathematical Sciences, University of Leicesterبريد إلكتروني تم التحقق منه على leicester.ac.uk
Gerth Stølting BrodalAarhus Universityبريد إلكتروني تم التحقق منه على cs.au.dk
Stefanie WuhrerINRIA Grenoble Rhone-Alpesبريد إلكتروني تم التحقق منه على inria.fr
Srinivasa Rao SattiProfessor, NTNUبريد إلكتروني تم التحقق منه على ntnu.no
Sarah R. AllenCarnegie Mellon Universityبريد إلكتروني تم التحقق منه على cs.cmu.edu
