Introducing Quasirandomness to Computer Science
From MaRDI portal
Recommendations
Cites work
- A Remark on Stirling's Formula
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Geometric discrepancy. An illustrated guide
- Graph Theory and Probability
- scientific article; zbMATH DE number 5764860 (Why is no real title available?)
- scientific article; zbMATH DE number 5764878 (Why is no real title available?)
- On Mixing and Edge Expansion Properties in Randomized Broadcasting
- On the Runtime and Robustness of Randomized Broadcasting
- Quasirandom rumor spreading, an experimental analysis
- Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
- Randomized broadcast in networks
- The inverse of the star-discrepancy depends linearly on the dimension
- The shortest-path problem for graphs with random arc-lengths
- Tight bounds for quasirandom rumor spreading
- Undirected ST-connectivity in log-space
Cited in
(3)
This page was built for publication: Introducing Quasirandomness to Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644716)