Searching for authors named "Torben Hagerup" – sorted by Relevance.
-
Fast integer merging on the EREW PRAM
- Fast Integer Merging on the EREW PRAM Torben Hagerup ∗ Max–Planck–Institut für Informatik, Im
- Cited by 1 (0 self) – Add To MetaCart
-
Prefix Graphs and Their Applications
- Prefix Graphs and Their Applications ? Shiva Chaudhuri and Torben Hagerup Max-Planck-Institut fur
- Cited by 1 (1 self) – Add To MetaCart
-
Improved Parallel Integer Sorting without Concurrent Writing
- Improved Parallel Integer Sorting without Concurrent Writing Susanne Albers yz Torben Hagerup
- Cited by 37 (4 self) – Add To MetaCart
-
Self-Simulation for the Passive Optical Star
- Self-Simulation for the Passive Optical Star y Pascal Berthom'e z Torben Hagerup x Ilan Newman
- Add To MetaCart
-
Arne Andersson
- Sorting in Linear Time? Arne Andersson y Torben Hagerup z Stefan Nilsson x Rajeev Raman
- Add To MetaCart
-
Blasting Past Fusion Trees
- Blasting Past Fusion Trees Arne Andersson Stefan Nilsson Torben Hagerup y 10 October 1994
- Add To MetaCart
-
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees
- -Trees Torben Hagerup Naomi Nishimura y Jyrki Katajainen z Prabhakar Ragde x Abstract We show that if a
- Cited by 6 (1 self) – Add To MetaCart
-
Tight Bounds for Searching a Sorted Array of Strings
- Tight bounds for searching a sorted array of strings Arne Andersson Torben Hagerup y Johan
- Cited by 5 (0 self) – Add To MetaCart
-
Approximate and Exact Deterministic Parallel Selection
- Approximate and Exact Deterministic Parallel Selection Shiva Chaudhuri 1 Torben Hagerup 2
- Cited by 15 (2 self) – Add To MetaCart
-
The Complexity of Searching a Sorted Array of Strings
- of searching a sorted array of strings Arne Andersson Torben Hagerup y Johan Hastad z Ola Petersson x
- Cited by 4 (2 self) – Add To MetaCart

