Corpus ID: 231573156

Strictly In-Place Algorithms for Permuting and Inverting Permutations

@article{Dudek2021StrictlyIA,
  title={Strictly In-Place Algorithms for Permuting and Inverting Permutations},
  author={B. Dudek and Pawel Gawrychowski and Karol Pokorski},
  journal={ArXiv},
  year={2021},
  volume={abs/2101.03978}
}
We revisit the problem of permuting an array of length n according to a given permutation in place, that is, using only a small number of bits of extra storage. Fich, Munro and Poblete [FOCS 1990, SICOMP 1995] obtained an elegant O(n logn)-time algorithm using only O(log n) bits of extra space for this basic problem by designing a procedure that scans the permutation and outputs exactly one element from each of its cycles. However, in the strict sense in place should be understood as using only… Expand

References

SHOWING 1-10 OF 29 REFERENCES
Permuting in Place
Raising Permutations to Powers in Place
An in-place, subquadratic algorithm for permutation inversion
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle
Finding median in read-only memory on integer input
Sparse Suffix Tree Construction in Optimal Time and Space
Optimal time-space trade-offs for sorting
  • J. Pagter, Theis Rauhe
  • Mathematics, Computer Science
  • Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
Symmetry breaking in distributed networks
Cell probe lower bounds for succinct data structures
...
1
2
3
...