Permuting in Place

DOI10.1137/S0097539792238649zbMath0939.68600OpenAlexW1998790567MaRDI QIDQ4834380

Patricio V. Poblete, J. Ian Munro, Faith E. Fich

Publication date: 4 July 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792238649

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (7)

Strictly in-place algorithms for permuting and inverting permutations ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ In-place permuting and perfect shuffling using involutions ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Transposition as a Permutation: A Tale of Group Actions and Modular Arithmetic ⋮ Computing the cycles in the perfect shuffle permutation ⋮ A heuristic to accelerate in-situ permutation algorithms

This page was built for publication: Permuting in Place