On the public citation graph

Better lower bounds on detecting affine and spherical degeneracies

0 signed · 56 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/978-3-642-58043-7_6openalex-snapshot
Allowable Sequences and Order Types in Discrete and Computational Geometry
inferredcites →https://doi.org/10.1007/978-3-642-61568-9openalex-snapshot
Algorithms in Combinatorial Geometry
inferredcites →https://doi.org/10.1007/bf01934990openalex-snapshot
The power of geometric duality
inferredcites →https://doi.org/10.1016/0022-0000(89)90038-xopenalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1016/0196-6774(82)90002-5openalex-snapshot
Lower bounds for algebraic decision trees
inferredcites →https://doi.org/10.1016/0304-3975(76)90078-5openalex-snapshot
How good is the information theory bound in sorting?
inferredcites →https://doi.org/10.1016/0304-3975(89)90132-1openalex-snapshot
Lower bounds for sorting of sums
inferredcites →https://doi.org/10.1090/s0894-0347-1990-1046181-2openalex-snapshot
The intrinsic spread of a configuration in 𝑅^{𝑑}
inferredcites →https://doi.org/10.1109/sfcs.1993.366834openalex-snapshot
Better lower bounds on detecting affine and spherical degeneracies
inferredcites →https://doi.org/10.1137/0212032openalex-snapshot
Multidimensional Sorting
inferredcites →https://doi.org/10.1137/0215024openalex-snapshot
Constructing Arrangements of Lines and Hyperplanes with Applications
inferredcites →https://doi.org/10.1137/0222031openalex-snapshot
On the Zone Theorem for Hyperplane Arrangements
inferredcites →https://doi.org/10.1145/12130.12171openalex-snapshot
Topologically sweeping an arrangement
inferredcites →https://doi.org/10.1145/800061.808735openalex-snapshot
Lower bounds for algebraic computation trees
inferredcites →https://doi.org/10.2307/1990931openalex-snapshot
The Intrinsic Spread of a Configuration in R d
inferredcites →https://doi.org/10.2307/2325168openalex-snapshot
Algorithms in Combinatorial Geometry.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcom.1995.1005openalex-snapshot
On the Complexity of Approximating Extremal Determinants in Matrices
inferred← citeshttps://doi.org/10.1007/11589440_5openalex-snapshot
Weighted Ham-Sandwich Cuts
inferred← citeshttps://doi.org/10.1007/3-540-44676-1_23openalex-snapshot
Smallest Color-Spanning Objects
inferred← citeshttps://doi.org/10.1007/3-540-61680-2_66openalex-snapshot
On minimum-area hulls
inferred← citeshttps://doi.org/10.1007/3-540-62005-2_27openalex-snapshot
Computational geometry and discrete computations
inferred← citeshttps://doi.org/10.1007/978-3-030-80049-9_16openalex-snapshot
On 3SUM-hard Problems in the Decision Tree Model
inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_27openalex-snapshot
Fast Algorithms for Computing the Smallest k-Enclosing Disc
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_67openalex-snapshot
Finding Popular Places
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_57openalex-snapshot
Detecting Commuting Patterns by Clustering Subtrajectories
inferred← citeshttps://doi.org/10.1007/978-94-011-0924-6_17openalex-snapshot
On the Complexity of Some Basic Problems in Computational Convexity
inferred← citeshttps://doi.org/10.1007/s00453-004-1123-0openalex-snapshot
Fast Algorithms for Computing the Smallest k-Enclosing Circle
inferred← citeshttps://doi.org/10.1007/s00453-012-9721-8openalex-snapshot
On the Least Trimmed Squares Estimator
inferred← citeshttps://doi.org/10.1007/s00454-006-1267-6openalex-snapshot
On the Least Median Square Problem
inferred← citeshttps://doi.org/10.1007/s00454-022-00437-1openalex-snapshot
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets: Collinearity Testing and Related Problems
inferred← citeshttps://doi.org/10.1007/s00454-024-00673-7openalex-snapshot
Improved Algebraic Degeneracy Testing
inferred← citeshttps://doi.org/10.1007/s00454-024-00687-1openalex-snapshot
The Complexity of Order Type Isomorphism
inferred← citeshttps://doi.org/10.1007/s10707-007-0037-9openalex-snapshot
Reporting Leaders and Followers among Trajectories of Moving Point Objects
inferred← citeshttps://doi.org/10.1016/0925-7721(95)00020-8openalex-snapshot
The exact fitting problem in higher dimensions
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.11.006openalex-snapshot
On a class of O(n2) problems in computational geometry
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115583openalex-snapshot
On k -enclosing slab problems
inferred← citeshttps://doi.org/10.1016/s0925-7721(02)00156-6openalex-snapshot
Preprocessing chains for fast dihedral rotations is hard or even impossible
inferred← citeshttps://doi.org/10.1017/9781108539180openalex-snapshot
Forbidden Configurations in Discrete Geometry
inferred← citeshttps://doi.org/10.1137/110853327openalex-snapshot
Pattern Matching under Polynomial Transformation
inferred← citeshttps://doi.org/10.1137/s0097539703427963openalex-snapshot
Shape Fitting with Outliers
inferred← citeshttps://doi.org/10.1137/s0097539797315410openalex-snapshot
New Lower Bounds for Convex Hull Problems in Odd Dimensions
inferred← citeshttps://doi.org/10.1142/s0218195910003189openalex-snapshot
FINDING POPULAR PLACES
inferred← citeshttps://doi.org/10.1142/s0218195911003652openalex-snapshot
DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
inferred← citeshttps://doi.org/10.1145/1007352.1007436openalex-snapshot
Lower bounds for linear degeneracy testing
inferred← citeshttps://doi.org/10.1145/1059513.1059515openalex-snapshot
Lower bounds for linear degeneracy testing
inferred← citeshttps://doi.org/10.1145/1183471.1183479openalex-snapshot
Computing longest duration flocks in trajectory data
inferred← citeshttps://doi.org/10.1145/220279.220293openalex-snapshot
New lower bounds for Hopcroft's problem
inferred← citeshttps://doi.org/10.1145/237218.237225openalex-snapshot
New lower bounds for convex hull problems in odd dimensions
inferred← citeshttps://doi.org/10.1145/2582112.2582131openalex-snapshot
Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems
inferred← citeshttps://doi.org/10.1145/777792.777798openalex-snapshot
Shape fitting with outliers
inferred← citeshttps://doi.org/10.1145/997817.997859openalex-snapshot
On the least median square problem
inferred← citeshttps://doi.org/10.1201/9780429171529-6openalex-snapshot
Computational Geometry
inferred← citeshttps://doi.org/10.4086/cjtcs.1999.008openalex-snapshot
inferred← citeshttps://doi.org/10.4230/lipics.swat.2020.20openalex-snapshot
Sparse Regression via Range Counting
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11904openalex-snapshot
Layered Sampling for Robust Optimization Problems
inferred← citeshttps://doi.org/10.7561/sacs.2019.1.81openalex-snapshot
Enumerating Collinear Points in Higher Dimensions
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.