Strictly in-place algorithms for permuting and inverting permutations
From MaRDI portal
Publication:832874
DOI10.1007/978-3-030-83508-8_24OpenAlexW3197477356MaRDI QIDQ832874
Karol Pokorski, Bartłomiej Dudek, Paweł Gawrychowski
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2101.03978
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selection from read-only memory and sorting with minimum data movement
- Lempel-Ziv factorization powered by space efficient suffix trees
- Symmetry breaking in distributed networks
- Upper bounds for time-space trade-offs in sorting and selection
- Selection and sorting with limited storage
- A time-space tradeoff for sorting on non-oblivious machines
- Computing the cycles in the perfect shuffle permutation
- Finding median in read-only memory on integer input
- Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
- A general Sequential Time-Space Tradeoff for Finding Unique Elements
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Decentralized extrema-finding in circular configurations of processors
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- Sparse Suffix Tree Construction in Optimal Time and Space
- Raising Permutations to Powers in Place
- Permuting in Place
- Locally Consistent Parsing for Text Indexing in Small Space
- Smaller universal targets for homomorphisms of edge-colored graphs
This page was built for publication: Strictly in-place algorithms for permuting and inverting permutations
