The following pages link to Randomness is linear in space (Q1915503):
Displayed 32 items.
- Smooth projective hashing and two-message oblivious transfer (Q421036) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Extracting Kolmogorov complexity with applications to dimension zero-one laws (Q716318) (← links)
- Better short-seed quantum-proof extractors (Q764353) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Deterministic extractors for affine sources over large fields (Q2390150) (← links)
- Derandomized constructions of \(k\)-wise (almost) independent permutations (Q2391191) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- An Introduction to Randomness Extractors (Q3012907) (← links)
- On Constructing 1-1 One-Way Functions (Q3088171) (← links)
- Bravely, Moderately: A Common Theme in Four Recent Works (Q3088192) (← links)
- Computational Randomness from Generalized Hardcore Sets (Q3088271) (← links)
- Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689) (← links)
- Increasing the output length of zero-error dispersers (Q3119044) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- An Improved Robust Fuzzy Extractor (Q3540042) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Our Data, Ourselves: Privacy Via Distributed Noise Generation (Q3593113) (← links)
- Key Agreement from Close Secrets over Unsecured Channels (Q3627436) (← links)
- Extracting Computational Entropy and Learning Noisy Linear Functions (Q5323082) (← links)
- A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval (Q5445520) (← links)
- Deterministic extractors for small-space sources (Q5894074) (← links)
- Extractors and Lower Bounds for Locally Samplable Sources (Q5894225) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)
- On the parallel approximability of a subclass of quadratic programming. (Q5941277) (← links)
- Pseudorandom generators without the XOR lemma (Q5943089) (← links)
- The communication complexity of pointer chasing (Q5943092) (← links)