Efficient massively parallel implementation of some combinatorial algorithms
From MaRDI portal
Publication:1365935
DOI10.1016/0304-3975(96)00034-5zbMath0877.68066OpenAlexW2004779434MaRDI QIDQ1365935
Tsan-sheng Hsu, Vijaya Ramachandran
Publication date: 10 September 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00034-5
Related Items
Uses Software
Cites Work
- A simple randomized parallel algorithm for list-ranking
- An experimental analysis of parallel sorting algorithms
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Parallel Prefix Computation
- Ultracomputers
- Implementation of simultaneous memory address access in models that forbid it
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item