On the public citation graph

Fractional cascading: II. Applications

0 signed · 143 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/bf01934990openalex-snapshot

The power of geometric duality

inferredcites →https://doi.org/10.1007/bfb0014927openalex-snapshot

The Design of Dynamic Data Structures

inferredcites →https://doi.org/10.1016/0020-0190(82)90090-4openalex-snapshot

Polygonal intersection searching

inferredcites →https://doi.org/10.1016/0020-0190(86)90088-8openalex-snapshot

Halfplanar range search in linear space and O(n0.695) query time

inferredcites →https://doi.org/10.1016/0022-0000(79)90042-4openalex-snapshot

A class of algorithms which require nonlinear time to maintain disjoint sets

inferredcites →https://doi.org/10.1016/0196-6774(80)90015-2openalex-snapshot

Decomposable searching problems I. Static-to-dynamic transformation

inferredcites →https://doi.org/10.1016/0196-6774(86)90004-0openalex-snapshot

Searching and storing similar lists

inferredcites →https://doi.org/10.1016/s0019-9958(85)80045-0openalex-snapshot

How to search in history

inferredcites →https://doi.org/10.1016/s0019-9958(86)80030-4openalex-snapshot

New upper bounds for neighbor searching

inferredcites →https://doi.org/10.1109/sfcs.1980.18openalex-snapshot

Efficient uses of the past

inferredcites →https://doi.org/10.1109/sfcs.1983.22openalex-snapshot

Geometric retrieval problems

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/0206043openalex-snapshot

Location of a Point in a Planar Subdivision and Its Applications

inferredcites →https://doi.org/10.1137/0215023openalex-snapshot

Optimal Point Location in a Monotone Subdivision

inferredcites →https://doi.org/10.1137/0215051openalex-snapshot

Filtering Search: A New Approach to Query-Answering

inferredcites →https://doi.org/10.1137/0217026openalex-snapshot

A Functional Approach to Data Structures and Its Use in Multidimensional Searching

inferredcites →https://doi.org/10.1145/10515.10547openalex-snapshot

Linear data structures for two types of range search

inferredcites →https://doi.org/10.1145/323233.323252openalex-snapshot

Visibility and intersectin problems in plane geometry

inferredcites →https://doi.org/10.1145/358841.358850openalex-snapshot

Multidimensional divide-and-conquer

inferredcites →https://doi.org/10.1145/800057.808675openalex-snapshot

Scaling and related techniques for geometry problems

inferredcites →https://doi.org/10.1145/800061.808755openalex-snapshot

A 3-space partition and its applications

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.1002/spe.70091openalex-snapshot

Recursive Grid Indexing for Fast Non‐Uniform Quantization Without Binary Search

inferred← citeshttps://doi.org/10.1006/jagm.1995.1017openalex-snapshot

A Pedestrian Approach to Ray Shooting: Shoot a Ray, Take a Walk

inferred← citeshttps://doi.org/10.1006/jcom.2001.0633openalex-snapshot

The New k-Windows Algorithm for Improving thek -Means Clustering Algorithm

inferred← citeshttps://doi.org/10.1007/11590156_3openalex-snapshot

Developments in Data Structure Research During the First 25 Years of FSTTCS

inferred← citeshttps://doi.org/10.1007/3-540-32394-5_5openalex-snapshot

Novel Approaches to Unsupervised Clustering Through k-Windows Algorithm

inferred← citeshttps://doi.org/10.1007/3-540-36563-x_20openalex-snapshot

Authenticated Data Structures for Graph and Geometric Searching

inferred← citeshttps://doi.org/10.1007/3-540-36563-x_21openalex-snapshot

Fractal Merkle Tree Representation and Traversal

inferred← citeshttps://doi.org/10.1007/3-540-44968-x_30openalex-snapshot

Efficient Algorithms for Two-Center Problems for a Convex Polygon

inferred← citeshttps://doi.org/10.1007/3-540-54233-7_172openalex-snapshot

Ray shooting in polygons using geodesic triangulations

inferred← citeshttps://doi.org/10.1007/3-540-55706-7_18openalex-snapshot

Fractional cascading simplified

inferred← citeshttps://doi.org/10.1007/3-540-57155-8_277openalex-snapshot

Counting and reporting red/blue segment intersections

inferred← citeshttps://doi.org/10.1007/3-540-68535-9_4openalex-snapshot

De-amortization of Algorithms

inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_47openalex-snapshot

Efficient Algorithms for Geometric Shortest Path Query Problems

inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_10openalex-snapshot

Efficient Algorithms for Geometric Shortest Path Query Problems

inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_3openalex-snapshot

Concentration of Measure for Randomized Algorithms: Techniques and Analysis

inferred← citeshttps://doi.org/10.1007/978-3-031-83438-7_18openalex-snapshot

A Sub-quadratic Algorithm for the Minsum One Sink Location Problem on Balanced Binary Tree Networks

inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_26openalex-snapshot

Range Queries on Uncertain Data

inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_6openalex-snapshot

Polygonal Path Approximation: A Query Based Approach

inferred← citeshttps://doi.org/10.1007/978-3-540-24669-5_29openalex-snapshot

Parallelizing the Unsupervised k-Windows Clustering Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-540-45145-7_32openalex-snapshot

Parallel Unsupervised k-Windows: An Efficient Parallel Clustering Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_11openalex-snapshot

Discrepancy-Sensitive Dynamic Fractional Cascading, Dominated Maxima Searching, and 2-d Nearest Neighbors in Any Minkowski Metric

inferred← citeshttps://doi.org/10.1007/978-3-642-17514-5_3openalex-snapshot

Dynamic Range Reporting in External Memory

inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_31openalex-snapshot

Fully Retroactive Approximate Range and Nearest Neighbor Searching

inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_29openalex-snapshot

Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles

inferred← citeshttps://doi.org/10.1007/978-3-642-83539-1_4openalex-snapshot

Ruler, Compass and Computer

inferred← citeshttps://doi.org/10.1007/bf00263295openalex-snapshot

Some techniques for geometric searching with implicit set representations

inferred← citeshttps://doi.org/10.1007/bf01377183openalex-snapshot

Ray shooting in polygons using geodesic triangulations

inferred← citeshttps://doi.org/10.1007/bf01840440openalex-snapshot

Fractional cascading: I. A data structuring technique

inferred← citeshttps://doi.org/10.1007/bf01941686openalex-snapshot

Optimal Cooperative Search in Fractional Cascaded Data Structures

inferred← citeshttps://doi.org/10.1007/bf02187742openalex-snapshot

Implicitly representing arrangements of lines or segments

inferred← citeshttps://doi.org/10.1007/bf02187747openalex-snapshot

Visibility and intersection problems in plane geometry

inferred← citeshttps://doi.org/10.1007/bf02187809openalex-snapshot

Partitioning arrangements of lines II: Applications

inferred← citeshttps://doi.org/10.1007/bf02574706openalex-snapshot

Onk-sets in arrangements of curves and surfaces

inferred← citeshttps://doi.org/10.1007/s00365-003-0549-yopenalex-snapshot

On Bivariate Smoothness Spaces Associated with Nonlinear Approximation

inferred← citeshttps://doi.org/10.1007/s00453-009-9355-7openalex-snapshot

Efficient Authenticated Data Structures for Graph Connectivity and Geometric Search Problems

inferred← citeshttps://doi.org/10.1007/s00453-019-00588-3openalex-snapshot

Two Approaches to Building Time-Windowed Geometric Data Structures

inferred← citeshttps://doi.org/10.1007/s00454-004-1098-2openalex-snapshot

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons

inferred← citeshttps://doi.org/10.1007/s00454-024-00637-xopenalex-snapshot

Computing Instance-Optimal Kernels in Two Dimensions

inferred← citeshttps://doi.org/10.1007/s00454-024-00648-8openalex-snapshot

On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings

inferred← citeshttps://doi.org/10.1007/s00454-024-00715-0openalex-snapshot

Dynamic Convex Hulls for Simple Paths

inferred← citeshttps://doi.org/10.1007/s10878-023-00996-wopenalex-snapshot

The two-center problem of uncertain points on a real line

inferred← citeshttps://doi.org/10.1016/0196-6774(92)90021-4openalex-snapshot

Good splitters for counting points in triangles

inferred← citeshttps://doi.org/10.1016/0925-7721(92)90005-dopenalex-snapshot

Parallel fractional cascading on hypercube multiprocessors

inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50012-6openalex-snapshot

Computational Geometry

inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50011-5openalex-snapshot

Geometric Data Structures

inferred← citeshttps://doi.org/10.1016/b978-155860914-3/50013-4openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.02.001openalex-snapshot

Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment

inferred← citeshttps://doi.org/10.1016/j.comgeo.2004.07.001openalex-snapshot

Polygonal chain approximation: a query based approach

inferred← citeshttps://doi.org/10.1016/j.comgeo.2010.04.003openalex-snapshot

A general approach for cache-oblivious range reporting and approximate range counting

inferred← citeshttps://doi.org/10.1016/j.compbiomed.2005.09.003openalex-snapshot

Unsupervised clustering in mRNA expression profiles

inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.022openalex-snapshot

Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks

inferred← citeshttps://doi.org/10.1016/j.patrec.2005.03.023openalex-snapshot

Unsupervised clustering on dynamic databases

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.033openalex-snapshot

Efficient algorithms for center problems in cactus networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.08.017openalex-snapshot

One-dimensional k-center on uncertain data

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.005openalex-snapshot

Range queries on uncertain data

inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00075-1openalex-snapshot

Algorithms for three-dimensional dominance searching in linear space

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00322-5openalex-snapshot

An efficient k nearest neighbors searching algorithm for a query line

inferred← citeshttps://doi.org/10.1016/s0305-0548(01)00063-6openalex-snapshot

Improved algorithms for placing undesirable facilities

inferred← citeshttps://doi.org/10.1016/s0734-189x(87)80134-2openalex-snapshot

Picture Processing: 1986

inferred← citeshttps://doi.org/10.1016/s0925-7721(00)00013-4openalex-snapshot

Extending range queries and nearest neighbors

inferred← citeshttps://doi.org/10.1016/s0925-7721(97)00008-4openalex-snapshot

New results on binary space partitions in the plane

inferred← citeshttps://doi.org/10.1038/s41598-019-41451-3openalex-snapshot

Efficient Genomic Interval Queries Using Augmented Range Trees

inferred← citeshttps://doi.org/10.1109/5.163409openalex-snapshot

Dynamic algorithms in computational geometry

inferred← citeshttps://doi.org/10.1109/cec.2005.1554992openalex-snapshot

The New Window Density Function for Efficient Evolutionary Unsupervised Clustering

inferred← citeshttps://doi.org/10.1109/discex.2003.1194973openalex-snapshot

Efficient and scalable infrastructure support for dynamic coalitions

inferred← citeshttps://doi.org/10.1109/dsc49826.2021.9346272openalex-snapshot

Perpetual Secret Sharing from Dynamic Data Structures

inferred← citeshttps://doi.org/10.1109/focs.2009.58openalex-snapshot

Orthogonal Range Reporting in Three and Higher Dimensions

inferred← citeshttps://doi.org/10.1109/focs46700.2020.00072openalex-snapshot

2D Generalization of Fractional Cascading on Axis-aligned Planar Subdivisions

inferred← citeshttps://doi.org/10.1109/itcc.2005.74openalex-snapshot

An efficient clustering algorithm using graphical techniques

inferred← citeshttps://doi.org/10.1109/itime.2012.6291344openalex-snapshot

Point location in Voronoi diagrams of polygons

inferred← citeshttps://doi.org/10.1109/sfcs.1992.267792openalex-snapshot

Optimal parallel hull construction for simple polygons in O(log log n) time

inferred← citeshttps://doi.org/10.1109/sfcs.1993.366816openalex-snapshot

External-memory computational geometry

inferred← citeshttps://doi.org/10.1109/tai.2002.1180810openalex-snapshot

Improving the orthogonal range search k-windows algorithm

inferred← citeshttps://doi.org/10.1134/s1054661806020015openalex-snapshot

Estimating the number of clusters using a windowing technique

inferred← citeshttps://doi.org/10.1137/0221035openalex-snapshot

Ray Shooting and Other Applications of Spanning Trees with Low Stabbing Number

inferred← citeshttps://doi.org/10.1137/060672261openalex-snapshot

Vertical Ray Shooting and Computing Depth Orders for Fat Objects

inferred← citeshttps://doi.org/10.1137/1.9781611973402.73openalex-snapshot

Concurrent Range Reporting in Two-Dimensional Space

inferred← citeshttps://doi.org/10.1137/1.9781611977073.10openalex-snapshot

Hopcroft's Problem, Log-Star Shaving, 2D Fractional Cascading, and Decision Trees

inferred← citeshttps://doi.org/10.1137/130908245openalex-snapshot

Optimal Dynamic Sequence Representations

inferred← citeshttps://doi.org/10.1137/21m145118xopenalex-snapshot

Algorithms for Subpath Convex Hull Queries and Ray-Shooting among Segments

inferred← citeshttps://doi.org/10.1137/s0097539703435728openalex-snapshot

Novel Transformation Techniques Using Q-Heaps with Applications to Computational Geometry

inferred← citeshttps://doi.org/10.1137/s0097539793254376openalex-snapshot

Dynamic Trees and Dynamic Point Location

inferred← citeshttps://doi.org/10.1137/s0097539796305365openalex-snapshot

Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design

inferred← citeshttps://doi.org/10.1142/s0218195901000390openalex-snapshot

A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING

inferred← citeshttps://doi.org/10.1142/s0218195915500053openalex-snapshot

Aggregate-MAX Top-k Nearest Neighbor Searching in the L1 Plane

inferred← citeshttps://doi.org/10.1142/s0218195919500018openalex-snapshot

Partial Enclosure Range Searching

inferred← citeshttps://doi.org/10.1145/103418.103472openalex-snapshot

Dynamic trees and dynamic point location

inferred← citeshttps://doi.org/10.1145/109648.109653openalex-snapshot

Intersection queries for curved objects (extended abstract)

inferred← citeshttps://doi.org/10.1145/1810959.1811001openalex-snapshot

Orthogonal range reporting

inferred← citeshttps://doi.org/10.1145/1998196.1998198openalex-snapshot

Orthogonal range searching on the RAM, revisited

inferred← citeshttps://doi.org/10.1145/2000824.2000826openalex-snapshot

Differential dependencies

inferred← citeshttps://doi.org/10.1145/2261250.2261299openalex-snapshot

Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model

inferred← citeshttps://doi.org/10.1145/237218.237397openalex-snapshot

Fixed-dimensional linear programming queries made easy

inferred← citeshttps://doi.org/10.1145/262839.262922openalex-snapshot

Robust proximity queries

inferred← citeshttps://doi.org/10.1145/276884.276920openalex-snapshot

Efficiently approximating polygonal paths in three and higher dimensions

inferred← citeshttps://doi.org/10.1145/2806416.2806452openalex-snapshot

Finding Probabilistic k-Skyline Sets on Uncertain Data

inferred← citeshttps://doi.org/10.1145/285237.285283openalex-snapshot

High-speed policy-based packet forwarding using efficient multi-dimensional range matching

inferred← citeshttps://doi.org/10.1145/285243.285283openalex-snapshot

High-speed policy-based packet forwarding using efficient multi-dimensional range matching

inferred← citeshttps://doi.org/10.1145/304893.304976openalex-snapshot

Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons

inferred← citeshttps://doi.org/10.1145/323233.323252openalex-snapshot

Visibility and intersectin problems in plane geometry

inferred← citeshttps://doi.org/10.1145/3478289openalex-snapshot

The Concurrent Learned Indexes for Multicore Data Storage

inferred← citeshttps://doi.org/10.1145/3514221.3517830openalex-snapshot

Conjunctive Queries with Comparisons

inferred← citeshttps://doi.org/10.1145/3514221.3526184openalex-snapshot

Efficient Evaluation of Arbitrarily-Framed Holistic SQL Aggregates and Window Functions

inferred← citeshttps://doi.org/10.1145/3591357openalex-snapshot

Hopcroft’s Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees

inferred← citeshttps://doi.org/10.1145/3604437.3604450openalex-snapshot

Conjunctive Queries with Comparisons

inferred← citeshttps://doi.org/10.1145/3733155.3733221openalex-snapshot

Implementation and Experimental Evaluation of an Assistive Articulated Probe Algorithm

inferred← citeshttps://doi.org/10.1145/50020.50021openalex-snapshot

Hierarchical representations of collections of small rectangles

inferred← citeshttps://doi.org/10.1145/77600.77614openalex-snapshot

Lower bounds for orthogonal range searching: I. The reporting case

inferred← citeshttps://doi.org/10.1145/97444.97698openalex-snapshot

Optimal cooperative search in fractional cascaded data structures

inferred← citeshttps://doi.org/10.1145/984622.984668openalex-snapshot

Fractionally cascaded information in a sensor network

inferred← citeshttps://doi.org/10.1201/9780429171529-6openalex-snapshot

Computational Geometry

inferred← citeshttps://doi.org/10.15347/wjs/2019.005openalex-snapshot

Binary search algorithm

inferred← citeshttps://doi.org/10.22215/etd/2008-08635openalex-snapshot

Two results on distribution-sensitive data structures

inferred← citeshttps://doi.org/10.22215/etd/2015-10640openalex-snapshot

Partial Enclosure Range Searching

inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.25openalex-snapshot

Worst-Case Efficient Dynamic Geometric Independent Set

inferred← citeshttps://doi.org/10.4230/lipics.wads.2025.17openalex-snapshot

Dynamic Geometric Independent Set

inferred← citeshttps://doi.org/10.48550/arxiv.1512.04856openalex-snapshot

Approximating the Simplicial Depth

inferred← citeshttps://doi.org/10.5194/ica-adv-4-1-2023openalex-snapshot

An Efficient Data Structure Providing Maps of the Frequency of Public Transit Service Within User-Specified Time Windows

inferred← citeshttps://doi.org/10.5555/1109557.1109612openalex-snapshot

Vertical ray shooting and computing depth orders for fat objects

inferred← citeshttps://doi.org/10.5555/2634074.2634147openalex-snapshot

Concurrent range reporting in two-dimensional space

inferred← citeshttps://doi.org/10.5555/644108.644201openalex-snapshot

Lower bounds for external memory dictionaries

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.