John Iacono

Q: What Schools Are Affiliated With John Iacono

John Iacono is affiliated with the following schools: New York University, Rutgers University–New Brunswick, University of Maryland, College Park, New York University Tandon School of Engineering, Stevens Institute of Technology

John Iacono's AcademicInfluence.com Rankings

John Iacono

Computer Science

#1808

World Rank

#1875

Historical Rank

#864

USA Rank

Database

#9348

World Rank

#9839

Historical Rank

#1308

USA Rank

computer-science Degrees

Download Badge

Computer Science

John Iacono's Degrees

PhD Computer Science University of Maryland, College Park
Masters Computer Science University of Maryland, College Park
Bachelors Computer Science University of Maryland, College Park

Similar Degrees You Can Earn

Why Is John Iacono Influential?

(Suggest an Edit or Addition)

According to Wikipedia, John Iacono is an American computer scientist specializing in data structures, algorithms and computational geometry. He is one of the inventors of the tango tree, the first known competitive binary search tree data structure.

(See a Problem?)

John Iacono's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries (2003) (207)
Locality (2019) (113)
Dynamic Optimality - Almost (2004) (103)
A locality-preserving cache-oblivious dynamic dictionary (2002) (102)
Alternatives to splay trees with O(log n) worst-case access times (2001) (86)
The geometry of binary search trees (2009) (77)
Necklaces, Convolutions, and X+Y (2006) (73)
Improved Upper Bounds for Pairing Heaps (2000) (57)
Space-efficient planar convex hull algorithms (2004) (55)
A unified access bound on comparison-based dynamic dictionaries (2007) (46)
Retroactive data structures (2004) (46)
Output-sensitive algorithms for Tukey depth and related problems (2008) (41)
The Cost of Cache-Oblivious Searching (2003) (38)
Key-Independent Optimality (2005) (34)
Cache-oblivious dynamic dictionaries with update/query tradeoffs (2010) (32)
Expected asymptotically optimal planar point location (2004) (29)
In Pursuit of the Dynamic Optimality Conjecture (2013) (28)
Dynamic optimality - almost [competitive online binary search tree] (2007) (28)
Geodesic Ham-Sandwich Cuts (2004) (27)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (2012) (26)
Distribution-sensitive data structures (2001) (26)
Efficient Reconfiguration of Lattice-Based Modular Robots (2013) (26)
Solving k-SUM Using Few Linear Queries (2015) (25)
An O(n log n)-Time Algorithm for the Restriction Scaffold Assignment Problem (2005) (24)
Encoding 2D Range Maximum Queries (2011) (24)
Separating point sets in polygonal environments (2004) (23)
Weighted dynamic finger in binary search trees (2016) (22)
Wrapping spheres with flat paper (2009) (22)
Using hashing to solve the dictionary problem (2012) (22)
Proximate point searching (2004) (20)
Optimal planar point location (2001) (20)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
In-Place Planar Convex Hull Algorithms (2002) (18)
Common Unfoldings of Polyominoes and Polycubes (2010) (17)
Proximate planar point location (2003) (17)
Competitive Online Search Trees on Trees (2019) (16)
Encodings for Range Selection and Top-k Queries (2013) (15)
The Power and Limitations of Static Binary Search Trees with Lazy Finger (2013) (14)
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (2005) (14)
Combining Binary Search Trees (2013) (14)
Dynamic point location in fat hyperrectangles with integer coordinates (2000) (14)
Continuous Blooming of Convex Polyhedra (2009) (14)
Packing 2×2 unit squares into grid polygons is NP-complete (2009) (13)
A static optimality transformation with applications to planar point location (2011) (13)
The Complexity of Order Type Isomorphism (2013) (11)
Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs (2018) (11)
Encoding 2-D Range Maximum Queries (2011) (11)
Why Some Heaps Support Constant-Amortized-Time Decrease-Key Operations, and Others Do Not (2013) (11)
Subquadratic Algorithms for Algebraic 3SUM (2018) (11)
Distribution-sensitive point location in convex subdivisions (2008) (10)
Subquadratic Encodings for Point Configurations (2018) (10)
Using Hashing to Solve the Dictionary Problem (In External Memory) (2011) (10)
Worst-Case Optimal Tree Layout in a Memory Hierarchy (2004) (10)
Mergeable Dictionaries (2010) (10)
Grid Vertex-Unfolding Orthostacks (2004) (10)
Dynamic Geometric Independent Set (2020) (9)
On the hierarchy of distribution-sensitive properties for data structures (2013) (9)
The Complexity of Diffuse Reflections in a Simple Polygon (2006) (9)
Entropy, triangulation, and point location in planar subdivisions (2009) (9)
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top-k Queries (2017) (9)
Incremental Voronoi Diagrams (2016) (8)
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms: Preface (2006) (8)
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets (2020) (8)
Worst-Case Optimal Tree Layout in External Memory (2004) (8)
Key Independent Optimality (2002) (8)
Packing identical simple polygons is NP-hard (2012) (7)
Subquadratic Algorithms for Algebraic Generalizations of 3SUM (2016) (7)
The Fresh-Finger Property (2013) (7)
Volume Queries in Polyhedra (2000) (7)
Oja centers and centers of gravity (2013) (6)
Minimal Locked Trees (2009) (6)
Curves in the Sand: Algorithmic Drawing (2006) (5)
Worst-Case Efficient Dynamic Geometric Independent Set (2021) (5)
A priority queue with the time-finger property (2012) (5)
Proximate point location (2003) (5)
Partitioning a Polygon into Two Mirror Congruent Pieces (2008) (5)
A Tight Lower Bound for Decrease-Key in the Pure Heap Model (2014) (5)
A Unifying Property for Distribution-Sensitive Priority Queues (2011) (4)
Confluent persistence revisited (2011) (4)
Dynamic Trees with Almost-Optimal Access Cost (2018) (3)
Searching Edges in the Overlap of Two Plane Graphs (2017) (3)
Nearest-Neighbor Search Under Uncertainty (2017) (3)
A Linear Potential Function for Pairing Heaps (2016) (3)
Conditional Lower Bounds for Dynamic Geometric Measure Problems (2021) (3)
An Efficient Multiway Mergesort for GPU Architectures (2017) (3)
Encoding Nearest Larger Values (2017) (3)
Where to build a temple, and where to dig to find one (2006) (3)
External memory priority queues with decrease-key and applications to graph algorithms (2019) (2)
A parallel priority queue with fast updates for GPU architectures (2019) (2)
Spanning Properties of Theta–Theta-6 (2018) (2)
Cache-Oblivious Persistence (2014) (2)
Belga B-Trees (2019) (2)
Subquadratic Algorithms for Some 3Sum-Hard Geometric Problems in the Algebraic Decision Tree Model (2022) (2)
Compatible Paths on Labelled Point Sets (2020) (2)
Detecting all regular polygons in a point set (2009) (2)
External Memory Planar Point Location with Fast Updates (2019) (1)
Dynamic Schnyder Woods (2021) (1)
Wrapping the mozartkugel (2007) (1)
How to Cover Most of a Point Set with a V-Shape of Minimum Width (2013) (1)
Detecting duplicates among similar bit vectors (2004) (1)
An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment (2005) (1)
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (2017) (1)
Meshes Preserving Minimum Feature Size (2012) (1)
Order type invariant labeling and comparison of point sets (2012) (1)
Oja Medians and Centers of Mass (2010) (1)
Encoding 3SUM (2019) (1)
Subquadratic Algorithms for Some \textsc{3Sum}-Hard Geometric Problems in the Algebraic Decision Tree Model (2021) (1)
Cache-Oblivious Priority Queues with Decrease-Key and Applications to Graph Algorithms. (2019) (1)
3.1 Two Cost Models 3.2 Wilber's Interleave Bound (0)
Necklaces , Convolutions , and X + Y Citation (2012) (0)
An Instance-optimal Algorithm for Bichromatic Rectangular Visibility (2021) (0)
Quartering a square optimally (2002) (0)
D S ] 1 J ul 2 01 4 Cache-Oblivious Persistence (2014) (0)
Flattening fixed-angle chains is strongly NP-hard Citation (2011) (0)
Algorithms and data structures : 12th International Symposium, WADS 2011, New York, NY, USA, August 15-17, 2011 : proceedings (2011) (0)
How Fast Can We Play Tetris Greedily With Rectangular Pieces? (2022) (0)
Sorting Similar Vectors (2005) (0)
D ec 2 01 2 Necklaces , Convolutions , and X + (2014) (0)
Lossless fault-tolerant data structures with additive overhead Citation (2011) (0)
Scalable Data Structures (Dagstuhl Seminar 21071) (2021) (0)
Spanning Properties of Theta–Theta-6 (2020) (0)
Necklaces, Convolutions, and X+Y (2012) (0)
Unit-Time Predecessor Queries on Massive Data Sets (2010) (0)
Belga B-Trees (2020) (0)
Subquadratic Algorithms for Algebraic 3SUM (2018) (0)
Coverage with k-transmitters in the presence of obstacles (2012) (0)
Lecture 9: Scapegoat and Splay Trees 9 Scapegoat and Splay Trees 9.1 Definitions Released under a Creative Commons Attribution-noncommercial-sharealike 3.0 License (0)
Covering Points with Disjoint Translates of a Triangle (2018) (0)
Oja medians and centers of gravity (2010) (0)
In pursuit of a dynamic tree decomposition (2018) (0)
Minimum feature size preserving decompositions (2009) (0)
Range Minimum Query Indexes in Higher Dimensions (2015) (0)
External-memory dictionaries with worst-case update cost (2022) (0)
Locality-of-Reference Optimality of Cache-Oblivious Algorithms (2022) (0)
Fragile Complexity of Adaptive Algorithms (2021) (0)
Partitioning a Regular n-gon into n+1 Convex Congruent Pieces is Impossible, for Sufficiently Large n (2006) (0)
Workshop Committee (2021) (0)
On the hierarchy of distribution-sensitive properties for data structures (2013) (0)
UWS Academic Portal Effectiveness of yoga and educational intervention on disability, anxiety, depression, and pain in people with CLBP Kuvacic, (2019) (0)
Foreword (2014) (0)
Sublinear Explicit Incremental Planar Voronoi Diagrams (2020) (0)
A 3-D visualization of kirkpatrick's planar point location algorithm (2003) (0)
Approximability of (Simultaneous) Class Cover for Boxes (2021) (0)
Subquadratic-Space Query-Efficient Data Structures for Realizable Order Types (2017) (0)
Worst-Case Optimal Tree Layout in External Memory (2014) (0)
Incremental Voronoi Diagrams (2017) (0)
Priority Queues with Multiple Time Fingers (2010) (0)
The Power and Limitations of Static Binary Search Trees with Lazy Finger (2016) (0)

This paper list is powered by the following services:

Other Resources About John Iacono

What Schools Are Affiliated With John Iacono?

John Iacono is affiliated with the following schools:

John Iacono's Academic­Influence.com Rankings