Using Rademacher permutations to reduce randomness
From MaRDI portal
Recommendations
- Efficient sampling of random permutations
- Using permutations to reduce discrepancy
- Using permutations in regenerative simulations to reduce variance
- scientific article; zbMATH DE number 1559535
- Reducing Randomness via Irrational Numbers
- Extracting Randomness via Repeated Condensing
- Randomness Reuse: Extensions and Improvements
- On using deterministic functions to reduce randomness in probabilistic algorithms
- A derandomization using min-wise independent permutations
- Pseudorandom permutation
Cites work
- A Bernstein-Chernoff deviation inequality, and geometric properties of random families of operators
- A better approximation for balls
- A Topological Application of the Isoperimetric Inequality
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Euclidean structure in finite dimensional normed spaces
- Geometric applications of Chernoff-type estimates and a ZigZag approximation for balls
- Global versus local asymptotic theories of finite-dimensional normed spaces
- scientific article; zbMATH DE number 4052452 (Why is no real title available?)
- scientific article; zbMATH DE number 194093 (Why is no real title available?)
- Logarithmic reduction of the level of randomness in some probabilistic geometric constructions
- On Polyhedral Approximations of the Second-Order Cone
- Regularization of star bodies by random hyperplane cut off
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(4)
This page was built for publication: Using Rademacher permutations to reduce randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5440793)