The multilevel principle applied to sorting

DOI10.1007/BF02017340zbMATH Open0696.68085MaRDI QIDQ911309FDOQ911309

Authors: C. Douglas, Willard L. Miranker 

Publication date: 1990

Published in: BIT (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1003299
• Algorithms for parallel memory. II: Hierarchical multilevel memories
• Parallel sorting by regular sampling
• Measures of Presortedness and Optimal Sorting Algorithms
• scientific article; zbMATH DE number 4074508

zbMATH Keywords

multilevel methods

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Multi-Level Adaptive Solutions to Boundary-Value Problems
• Methods of aggregation
• Multi-Grid Algorithms with Applications to Elliptic Boundary Value Problems
• Sorting by distributive partitioning
• Sharp Estimates for Multigrid Rates of Convergence with General Smoothing and Acceleration
• Sorting in linear expected time
• Usort: An efficient hybrid of distributive partitioning sorting
• An Adaptive Method for Unknown Distributions in Distributive Partitioned Sorting
• Acceleration by aggregation of successive approximation methods
• The design and analysis of a new hybrid sorting algorithm

Cited In (1)

• A generalization of the zero-one principle for sorting algorithms

This page was built for publication: The multilevel principle applied to sorting

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