A generalization of the zero-one principle for sorting algorithms

DOI10.1016/0166-218X(91)90050-7zbMATH Open0714.68018MaRDI QIDQ751248FDOQ751248

Authors: D. Kharzeev 

Publication date: 1991

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

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

zbMATH Keywords

zero-one principle

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Parallel Processing with the Perfect Shuffle
• Title not available (Why is that?)
• Optimal parallel algorithms for computing convex hulls and for sorting
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Sorting on a mesh-connected parallel computer
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• A generalization of the 0-1 principle for sorting
• The strongest model of computation obeying 0-1 Principles
• Title not available (Why is that?)
• A generalized, one-way, stackless quicksort

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)