scientific article; zbMATH DE number 7650109
From MaRDI portal
Publication:5875498
DOI10.4230/LIPICS.APPROX-RANDOM.2019.42MaRDI QIDQ5875498FDOQ5875498
Authors: Jack Murtagh, Omer Reingold, Aaron Sidford, Salil Vadhan 
Publication date: 3 February 2023
Title of this publication is not available (Why is that?)
Recommendations
- Deterministic approximation of random walks in small space
- Deterministic random walks on finite graphs
- Deterministic random walks on finite graphs
- Random walks strictly confined to a subspace
- Deterministic random walks
- scientific article; zbMATH DE number 2247483
- Deterministic walks in random environments
- Deterministically driven random walks on a finite state space
- scientific article
Cites Work
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Undirected connectivity in log-space
- Simple Constructions of Almost k-wise Independent Random Variables
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- Pseudorandomness for network algorithms
- Explicit constructions of linear-sized superconcentrators
- Title not available (Why is that?)
- \(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- An efficient parallel solver for SDD linear systems
- Almost-linear-time algorithms for Markov chains and new spectral primitives for directed graphs
- Pseudorandom generators for regular branching programs
- A framework for analyzing resparsification algorithms
- Density independent algorithms for sparsifying \(k\)-step random walks
Cited In (4)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875498)
