Improved parallel integer sorting without concurrent writing
From MaRDI portal
Publication:1362905
DOI10.1006/inco.1997.2632zbMath0874.68085OpenAlexW2009283111WikidataQ61051135 ScholiaQ61051135MaRDI QIDQ1362905
Torben Hagerup, Susanne Albers
Publication date: 10 November 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-B799-5
Related Items (10)
Dynamic Set Intersection ⋮ Four Soviets walk the dog: improved bounds for computing the Fréchet distance ⋮ Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back ⋮ Fast Evaluation of Union-Intersection Expressions ⋮ An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path ⋮ A subquadratic algorithm for 3XOR ⋮ Faster approximate string matching for short patterns ⋮ More Efficient Parallel Integer Sorting ⋮ Sorting in linear time? ⋮ Improved fast integer sorting in linear space
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal merging and sorting on the EREW PRAM
- On parallel integer merging
- Upper bounds for sorting integers on random access machines
- On parallel integer sorting
- A complexity theory of efficient parallel algorithms
- Improved nonconservative sequential and parallel integer sorting
- Improved deterministic parallel integer sorting
- Preserving order in a forest in less than logarithmic time and linear space
- Efficient parallel algorithms for graph problems
- Surpassing the information theoretic bound with fusion trees
- Fast parallel space allocation, estimation, and integer sorting
- Searching, Merging, and Sorting in Parallel Computation
- Deterministic coin tossing with applications to optimal parallel list ranking
- Parallel Merge Sort
- On parallel hashing and integer sorting
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
This page was built for publication: Improved parallel integer sorting without concurrent writing
