Permuting in place: analysis of two stopping rules

DOI10.1016/J.JALGOR.2004.01.003MaRDI QIDQ4736817zbMATH OpenOpenAlexFDO

Authors Alois Panholzer, Helmut Prodinger, Marko Riedel

Publication date 6 August 2004

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jalgor.2004.01.003

zbMATH Keywords

Analysis of algorithmsHarmonic numbersKnuth's parameter \(a\)Permuting in place

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms (68W40)

Recommendations

• Stopping rules, permutation invariance and sufficiency principle
• scientific article; zbMATH DE number 4068296
• Randomised rules for stopping problems
• An Alternative Approach to the Analysis of Permutations
• Permutation approaches for stochastic ordering
• Permutation statistics and multiple pattern avoidance
• scientific article; zbMATH DE number 4005225
• Permutation methods: a basis for exact inference
• Some stochastic processes in a random permutation

Cited in

(1)

• Cost distribution of the Chang-Roberts leader election algorithm and related problems

This page was built for publication: Permuting in place: analysis of two stopping rules

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