Probabilistic analysis of a grouping algorithm

DOI10.1007/BF01759041MaRDI QIDQ749213zbMATH OpenFDO

Authors D. F. Wong, Edward M. Reingold

Publication date 1991

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01759041

zbMATH Keywords

exponential of matrixgrouping by swappingmemory compactionprobabilistic analysis of algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3968860
• Probabilistic analysis of optimum partitioning
• Select with groups of 3 or 4
• Probabilistic Parallel Algorithms for Sorting and Selection
• Selection Algorithms with Small Groups

Cites work

• A recurrence among the elements of functions of triangular matrices
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)

Cited in

(2)

• Generalised Sifting in Black-Box Groups
• Width notions for ordering-related problems

This page was built for publication: Probabilistic analysis of a grouping algorithm

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