Pages that link to "Item:Q2817628"
From MaRDI portal
The following pages link to Pseudorandomness for network algorithms (Q2817628):
Displayed 14 items.
- 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)
- Universal traversal sequences with backtracking. (Q1872734) (← links)
- How strong is Nisan's pseudo-random generator? (Q1944139) (← links)
- Graph exploration by a finite automaton (Q2575752) (← 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)
- (Q4941822) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)