Improved parallel integer sorting without concurrent writing
From MaRDI portal
Publication:1362905
DOI10.1006/INCO.1997.2632zbMATH Open0874.68085DBLPjournals/iandc/AlbersH97OpenAlexW2009283111WikidataQ61051135 ScholiaQ61051135MaRDI QIDQ1362905FDOQ1362905
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Preserving order in a forest in less than logarithmic time and linear space
- Title not available (Why is that?)
- Title not available (Why is that?)
- Surpassing the information theoretic bound with fusion trees
- Parallel Merge Sort
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- A complexity theory of efficient parallel algorithms
- Title not available (Why is that?)
- Deterministic coin tossing with applications to optimal parallel list ranking
- Optimal merging and sorting on the EREW PRAM
- Title not available (Why is that?)
- Searching, Merging, and Sorting in Parallel Computation
- On parallel integer merging
- Improved deterministic parallel integer sorting
- Efficient parallel algorithms for graph problems
- Title not available (Why is that?)
- On parallel integer sorting
- Upper bounds for sorting integers on random access machines
- Title not available (Why is that?)
- Improved nonconservative sequential and parallel integer sorting
- On parallel hashing and integer sorting
- Fast parallel space allocation, estimation, and integer sorting
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (21)
- More efficient parallel integer sorting
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
- A parallel bucket sort
- Faster approximate string matching for short patterns
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Improved fast integer sorting in linear space
- More Efficient Parallel Integer Sorting
- Parallel integer sorting and simulation amongst CRCW models
- Fast Evaluation of Union-Intersection Expressions
- Dynamic Set Intersection
- Title not available (Why is that?)
- Sorting in linear time?
- Title not available (Why is that?)
- Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
- Improved nonconservative sequential and parallel integer sorting
- Parallel integer sorting using small operations
- Probabilistic integer sorting
- Upper bounds for sorting integers on random access machines
- A subquadratic algorithm for 3XOR
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
- Parallel iterated bucket sort
This page was built for publication: Improved parallel integer sorting without concurrent writing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362905)
