On the public citation graph
Randomized geometric algorithms and pseudorandom generators
0 signed · 51 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/jagm.1996.0060openalex-snapshot
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
inferredcites →https://doi.org/10.1007/978-3-642-58043-7_3openalex-snapshot
Backwards Analysis of Randomized Geometric Algorithms
inferredcites →https://doi.org/10.1007/bf01758770openalex-snapshot
Randomized incremental construction of Delaunay and Voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02122778openalex-snapshot
A deterministic view of random sampling and its use in geometry
inferredcites →https://doi.org/10.1007/bf02187740openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1007/bf02293035openalex-snapshot
Applications of random sampling to on-line algorithms in computational geometry
inferredcites →https://doi.org/10.1007/bf02574686openalex-snapshot
On the construction of abstract voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574692openalex-snapshot
On levels in arrangements and voronoi diagrams
inferredcites →https://doi.org/10.1007/bf02574699openalex-snapshot
Small-dimensional linear programming and convex hulls made easy
inferredcites →https://doi.org/10.1016/0925-7721(91)90012-4openalex-snapshot
A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1016/j.comgeo.2010.03.003openalex-snapshot
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
inferredcites →https://doi.org/10.1109/fscs.1990.89575openalex-snapshot
Simple construction of almost k-wise independent random variables
inferredcites →https://doi.org/10.1109/sfcs.1988.21974openalex-snapshot
A fast planar partition algorithm. I
inferredcites →https://doi.org/10.1109/sfcs.1991.185345openalex-snapshot
An optimal convex hull algorithm and new results on cuttings
inferredcites →https://doi.org/10.1109/sfcs.1991.185368openalex-snapshot
Randomized multidimensional search trees: lazy balancing and dynamic shuffling
inferredcites →https://doi.org/10.1109/sfcs.1991.185369openalex-snapshot
Dynamic maintenance of geometric structures made easy
inferredcites →https://doi.org/10.1137/0215074openalex-snapshot
A Simple Parallel Algorithm for the Maximal Independent Set Problem
inferredcites →https://doi.org/10.1137/1.9781611970074openalex-snapshot
Ten Lectures on the Probabilistic Method
inferredcites →https://doi.org/10.1145/100216.100244openalex-snapshot
Small-bias probability spaces: efficient constructions and applications
inferredcites →https://doi.org/10.1145/147508.147511openalex-snapshot
An optimal algorithm for intersecting line segments in the plane
inferredcites →https://doi.org/10.1145/2422.322418openalex-snapshot
Linear Programming in Linear Time When the Dimension Is Fixed
inferredcites →https://doi.org/10.1145/62212.62242openalex-snapshot
Randomized algorithms and pseudorandom numbers
inferredcites →https://doi.org/10.1145/73007.73045openalex-snapshot
Polling: a new randomized sampling technique for computational geometry
inferredcites →https://doi.org/10.1145/73393.73394openalex-snapshot
Applications of random sampling in computational geometry, II
inferredcites →https://doi.org/10.1145/74333.74372openalex-snapshot
An efficient algorithm for hidden surface removal
inferredcites →https://doi.org/10.1145/74334.74372openalex-snapshot
An efficient algorithm for hidden surface removal
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1098-2418(200101)18:1<18::aid-rsa2>3.0.co;2-mopenalex-snapshot
Completeness and robustness properties of min-wise independent permutations
inferred← citeshttps://doi.org/10.1002/rsa.20184openalex-snapshot
On (ε,k)‐min‐wise independent permutations
inferred← citeshttps://doi.org/10.1006/jagm.1996.0027openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1006/jagm.2000.1131openalex-snapshot
A Small Approximately Min-Wise Independent Family of Hash Functions
inferred← citeshttps://doi.org/10.1006/jcss.1999.1690openalex-snapshot
Min-Wise Independent Permutations
inferred← citeshttps://doi.org/10.1007/11889205_30openalex-snapshot
Randomization in Constraint Programming for Airline Planning
inferred← citeshttps://doi.org/10.1007/3-540-49543-6_2openalex-snapshot
A Derandomization Using Min-Wise Independent Permutations
inferred← citeshttps://doi.org/10.1007/978-1-4615-0013-1_18openalex-snapshot
Derandomization in Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-45198-3_33openalex-snapshot
A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries
inferred← citeshttps://doi.org/10.1007/978-3-540-48413-4_1openalex-snapshot
Completeness and Robustness Properties of Min-Wise Independent Permutations
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_41openalex-snapshot
Sketching for Big Data Recommender Systems Using Fast Pseudo-random Fingerprints
inferred← citeshttps://doi.org/10.1007/bf01940869openalex-snapshot
Introduction to special issue on randomized and derandomized algorithms
inferred← citeshttps://doi.org/10.1007/s00454-009-9170-6openalex-snapshot
Markov Incremental Constructions
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50014-0openalex-snapshot
Derandomization in Computational Geometry
inferred← citeshttps://doi.org/10.1016/j.ic.2015.06.001openalex-snapshot
Fingerprints for highly similar streams
inferred← citeshttps://doi.org/10.1016/s1570-8667(03)00003-0openalex-snapshot
A derandomization using min-wise independent permutations
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892082openalex-snapshot
Stable distributions, pseudorandom generators, embeddings and data stream computation
inferred← citeshttps://doi.org/10.1145/1147954.1147955openalex-snapshot
Stable distributions, pseudorandom generators, embeddings, and data stream computation
inferred← citeshttps://doi.org/10.1145/1377676.1377701openalex-snapshot
Markov incremental constructions
inferred← citeshttps://doi.org/10.1145/780542.780645openalex-snapshot
On the sample size ofk-restricted min-wise independent permutations and otherk-wise distributions
inferred← citeshttps://doi.org/10.48550/arxiv.1009.5791openalex-snapshot
Fast Pseudo-Random Fingerprints
inferred← citeshttps://doi.org/10.5555/338219.338245openalex-snapshot
On permutations with limited independence
inferred← citeshttps://doi.org/10.5555/338219.338246openalex-snapshot
Min-Wise versus linear independence (extended abstract)
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.