John Iacono


Computer Science and Engineering

John Iacono
Stevens Institute of Technology 1996

Bachelor of Science, Computer Science

Stevens Institute of Technology 1996

Master of Science, Computer Science

Rutgers, The State University of New Jersey — New Brunswick2001

Doctor of Philosophy, Computer Science

Journal Articles

  • Pooya Davoodi, Jeremy T. Fineman, John Iacono, Özgür Özkan: Cache-Oblivious Persistence. ESA 2014: 296-308.
  • John Iacono, Özgür Özkan: Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not. ICALP (1) 2014: 637-649.
  • Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer: The Complexity of Order Type Isomorphism. SODA 2014: 405-415.
  • John Iacono: In Pursuit of the Dynamic Optimality Conjecture. Space-Efficient Data Structures, Streams, and Algorithms 2013: 236-250.
  • Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. ICALP (1) 2013: 388-399.
  • John Iacono, Mihai Patrascu: Using hashing to solve the dictionary problem. SODA 2012: 570-582.
  • Sébastien Collette, John Iacono, Stefan Langerman: Confluent persistence revisited. SODA 2012: 593-601.
  • John Iacono: A static optimality transformation with applications to planar point location. Symposium on Computational Geometry 2011: 21-26.
  • Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz: The Cost of Cache-Oblivious Searching. Algorithmica 61(2): 463-505 (2011).
  • John Iacono, Özgür Özkan: Mergeable Dictionaries. ICALP (1) 2010: 164-175.
  • Erik D. Demaine, Dion Harmon, John Iacono, Daniel M. Kane, Mihai Patrascu: The geometry of binary search trees. SODA 2009: 496-505.
  • Mihai Bădoiu, Richard Cole, Erik D. Demaine, and John Iacono. A unified access bound on comparison-based dynamic dictionaries. Theoretical Computer Science, 382(2):86, 2007.
  • Erik D. Demaine, John Iacono, and Stefan Langerman. Retroactive data structures. ACM Transactions on Algorithms, 3(2):325-339, 2007.
  • Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Pătraşcu. Dynamic optimality---almost. SIAM Journal on Computing, 37(1):240-251, 2007.

Research Interests

Data Structures Computational Geometry Algorithms

  • Alfred P Sloan Fellow.
  • Fulbright Research Scholar visiting the Université Libre de Bruxelles, 2015-2016.
  • Best paper award at the 2014 European Symposium on Algorithms for Cache-Oblivious Persistence, co-authored with Pooya Davoodi, Özgür Özkan and Jeremy Fineman.
  • Best paper award at the 2002 International Symposium on Algorithms and Computation for Key-independent optimality.