A generalization of the 0-1 principle for sorting

DOI10.1016/J.IPL.2004.11.013zbMath1182.68365OpenAlexW2167790568MaRDI QIDQ1041721

Sandeep Sen, Sanguthevar Rajasekaran

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.11.013

zbMATH Keywords

sortinganalysis of algorithmsparallel algorithmsrandomized algorithmsmeshes0-1 principleaverage case perfomance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Optimal conclusive sets for comparator networks

Cites Work

• Continuous algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of the 0-1 principle for sorting