2009 |
45 | EE | Erik D. Demaine,
Dion Harmon,
John Iacono,
Daniel Kane,
Mihai Patrascu:
The geometry of binary search trees.
SODA 2009: 496-505 |
44 | EE | Sébastien Collette,
Vida Dujmovic,
John Iacono,
Stefan Langerman,
Pat Morin:
Entropy, Triangulation, and Point Location in Planar Subdivisions
CoRR abs/0901.1908: (2009) |
2008 |
43 | | Dania El-Khechen,
John Iacono,
Thomas Fevens,
Günter Rote:
Partitioning a Polygon into Two Mirror Congruent Pieces.
CCCG 2008 |
42 | EE | Sébastien Collette,
Vida Dujmovic,
John Iacono,
Stefan Langerman,
Pat Morin:
Distribution-sensitive point location in convex subdivisions.
SODA 2008: 912-921 |
41 | EE | David Bremner,
Dan Chen,
John Iacono,
Stefan Langerman,
Pat Morin:
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing 18(3): 259-266 (2008) |
2007 |
40 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Retroactive data structures.
ACM Transactions on Algorithms 3(2): (2007) |
39 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic Ham-Sandwich Cuts.
Discrete & Computational Geometry 37(3): 325-339 (2007) |
38 | EE | Erik D. Demaine,
Dion Harmon,
John Iacono,
Mihai Patrascu:
Dynamic Optimality - Almost.
SIAM J. Comput. 37(1): 240-251 (2007) |
37 | EE | Mihai Badoiu,
Richard Cole,
Erik D. Demaine,
John Iacono:
A unified access bound on comparison-based dynamic dictionaries.
Theor. Comput. Sci. 382(2): 86-96 (2007) |
2006 |
36 | EE | Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Vida Dujmovic,
Dania El-Khechen,
Robin Y. Flatland,
John Iacono,
Stefan Langerman,
Henk Meijer,
Suneeta Ramaswami,
Diane L. Souvaine,
Perouz Taslakian,
Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing.
CCCG 2006 |
35 | EE | Dania El-Khechen,
Thomas Fevens,
John Iacono:
Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n.
CCCG 2006 |
34 | EE | David Bremner,
Timothy M. Chan,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Perouz Taslakian:
Necklaces, Convolutions, and X + Y.
ESA 2006: 160-171 |
33 | EE | Boris Aronov,
Prosenjit Bose,
Erik D. Demaine,
Joachim Gudmundsson,
John Iacono,
Stefan Langerman,
Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
LATIN 2006: 80-92 |
32 | EE | Boris Aronov,
Alan R. Davis,
John Iacono,
Albert Siu Cheong Yu:
The Complexity of Diffuse Reflections in a Simple Polygon.
LATIN 2006: 93-104 |
31 | EE | Justin Colannino,
Mirela Damian,
Ferran Hurtado,
John Iacono,
Henk Meijer,
Suneeta Ramaswami,
Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.
Journal of Computational Biology 13(4): 979-989 (2006) |
2005 |
30 | EE | John Iacono:
Key-Independent Optimality.
Algorithmica 42(1): 3-10 (2005) |
29 | EE | John Iacono,
Stefan Langerman:
Queaps.
Algorithmica 42(1): 49-56 (2005) |
28 | EE | Justin Colannino,
Mirela Damian,
Ferran Hurtado,
John Iacono,
Henk Meijer,
Suneeta Ramaswami,
Godfried T. Toussaint:
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
CoRR abs/cs/0507013: (2005) |
27 | EE | Boris Aronov,
Prosenjit Bose,
Erik D. Demaine,
Joachim Gudmundsson,
John Iacono,
Stefan Langerman,
Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
CoRR abs/cs/0512091: (2005) |
26 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry 33(4): 593-604 (2005) |
25 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005) |
2004 |
24 | EE | Erik D. Demaine,
Dion Harmon,
John Iacono,
Mihai Patrascu:
Dynamic Optimality -- Almost.
FOCS 2004: 484-490 |
23 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Grid Vertex-Unfolding Orthostacks.
JCDCG 2004: 76-82 |
22 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Retroactive data structures.
SODA 2004: 281-290 |
21 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic ham-sandwich cuts.
Symposium on Computational Geometry 2004: 1-9 |
20 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating point sets in polygonal environments.
Symposium on Computational Geometry 2004: 10-16 |
19 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Worst-Case Optimal Tree Layout in a Memory Hierarchy
CoRR cs.DS/0410048: (2004) |
18 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Proximate point searching.
Comput. Geom. 28(1): 29-40 (2004) |
17 | EE | John Iacono:
Expected asymptotically optimal planar point location.
Comput. Geom. 29(1): 19-22 (2004) |
16 | EE | Michael A. Bender,
Ziyang Duan,
John Iacono,
Jing Wu:
A locality-preserving cache-oblivious dynamic dictionary.
J. Algorithms 53(2): 115-136 (2004) |
15 | EE | Hervé Brönnimann,
John Iacono,
Jyrki Katajainen,
Pat Morin,
Jason Morrison,
Godfried T. Toussaint:
Space-efficient planar convex hull algorithms.
Theor. Comput. Sci. 321(1): 25-40 (2004) |
2003 |
14 | EE | 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.
FOCS 2003: 271-282 |
13 | EE | John Iacono,
Stefan Langerman:
Proximate planar point location.
Symposium on Computational Geometry 2003: 220-226 |
12 | EE | John Iacono:
A 3-D visualization of kirkpatrick's planar point location algorithm.
Symposium on Computational Geometry 2003: 377 |
11 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
WADS 2003: 451-461 |
2002 |
10 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Proximate point searching.
CCCG 2002: 1-4 |
9 | EE | John Iacono,
Stefan Langerman:
Queaps.
ISAAC 2002: 211-218 |
8 | EE | John Iacono:
Key Independent Optimality.
ISAAC 2002: 25-31 |
7 | EE | Hervé Brönnimann,
John Iacono,
Jyrki Katajainen,
Pat Morin,
Jason Morrison,
Godfried T. Toussaint:
In-Place Planar Convex Hull Algorithms.
LATIN 2002: 494-507 |
6 | EE | Michael A. Bender,
Ziyang Duan,
John Iacono,
Jing Wu:
A locality-preserving cache-oblivious dynamic dictionary.
SODA 2002: 29-38 |
2001 |
5 | EE | John Iacono:
Optimal planar point location.
SODA 2001: 340-341 |
4 | EE | John Iacono:
Alternatives to splay trees with O(log n) worst-case access times.
SODA 2001: 516-522 |
2000 |
3 | EE | John Iacono,
Stefan Langerman:
Dynamic point location in fat hyperrectangles with integer coordinates.
CCCG 2000 |
2 | EE | John Iacono,
Stefan Langerman:
Volume Queries in Polyhedra.
JCDCG 2000: 156-159 |
1 | EE | John Iacono:
Improved Upper Bounds for Pairing Heaps.
SWAT 2000: 32-45 |