A generalization of the zero-one principle for sorting algorithms

DOI10.1016/0166-218X(91)90050-7zbMath0714.68018MaRDI QIDQ751248

D. Kharzeev

Publication date: 1991

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

zero-one principle

Mathematics Subject Classification ID

Searching and sorting (68P10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Optimal parallel algorithms for computing convex hulls and for sorting
• Sorting on a mesh-connected parallel computer
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Parallel Processing with the Perfect Shuffle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A generalization of the zero-one principle for sorting algorithms