scientific article; zbMATH DE number 108389

MaRDI QIDQ4023848zbMATH OpenFDO

Authors Gregory J. E. Rawlins

Publication date 23 January 1993

zbMATH Keywords

complexity theorysearchingselectingsorting

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 193197
• scientific article; zbMATH DE number 4058818
• Practical analysis of algorithms
• An Introduction to the Analysis of Algorithms
• scientific article; zbMATH DE number 976346

Cited in

(16)

• Linear-time optimal augmentation for componentwise bipartite-completeness of graphs
• Ockham's razor in interval identification
• On generalized comparison-based sorting problems
• Analysis of algorithms. An active learning approach
• scientific article; zbMATH DE number 193197 (Why is no real title available?)
• On the median-of-k version of Hoare's selection algorithm
• An elementary approach to design and analysis of algorithms
• A description of supply chain planning problems in the paper industry with literature review
• PROBLEM SOLVING WITH INSUFFICIENT RESOURCES
• Algorithms. Design and analysis
• Algorithms. Design techniques and analysis
• Matching nuts and bolts faster
• Matching nuts and bolts faster
• An algorithm for bichromatic sorting with polylog competitive ratio
• On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting
• Finding large 3-free sets. I. The small \(n\) case

This page was built for publication:

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