A generalization of the zero-one principle for sorting algorithms

DOI10.1016/0166-218X(91)90050-7MaRDI QIDQ751248zbMATH OpenFDO

Authors D. Kharzeev

Publication date 1991

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

Full work available at URL https://doi.org/10.1016/0166-218X(91)90050-7

zbMATH Keywords

zero-one principle

Mathematics Subject Classification ID

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

Recommendations

• A generalization of the 0-1 principle for sorting
• The strongest model of computation obeying 0-1 Principles
• scientific article; zbMATH DE number 3876613
• The multilevel principle applied to sorting
• scientific article; zbMATH DE number 22189

Cites work

• Bitonic Sort on a Mesh-Connected Parallel Computer
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3550662 (Why is no real title available?)
• scientific article; zbMATH DE number 3591948 (Why is no real title available?)
• scientific article; zbMATH DE number 4003540 (Why is no real title available?)
• scientific article; zbMATH DE number 3392404 (Why is no real title available?)
• Optimal parallel algorithms for computing convex hulls and for sorting
• Parallel Processing with the Perfect Shuffle
• Sorting on a mesh-connected parallel computer

Cited in

(4)

• A generalization of the 0-1 principle for sorting
• A generalized, one-way, stackless quicksort
• scientific article; zbMATH DE number 22189 (Why is no real title available?)
• The strongest model of computation obeying 0-1 Principles

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

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