Improved parallel integer sorting without concurrent writing
From MaRDI portal
(Redirected from Publication:1362905)
Recommendations
Cites work
- A complexity theory of efficient parallel algorithms
- Deterministic coin tossing with applications to optimal parallel list ranking
- Efficient parallel algorithms for graph problems
- Fast parallel space allocation, estimation, and integer sorting
- scientific article; zbMATH DE number 1003255 (Why is no real title available?)
- scientific article; zbMATH DE number 4215352 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3757704 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1256701 (Why is no real title available?)
- scientific article; zbMATH DE number 1263219 (Why is no real title available?)
- scientific article; zbMATH DE number 1306898 (Why is no real title available?)
- scientific article; zbMATH DE number 871900 (Why is no real title available?)
- Improved deterministic parallel integer sorting
- Improved nonconservative sequential and parallel integer sorting
- On parallel hashing and integer sorting
- On parallel integer merging
- On parallel integer sorting
- Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
- Optimal merging and sorting on the EREW PRAM
- Parallel Merge Sort
- Preserving order in a forest in less than logarithmic time and linear space
- Searching, Merging, and Sorting in Parallel Computation
- Surpassing the information theoretic bound with fusion trees
- Upper bounds for sorting integers on random access machines
Cited in
(23)- A parallel bucket sort
- Parallel iterated bucket sort
- Sorting in linear time?
- Parallel integer sorting using small operations
- Improved fast integer sorting in linear space
- Parallel integer sorting and simulation amongst CRCW models
- Probabilistic integer sorting
- 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
- More efficient parallel integer sorting
- Dynamic set intersection
- scientific article; zbMATH DE number 1305432 (Why is no real title available?)
- scientific article; zbMATH DE number 1760030 (Why is no real title available?)
- scientific article; zbMATH DE number 742994 (Why is no real title available?)
- Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs
- A subquadratic algorithm for 3XOR
- Fast Evaluation of Union-Intersection Expressions
- More Efficient Parallel Integer Sorting
- Faster approximate string matching for short patterns
- Upper bounds for sorting integers on random access machines
- On parallel integer sorting
- Improved nonconservative sequential and parallel integer sorting
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path
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)
