Searching for authors named "Ulrich Meyer" – sorted by Relevance.
-
Directed Single-Source Shortest-Paths in Linear Average-Case Time
- Directed Single--Source Shortest--Paths in Linear Average--Case Time Ulrich Meyer MPI--I--2001
- Add To MetaCart
-
Buckets strike back: Improved Parallel Shortest-Paths
- Buckets strike back: Improved Parallel Shortest-Paths Ulrich Meyer Max-Planck-Institut fur
- Cited by 4 (1 self) – Add To MetaCart
-
Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
- Single{Source Shortest{Paths on Arbitrary Directed Graphs in Linear Average{Case Time Ulrich Meyer
- Cited by 21 (3 self) – Add To MetaCart
-
External Memory BFS on Undirected Graphs with Bounded Degree
- External Memory BFS on Undirected Graphs with Bounded Degree Ulrich Meyer Abstract We give
- Cited by 12 (4 self) – Add To MetaCart
-
I/O-efficient undirected shortest paths
- I/O-Efficient Undirected Shortest Paths Ulrich Meyer 1,⋆ and Norbert Zeh 2,⋆⋆ 1 Max
- Cited by 7 (2 self) – Add To MetaCart
-
External-memory breadth-first search with sublinear I/O
- External-Memory Breadth-First Search with Sublinear I/O? Kurt Mehlhorn and Ulrich Meyer Max
- Cited by 26 (6 self) – Add To MetaCart
-
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
- Theory and Practice of Time-Space Trade-Offs in Memory Limited Search Stefan Edelkamp and Ulrich
- Cited by 2 (1 self) – Add To MetaCart
-
Time-Independent Gossiping on Full-Port Tori
- Time-Independent Gossiping on Full-Port Tori Ulrich Meyer and Jop F. Sibeyn Max
- Add To MetaCart
-
Oblivious Gossiping on Tori
- Oblivious Gossiping on Tori Ulrich Meyer y Jop F. Sibeyn z Abstract Near-optimal gossiping
- Cited by 2 (1 self) – Add To MetaCart
-
Time-Independent Gossiping on Full-Port Tori
- Time-Independent Gossiping on Full-Port Tori Ulrich Meyer and Jop F. Sibeyn Max
- Cited by 2 (1 self) – Add To MetaCart

