OPTIMAL BUCKET SORTING AND OVERLAP REPRESENTATIONS

DOI10.1080/10637199708915621zbMath0873.68045OpenAlexW1974412665MaRDI QIDQ3130162

Lin Chen

Publication date: 9 October 1997

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199708915621

zbMATH Keywords

bucket sort

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Cites Work

• Improved deterministic parallel integer sorting
• Optimal parallel time bounds for the maximum clique problem on intervals
• Faster optimal parallel prefix sums and list ranking
• Polynomial time algorithms on circular-arc overlap graphs
• Efficient algorithms for finding maximum cliques of an overlap graph
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• A fast parallel algorithm for the maximal independent set problem
• Parallel Prefix Computation
• The Parallel Evaluation of General Arithmetic Expressions
• Optimal bounds for decision problems on the CRCW PRAM
• Constructing a Maximal Independent Set in Parallel
• Unnamed Item
• Unnamed Item