On the public citation graph

Fractional cascading: A data structuring technique with geometric applications

https://doi.org/10.1007/bfb0015734
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01683268openalex-snapshot
Design and implementation of an efficient priority queue
inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot
The Design of Dynamic Data Structures
inferredcites →https://doi.org/10.1016/0020-0190(77)90031-xopenalex-snapshot
Preserving order in a forest in less than logarithmic time and linear space
inferredcites →https://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot
Searching and storing similar lists
inferredcites →https://doi.org/10.1109/sfcs.1980.18openalex-snapshot
Efficient uses of the past
inferredcites →https://doi.org/10.1109/sfcs.1983.17openalex-snapshot
Filtering search: A new approach to query-answering
inferredcites →https://doi.org/10.1109/sfcs.1983.75openalex-snapshot
The power of geometric duality
inferredcites →https://doi.org/10.1109/sfcs.1984.715940openalex-snapshot
Dynamic Segment Intersection Search With Applications
inferredcites →https://doi.org/10.1109/tc.1980.1675628openalex-snapshot
An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles
inferredcites →https://doi.org/10.1137/0214019openalex-snapshot
New Data Structures for Orthogonal Range Queries
inferredcites →https://doi.org/10.1137/0214021openalex-snapshot
Priority Search Trees
inferredcites →https://doi.org/10.1137/0215023openalex-snapshot
Optimal Point Location in a Monotone Subdivision
inferredcites →https://doi.org/10.1145/323233.323252openalex-snapshot
Visibility and intersectin problems in plane geometry
inferredcites →https://doi.org/10.1145/323233.323256openalex-snapshot
Dynamization of geometric data structures
inferredcites →https://doi.org/10.1145/800061.808753openalex-snapshot
A linear-time algorithm for a special case of disjoint set union
inferredcites →https://doi.org/10.1184/r1/6591230openalex-snapshot
A Problem in Multivariate Statistics: Algorithm, Data Structure, and Applications

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-16761-7_94openalex-snapshot
Lower bounds for dynamic range query problems that permit subtraction (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_30openalex-snapshot
On the bivariate function minimization problem and its applications to motion planning
inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_9openalex-snapshot
Davenport-Schinzel Sequences and their Geometric Applications
inferred← citeshttps://doi.org/10.1007/s00453-025-01314-yopenalex-snapshot
Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
inferred← citeshttps://doi.org/10.1007/s10766-016-0472-zopenalex-snapshot
dCompaction: Delayed Compaction for the LSM-Tree
inferred← citeshttps://doi.org/10.1007/s11390-017-1704-4openalex-snapshot
dCompaction: Speeding up Compaction of the LSM-Tree via Delayed Compaction
inferred← citeshttps://doi.org/10.1080/02693799408901985openalex-snapshot
Visibility algorithms on triangulated digital terrain models
inferred← citeshttps://doi.org/10.1109/sfcs.1986.23openalex-snapshot
Geometric applications of Davenport-Schinzel sequences
inferred← citeshttps://doi.org/10.1109/tc.1984.1676388openalex-snapshot
Computational Geometry—A Survey
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22472.xopenalex-snapshot
Planar Point Location Using Persistent Search Treesa
inferred← citeshttps://doi.org/10.1137/0215051openalex-snapshot
Filtering Search: A New Approach to Query-Answering
inferred← citeshttps://doi.org/10.1145/10515.10524openalex-snapshot
On the application of shared retrieval to orthogonal range queries
inferred← citeshttps://doi.org/10.1145/10515.10547openalex-snapshot
Linear data structures for two types of range search
inferred← citeshttps://doi.org/10.1145/12130.12142openalex-snapshot
Making data structures persistent
inferred← citeshttps://doi.org/10.1145/2038916.2038917openalex-snapshot
An efficient multi-tier tablet server storage architecture
inferred← citeshttps://doi.org/10.1145/31846.42228openalex-snapshot
Multidimensional search trees that provide new types of memory reductions
inferred← citeshttps://doi.org/10.1145/6138.6151openalex-snapshot
Planar point location using persistent search trees
inferred← citeshttps://doi.org/10.1561/1900000059openalex-snapshot
Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines
inferred← citeshttps://doi.org/10.4236/iim.2012.42006openalex-snapshot
A Logarithmic-Complexity Algorithm for Nearest Neighbor Classification Using Layered Range Trees
inferred← citeshttps://doi.org/10.4304/jcp.4.9.913-919openalex-snapshot
Canonical Polygon Queries on the Plane: A New Approach
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.