Pages that link to "Item:Q2817628"
From MaRDI portal
The following pages link to Pseudorandomness for network algorithms (Q2817628):
Displaying 44 items.
- Low discrepancy sets yield approximate min-wise independent permutation families (Q294714) (← links)
- A dichotomy for local small-bias generators (Q315550) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) (← links)
- Randomness buys depth for approximate counting (Q483707) (← links)
- Highly symmetric expanders (Q700158) (← links)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Approximating hyper-rectangles: Learning and pseudorandom sets (Q1278043) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Universal traversal sequences with backtracking. (Q1872734) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Explicit list-decodable codes with optimal rate for computationally bounded channels (Q2029777) (← links)
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
- Partition expanders (Q2363958) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Trading locality for time: certifiable randomness from low-depth circuits (Q2662080) (← links)
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting) (Q2693051) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- A New Pseudorandom Generator from Collision-Resistant Hash Functions (Q2890004) (← links)
- On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- Randomness-efficient non-interactive zero knowledge (Q4572000) (← links)
- Bounded Independence Plus Noise Fools Products (Q4641587) (← links)
- (Q4941822) (← links)
- (Q5009532) (← links)
- Preserving Randomness for Adaptive Algorithms (Q5009539) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Fooling Polytopes (Q5066946) (← links)
- Fourier bounds and pseudorandom generators for product tests (Q5091757) (← links)
- (Q5092453) (← links)
- (Q5092457) (← links)
- Algorithms and lower bounds for de morgan formulas of low-communication leaf gates (Q5092464) (← links)
- (Q5092476) (← links)
- Simple Optimal Hitting Sets for Small-Success RL (Q5115702) (← links)
- Pseudorandom Pseudo-distributions with Near-Optimal Error for Read-Once Branching Programs (Q5130845) (← links)
- (Q5140841) (← links)
- (Q5158498) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace (Q5856147) (← links)
- (Q5874542) (← links)
- (Q5875498) (← links)
- Improved Explicit Hitting-Sets for ROABPs (Q6084347) (← links)
