Randomized geometric algorithms and pseudorandom generators
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 410386 (Why is no real title available?)
- scientific article; zbMATH DE number 431985 (Why is no real title available?)
- scientific article; zbMATH DE number 437553 (Why is no real title available?)
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A deterministic view of random sampling and its use in geometry
- A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
- An optimal algorithm for intersecting line segments in the plane
- Applications of random sampling in computational geometry. II
- Applications of random sampling to on-line algorithms in computational geometry
- Linear Programming in Linear Time When the Dimension Is Fixed
- On levels in arrangements and Voronoi diagrams
- On the construction of abstract Voronoi diagrams
- Randomized algorithms and pseudorandom numbers
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Small-dimensional linear programming and convex hulls made easy
- -nets and simplex range queries
Cited in
(18)- Concentration for limited independence via inequalities for the elementary symmetric polynomials
- scientific article; zbMATH DE number 1563190 (Why is no real title available?)
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- Almost Optimal Pseudorandom Generators for Spherical Caps
- Universal profinite domains
- Preserving randomness for adaptive algorithms
- On (ε,k)‐min‐wise independent permutations
- Generation of Random Triangular Digital Curves Using Combinatorial Techniques
- A derandomization using min-wise independent permutations
- Pseudorandom generators for combinatorial shapes
- scientific article; zbMATH DE number 431985 (Why is no real title available?)
- Applications of random sampling in computational geometry. II
- Min-wise independent permutations
- Positive spectrahedra: invariance principles and pseudorandom generators
- Fingerprints for highly similar streams
- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- Logarithmic reduction of the level of randomness in some probabilistic geometric constructions
- Markov incremental constructions
This page was built for publication: Randomized geometric algorithms and pseudorandom generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1923860)
