John Iacono

According to our database1, John Iacono authored at least 106 papers between 2000 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
Spanning Properties of Theta-Theta-6.
Graphs Comb., 2020

Sublinear Explicit Incremental Planar Voronoi Diagrams.
CoRR, 2020

Competitive Online Search Trees on Trees.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Subquadratic encodings for point configurations.
JoCG, 2019

Subquadratic Algorithms for Algebraic 3SUM.
Discret. Comput. Geom., 2019

A parallel priority queue with fast updates for GPU architectures.
CoRR, 2019

Encoding 3SUM.
CoRR, 2019

Locality.
CoRR, 2019

External Memory Planar Point Location with Fast Updates.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

External Memory Priority Queues with Decrease-Key and Applications to Graph Algorithms.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Belga B-Trees.
Proceedings of the Computer Science - Theory and Applications, 2019

2018
Encoding nearest larger values.
Theor. Comput. Sci., 2018

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
Algorithmica, 2018

Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs.
Proceedings of the 32nd International Conference on Supercomputing, 2018

Dynamic Trees with Almost-Optimal Access Cost.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Compatible Paths on Labelled Point Sets.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries.
ACM Trans. Algorithms, 2017

Incremental Voronoi Diagrams.
Discret. Comput. Geom., 2017

An Efficient Multiway Mergesort for GPU Architectures.
CoRR, 2017

Searching Edges in the Overlap of Two Plane Graphs.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Nearest-Neighbor Search Under Uncertainty.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Encoding 2D range maximum queries.
Theor. Comput. Sci., 2016

The Power and Limitations of Static Binary Search Trees with Lazy Finger.
Algorithmica, 2016

Weighted dynamic finger in binary search trees.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Solving k-SUM Using Few Linear Queries.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

A Linear Potential Function for Pairing Heaps.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Worst-Case Optimal Tree Layout in External Memory.
Algorithmica, 2015

Range Minimum Query Indexes in Higher Dimensions.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
A Tight Lower Bound for Decrease-Key in the Pure Heap Model.
CoRR, 2014

Foreword.
Comput. Geom., 2014

Necklaces, Convolutions, and X+Y.
Algorithmica, 2014

The Complexity of Order Type Isomorphism.
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

Cache-Oblivious Persistence.
Proceedings of the Algorithms - ESA 2014, 2014

2013
Coverage with k-transmitters in the presence of obstacles.
J. Comb. Optim., 2013

The Fresh-Finger Property
CoRR, 2013

Why some heaps support constant-amortized-time decrease-key operations, and others do not
CoRR, 2013

The Complexity of Order Type Isomorphism.
CoRR, 2013

Oja centers and centers of gravity.
Comput. Geom., 2013

Efficient reconfiguration of lattice-based modular robots.
Comput. Geom., 2013

On the hierarchy of distribution-sensitive properties for data structures.
Acta Informatica, 2013

Combining Binary Search Trees.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Encodings for Range Selection and Top-k Queries.
Proceedings of the Algorithms - ESA 2013, 2013

How to Cover Most of a Point Set with a V-Shape of Minimum Width.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

In Pursuit of the Dynamic Optimality Conjecture.
Proceedings of the Space-Efficient Data Structures, 2013

2012
Entropy, triangulation, and point location in planar subdivisions.
ACM Trans. Algorithms, 2012

A priority queue with the time-finger property.
J. Discrete Algorithms, 2012

A Static Optimality Transformation with Applications to Planar Point Location.
Int. J. Comput. Geom. Appl., 2012

PROXIMITY GRAPHS: E, δ, Δ, χ AND ω.
Int. J. Comput. Geom. Appl., 2012

Packing identical simple polygons is NP-hard
CoRR, 2012

Using hashing to solve the dictionary problem.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Confluent persistence revisited.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011
Continuous Blooming of Convex Polyhedra.
Graphs Comb., 2011

Encoding 2-D Range Maximum Queries
CoRR, 2011

Using Hashing to Solve the Dictionary Problem (In External Memory)
CoRR, 2011

The Cost of Cache-Oblivious Searching.
Algorithmica, 2011

Meshes Preserving Minimum Feature Size.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

A Unifying Property for Distribution-Sensitive Priority Queues.
Proceedings of the Combinatorial Algorithms - 22nd International Workshop, 2011

Encoding 2D Range Maximum Queries.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

A static optimality transformation with applications to planar point location.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
Grid Vertex-Unfolding Orthostacks.
Int. J. Comput. Geom. Appl., 2010

Priority Queues with Multiple Time Fingers
CoRR, 2010

Editorial.
Comput. Geom., 2010

Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Unit-Time Predecessor Queries on Massive Data Sets.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Mergeable Dictionaries.
Proceedings of the Data Structures, 28.02. - 05.03.2010, 2010

Coverage with k-Transmitters in the Presence of Obstacles.
Proceedings of the Combinatorial Optimization and Applications, 2010

Common Unfoldings of Polyominoes and Polycubes.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Oja medians and centers of gravity.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

2009
Minimum feature size preserving decompositions
CoRR, 2009

Detecting all regular polygons in a point set
CoRR, 2009

Wrapping spheres with flat paper.
Comput. Geom., 2009

Minimal Locked Trees.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

The geometry of binary search trees.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Packing 2×2 unit squares into grid polygons is NP-complete.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Output-sensitive algorithms for Tukey depth and related problems.
Stat. Comput., 2008

Distribution-sensitive point location in convex subdivisions.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Partitioning a Polygon into Two Mirror Congruent Pieces.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
A unified access bound on comparison-based dynamic dictionaries.
Theor. Comput. Sci., 2007

Retroactive data structures.
ACM Trans. Algorithms, 2007

Dynamic Optimality - Almost.
SIAM J. Comput., 2007

Geodesic Ham-Sandwich Cuts.
Discret. Comput. Geom., 2007

2006
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem.
J. Comput. Biol., 2006

The Complexity of Diffuse Reflections in a Simple Polygon.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Necklaces, Convolutions, and X + Y.
Proceedings of the Algorithms, 2006

Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

Curves in the Sand: Algorithmic Drawing.
Proceedings of the 18th Annual Canadian Conference on Computational Geometry, 2006

2005
Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geom. Appl., 2005

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discret. Comput. Geom., 2005

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment
CoRR, 2005

Queaps.
Algorithmica, 2005

Key-Independent Optimality.
Algorithmica, 2005

2004
Space-efficient planar convex hull algorithms.
Theor. Comput. Sci., 2004

A locality-preserving cache-oblivious dynamic dictionary.
J. Algorithms, 2004

Worst-Case Optimal Tree Layout in a Memory Hierarchy
CoRR, 2004

Expected asymptotically optimal planar point location.
Comput. Geom., 2004

Proximate point searching.
Comput. Geom., 2004

2003
Proximate planar point location.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

A 3-D visualization of kirkpatrick's planar point location algorithm.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
In-Place Planar Convex Hull Algorithms.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Alternatives to splay trees with O(log n) worst-case access times.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Optimal planar point location.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Improved Upper Bounds for Pairing Heaps.
Proceedings of the Algorithm Theory, 2000

Volume Queries in Polyhedra.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Dynamic point location in fat hyperrectangles with integer coordinates.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000


  Loading...