Random permutations using switching networks
From MaRDI portal
Recommendations
Cites work
- Approximate distance oracles
- Approximate distance oracles with constant query time
- Automata, Languages and Programming
- Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
- Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
- Fast C-K-R partitions of sparse graphs
- Near-Linear Time Construction of Sparse Neighborhood Covers
- On approximate distance labels and routing schemes with affine stretch
- On sparse spanners of weighted graphs
- Ramsey partitions and proximity data structures
- Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
- Shortest-path queries in static networks
Cited in
(10)- Fast generation of random permutations via networks simulation
- Sometimes-recurse shuffle. Almost-random permutations in logarithmic expected time
- Reverse cycle walking and its applications
- Reducing the number of qubits in quantum information set decoding
- Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
- Generation of the symmetric group \(S_{n^2}\)
- On the Use of Interconnection Networks in Cryptography
- Partial Shuffles by Lazy Swaps
- Sampling lower bounds: Boolean average-case and permutations
- scientific article; zbMATH DE number 426338 (Why is no real title available?)
This page was built for publication: Random permutations using switching networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941565)