Random Permutations using Switching Networks
From MaRDI portal
Publication:2941565
DOI10.1145/2746539.2746629zbMath1321.65007OpenAlexW2162439784MaRDI QIDQ2941565
Publication date: 21 August 2015
Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2746539.2746629
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Generation of the symmetric group Sn2 ⋮ Partial Shuffles by Lazy Swaps ⋮ Reverse Cycle Walking and Its Applications ⋮ Sampling Lower Bounds: Boolean Average-Case and Permutations
Uses Software
Cites Work
- Unnamed Item
- Ramsey partitions and proximity data structures
- On sparse spanners of weighted graphs
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- On Approximate Distance Labels and Routing Schemes with Affine Stretch
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Approximate distance oracles
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Near-Linear Time Construction of Sparse Neighborhood Covers
- Shortest-path queries in static networks
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
This page was built for publication: Random Permutations using Switching Networks
