📚
📚
The Cartographer
Syntactic View of Sigma-Tau Generation of Permutations
March 26, 2019 · Declared Dead · 🏛 Language and Automata Theory and Applications
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Wojciech Rytter, Wiktor Zuba
arXiv ID
1903.10701
Category
cs.DS: Data Structures & Algorithms
Citations
3
Venue
Language and Automata Theory and Applications
Last Checked
4 months ago
Abstract
We give a syntactic view of the Sawada-Williams $(σ,τ)$-generation of permutations. The corresponding sequence of $σ-τ$-operations, of length $n!-1$ is shown to be highly compressible: it has $O(n^2\log n)$ bit description. Using this compact description we design fast algorithms for ranking and unranking permutations.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Data Structures & Algorithms
R.I.P.
👻
Ghosted
Route Planning in Transportation Networks
R.I.P.
👻
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
👻
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
👻
Ghosted
Graph Isomorphism in Quasipolynomial Time
📚
📚
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
👻
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
👻
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
👻
Ghosted