More general parallel tree contraction: Register allocation and broadcasting in a tree
From MaRDI portal
Publication:1274316
DOI10.1016/S0304-3975(97)00285-5zbMath0913.68092OpenAlexW1507089639MaRDI QIDQ1274316
Torben Hagerup, Krzysztof Diks
Publication date: 12 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00285-5
Cites Work
- Unnamed Item
- On parallel integer merging
- Deterministic parallel list ranking
- Sorting in \(c \log n\) parallel steps
- Routing, merging, and sorting on parallel models of computation
- An Efficient Parallel Biconnectivity Algorithm
- Deterministic coin tossing with applications to optimal parallel list ranking
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Parallel Merge Sort
- Relations between Concurrent-Write Models of Parallel Computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Information Dissemination in Trees
- Parallel Tree Contraction Part 2: Further Applications
- Complete Register Allocation Problems
- A simple parallel tree contraction algorithm
This page was built for publication: More general parallel tree contraction: Register allocation and broadcasting in a tree
