On the public citation graph
Approximate Halfspace Range Counting
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jcss.1997.1534openalex-snapshot
Size-Estimation Framework with Applications to Transitive Closure and Reachability
inferredcites →https://doi.org/10.1006/jcss.2000.1741openalex-snapshot
Improved Bounds on the Sample Complexity of Learning
inferredcites →https://doi.org/10.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1007/978-3-540-73951-7_2openalex-snapshot
Approximate Range Searching: The Absolute Model
inferredcites →https://doi.org/10.1007/bf01303517openalex-snapshot
Discrepancy and approximations for bounded VC-dimension
inferredcites →https://doi.org/10.1007/s00454-009-9140-zopenalex-snapshot
The Effect of Corners on the Complexity of Approximate Range Searching
inferredcites →https://doi.org/10.1007/s00454-009-9177-zopenalex-snapshot
On Approximate Range Counting and Depth
inferredcites →https://doi.org/10.1007/s00454-010-9308-6openalex-snapshot
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
inferredcites →https://doi.org/10.1016/0890-5401(92)90010-dopenalex-snapshot
Decision theoretic generalizations of the PAC model for neural net and other learning applications
inferredcites →https://doi.org/10.1016/0925-7721(92)90006-eopenalex-snapshot
Reporting points in halfspaces
inferredcites →https://doi.org/10.1016/j.comgeo.2007.05.008openalex-snapshot
Approximate range searching in higher dimension
inferredcites →https://doi.org/10.1016/j.comgeo.2008.09.009openalex-snapshot
Approximate range searching: The absolute model
inferredcites →https://doi.org/10.1090/conm/223/03131openalex-snapshot
Geometric range searching and its relatives
inferredcites →https://doi.org/10.1137/060669474openalex-snapshot
On Approximating the Depth and Related Problems
inferredcites →https://doi.org/10.1137/090765092openalex-snapshot
Semialgebraic Range Reporting and Emptiness Searching with Applications
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1137/s0097539796260321openalex-snapshot
Product Range Spaces, Sensitive Sampling, and Derandomization
inferredcites →https://doi.org/10.1145/1007568.1007647openalex-snapshot
Spatially-decaying aggregation over a network
inferredcites →https://doi.org/10.1145/1247069.1247128openalex-snapshot
On approximate halfspace range counting and relative epsilon-approximations
inferredcites →https://doi.org/10.1145/1247069.1247129openalex-snapshot
On approximate range counting and depth
inferredcites →https://doi.org/10.1201/9781420035315.ch44openalex-snapshot
The discrepancy method in computational geometry
inferredcites →https://doi.org/10.1214/aop/1176988847openalex-snapshot
Sharper Bounds for Gaussian and Empirical Processes
inferredcites →https://doi.org/10.5555/1109557.1109611openalex-snapshot
Randomized incremental constructions of three-dimensional convex hulls and planar voronoi diagrams, and approximate range counting
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_1openalex-snapshot
Simplex Range Searching and Its Variants: A Review
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_20openalex-snapshot
Data Structures for Approximate Orthogonal Range Counting
inferred← citeshttps://doi.org/10.1007/s00454-010-9248-1openalex-snapshot
Relative (p,ε)-Approximations in Geometry
inferred← citeshttps://doi.org/10.1007/s00454-010-9308-6openalex-snapshot
Range Minima Queries with Respect to a Random Permutation, and Approximate Range Counting
inferred← citeshttps://doi.org/10.1007/s00454-010-9324-6openalex-snapshot
The Overlay of Minimization Diagrams in a Randomized Incremental Construction
inferred← citeshttps://doi.org/10.1137/090765092openalex-snapshot
Semialgebraic Range Reporting and Emptiness Searching with Applications
inferred← citeshttps://doi.org/10.1137/1.9781611973105.19openalex-snapshot
The Space Complexity of 2-Dimensional Approximate Range Counting
inferred← citeshttps://doi.org/10.1137/1.9781611973402.101openalex-snapshot
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
inferred← citeshttps://doi.org/10.1137/140977746openalex-snapshot
A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension
inferred← citeshttps://doi.org/10.1145/3205454openalex-snapshot
Tight Space Bounds for Two-Dimensional Approximate Range Counting
inferred← citeshttps://doi.org/10.20382/jocg.v12i1a3openalex-snapshot
Approximate Range Counting Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.0906.2738openalex-snapshot
Data Structures for Approximate Range Counting
inferred← citeshttps://doi.org/10.48550/arxiv.1805.07373openalex-snapshot
Approximate Data Depth Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1905.10716openalex-snapshot
Algorithmic and geometric aspects of data depth with focus on $β$-skeleton depth
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.