Pages that link to "Item:Q3787911"
From MaRDI portal
The following pages link to Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity (Q3787911):
Displayed 22 items.
- On the power of small-depth threshold circuits (Q685717) (← links)
- Bounds on tradeoffs between randomness and communication complexity (Q687507) (← links)
- Relations between communication complexity classes (Q751811) (← links)
- Some extremal problems arising from discrete control processes (Q913685) (← links)
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources (Q1102253) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Universal tests for nonuniform distributions (Q1310449) (← links)
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity (Q1351496) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- On the power of circuits with gates of low \(L_{1}\) norms. (Q1389652) (← links)
- Approximation of boolean functions by combinatorial rectangles (Q1399979) (← links)
- Independent unbiased coin flips from a correlated biased source - a finite state Markov chain (Q1822415) (← links)
- Simulating BPP using a general weak random source (Q1923854) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- Simpler session-key generation from short random passwords (Q2482336) (← links)
- Extractors from Reed-Muller codes (Q2496317) (← links)
- How to get more mileage from randomness extractors (Q3522834) (← links)
- Increasing the Output Length of Zero-Error Dispersers (Q3541810) (← links)
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes (Q3599076) (← links)
- Communication complexity of matrix computation over finite fields (Q4835864) (← links)
- Extracting all the randomness and reducing the error in Trevisan's extractors (Q5917498) (← links)