Permuting in Place

DOI10.1137/S0097539792238649MaRDI QIDQ4834380zbMATH OpenOpenAlexFDO

Authors J. Ian Munro, Patricio V. Poblete, 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

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

Cited in

(7)

• Computing the cycles in the perfect shuffle permutation
• A heuristic to accelerate in-situ permutation algorithms
• In-place permuting and perfect shuffling using involutions
• Transposition as a permutation: a tale of group actions and modular arithmetic
• Space-efficient construction of Lempel-Ziv compressed text indexes
• Strictly in-place algorithms for permuting and inverting permutations
• Cost distribution of the Chang-Roberts leader election algorithm and related problems

This page was built for publication: Permuting in Place

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4834380)