Strictly in-place algorithms for permuting and inverting permutations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 1383709 (Why is no real title available?)
- scientific article; zbMATH DE number 3405492 (Why is no real title available?)
- A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
- A general Sequential Time-Space Tradeoff for Finding Unique Elements
- A time-space tradeoff for sorting on non-oblivious machines
- 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
- Approximating LZ77 via Small-Space Multiple-Pattern Matching
- Cell probe lower bounds for succinct data structures
- Comparison-based time-space lower bounds for selection
- Computing the cycles in the perfect shuffle permutation
- Decentralized extrema-finding in circular configurations of processors
- Finding median in read-only memory on integer input
- Lempel-Ziv factorization powered by space efficient suffix trees
- Locally Consistent Parsing for Text Indexing in Small Space
- Optimal time-space tradeoff for the 2D convex-hull problem
- Permuting in Place
- Raising permutations to powers in place
- Selection and sorting with limited storage
- Selection from read-only memory and sorting with minimum data movement
- Smaller universal targets for homomorphisms of edge-colored graphs
- Sparse suffix tree construction in optimal time and space
- Symmetry breaking in distributed networks
- Upper bounds for time-space trade-offs in sorting and selection
This page was built for publication: Strictly in-place algorithms for permuting and inverting permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832874)
