Pseudorandomness for network algorithms
From MaRDI portal
Publication:2817628
Recommendations
- Randomized broadcast in networks
- Ergodic Randomized Algorithms and Dynamics Over Networks
- Pseudorandom Graphs in Data Structures
- Network-oblivious algorithms
- Deterministic Sampling Algorithms for Network Design
- Deterministic sampling algorithms for network design
- Randomness in distribution protocols
- Randomness in distribution protocols
- Network Decomposition and Distributed Derandomization (Invited Paper)
Cited in
(50)- Paradigms for Unconditional Pseudorandom Generators
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- scientific article; zbMATH DE number 7561738 (Why is no real title available?)
- Random oracles and non-uniformity
- scientific article; zbMATH DE number 7561753 (Why is no real title available?)
- Simple optimal hitting sets for small-success RL
- More on bounded independence plus noise: pseudorandom generators for read-once polynomials
- On probabilistic space-bounded machines with multiple access to random tape
- Fooling Polytopes
- A new pseudorandom generator from collision-resistant hash functions
- Trading locality for time: certifiable randomness from low-depth circuits
- Approximating iterated multiplication of stochastic matrices in small space
- Near-optimal derandomization of medium-width branching programs
- Impact of memory size on graph exploration capability
- Memory Efficient Anonymous Graph Exploration
- Explicit list-decodable codes with optimal rate for computationally bounded channels
- Pseudorandom generators for combinatorial checkerboards
- Local and global expansion in random geometric graphs
- Graph exploration by a finite automaton
- Approximating hyper-rectangles: Learning and pseudorandom sets
- Improved Explicit Hitting-Sets for ROABPs
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- Bounded independence plus noise fools products
- Expander graphs and their applications
- scientific article; zbMATH DE number 7651209 (Why is no real title available?)
- Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
- Randomness-efficient non-interactive zero knowledge
- Universal traversal sequences with backtracking.
- A dichotomy for local small-bias generators
- scientific article; zbMATH DE number 7561734 (Why is no real title available?)
- How strong is Nisan's pseudo-random generator?
- Weak derandomization of weak algorithms: explicit versions of Yao's lemma
- Pseudorandom functions: three decades later
- Highly symmetric expanders
- Deterministic approximation of random walks in small space
- scientific article; zbMATH DE number 7650109 (Why is no real title available?)
- Randomness buys depth for approximate counting
- Cryptographic hardness of random local functions. Survey
- Pseudorandomness via the discrete Fourier transform
- Randomness extraction in \(\mathsf{AC}^0\) and with small locality
- Low discrepancy sets yield approximate min-wise independent permutation families
- Pseudorandom pseudo-distributions with near-optimal error for read-once branching programs
- scientific article; zbMATH DE number 1418263 (Why is no real title available?)
- Preserving randomness for adaptive algorithms
- Complexity theory. Abstracts from the workshop held November 14--20, 2021 (hybrid meeting)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs
- Space pseudorandom generators by communication complexity lower bounds
- Partition expanders
- Fourier bounds and pseudorandom generators for product tests
This page was built for publication: Pseudorandomness for network algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2817628)
