The following pages link to David Zuckerman (Q294713):
Displaying 50 items.
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- Covering times of random walks on bounded degree trees and other graphs (Q582702) (← links)
- Optimal speedup of Las Vegas algorithms (Q689615) (← links)
- Compression of samplable sources (Q813316) (← links)
- Expanders that beat the eigenvalue bound: Explicit construction and applications (Q1125612) (← links)
- On the time to traverse all edges of a graph (Q1178251) (← links)
- (Q1382407) (redirect page) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Perfect information leader election in \(\log^*n+O(1)\) rounds (Q1604211) (← links)
- Derandomized graph products (Q1842777) (← links)
- Randomness is linear in space (Q1915503) (← links)
- Explicit two-source extractors and resilient functions (Q2320598) (← links)
- Mining circuit lower bound proofs for meta-algorithms (Q2351392) (← links)
- Lossless condensers, unbalanced expanders, and extractors (Q2460624) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- Lower bounds for leader election and collective coin-flipping in the perfect information model (Q2819564) (← links)
- Pseudorandom Generators for Combinatorial Shapes (Q2848209) (← links)
- Pseudorandom Generators for Polynomial Threshold Functions (Q2848221) (← links)
- Linear degree extractors and the inapproximability of max clique and chromatic number (Q2931428) (← links)
- Deterministic Extractors for Additive Sources (Q2989041) (← links)
- (Q3002782) (← links)
- Testing low-degree polynomials over prime fields (Q3055771) (← links)
- Another Proof That $\mathcal{BPP}\subseteq \mathcal{PH}$ (and More) (Q3088174) (← links)
- Multiple cover time (Q3123120) (← links)
- Lower Bounds for Leader Election and Collective Coin-Flipping in the Perfect Information Model (Q3149888) (← links)
- Extractors for Three Uneven-Length Sources (Q3541820) (← links)
- Extractor Codes (Q3547686) (← links)
- Interaction in Quantum Communication (Q3548810) (← links)
- (Q3549710) (← links)
- Small-Bias Spaces for Group Products (Q3638911) (← links)
- A Technique for Lower Bounding the Cover Time (Q3989014) (← links)
- Lower Bounds for Randomized Mutual Exclusion (Q4210122) (← links)
- (Q4228481) (← links)
- Computing with Very Weak Random Sources (Q4268718) (← links)
- (Q4372786) (← links)
- Asymptotically good codes correcting insertions, deletions, and transpositions (Q4503483) (← links)
- Combinatorial bounds for list decoding (Q4674491) (← links)
- Optimal Testing of Reed-Muller Codes (Q4933377) (← links)
- (Q4941822) (← links)
- Extractors for weak random sources and their applications (Q5054851) (← links)
- (Q5091215) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
- XOR lemmas for resilient functions against polynomials (Q5144911) (← links)
- Interaction in quantum communication and the complexity of set disjointness (Q5175960) (← links)
- Loss-less condensers, unbalanced expanders, and extractors (Q5175962) (← links)
- Pseudorandomness from Shrinkage (Q5244384) (← links)
- Certifiably Pseudorandom Financial Derivatives (Q5244399) (← links)
- Lower bounds for randomized mutual exclusion (Q5248482) (← links)
- More deterministic simulation in logspace (Q5248491) (← links)
- Expanders that beat the eigenvalue bound (Q5248492) (← links)
