A sample of samplers: a computational perspective on sampling
From MaRDI portal
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- Eigenvalues and expansion of regular graphs
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- Expander graphs and their applications
- Explicit constructions of linear-sized superconcentrators
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 3980487 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 1263180 (Why is no real title available?)
- scientific article; zbMATH DE number 1097580 (Why is no real title available?)
- scientific article; zbMATH DE number 1559518 (Why is no real title available?)
- Lower bounds for sampling algorithms for estimating the average
- On the power of two-point based sampling
- Randomness in interactive proofs
- Sampling algorithms: lower bounds and applications
- Shift Register Sequences – A Retrospective Account
- Tiny families of functions with random properties: A quality-size trade-off for hashing
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
- Universal classes of hash functions
Cited in
(33)- Reusable fuzzy extractors for low-entropy distributions
- Compact proofs of retrievability
- Lower bounds against sparse symmetric functions of ACC circuits: expanding the reach of \#SAT algorithms
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
- Estimating the range of a function in an online setting
- How to Generate and Use Universal Samplers
- Expander graphs and their applications
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- Derandomized parallel repetition theorems for free games
- scientific article; zbMATH DE number 703005 (Why is no real title available?)
- Well-mixing vertices and almost expanders
- The Untold Story of $$\mathsf {SBP}$$
- An Efficient Reduction from Two-Source to Nonmalleable Extractors: Achieving Near-Logarithmic Min-Entropy
- Imperfect gaps in Gap-ETH and PCPs
- scientific article; zbMATH DE number 7561748 (Why is no real title available?)
- scientific article; zbMATH DE number 7561753 (Why is no real title available?)
- Simple optimal hitting sets for small-success RL
- Amplification and Derandomization without Slowdown
- Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
- Sampling algorithms: lower bounds and applications
- Fast interactive coding against adversarial noise
- scientific article; zbMATH DE number 7650076 (Why is no real title available?)
- scientific article; zbMATH DE number 7650126 (Why is no real title available?)
- Must the communication graph of MPC protocols be an expander?
- How to recover a secret with O(n) additions
- Rigid matrices from rectangular PCPs
- Hardness self-amplification: simplified, optimized, and unified
- Nearly optimal pseudorandomness from hardness
- Lower bounds for sampling algorithms for estimating the average
- Sparse high dimensional expanders via local lifts
- Hamming weight proofs of proximity with one-sided error
- Pseudodistributions that beat all pseudorandom generators
This page was built for publication: A sample of samplers: a computational perspective on sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088190)
