U
Ulrich Meyer
Researcher at Goethe University Frankfurt
Publications - 140
Citations - 3206
Ulrich Meyer is an academic researcher from Goethe University Frankfurt. The author has contributed to research in topics: Shortest path problem & Time complexity. The author has an hindex of 27, co-authored 137 publications receiving 3036 citations. Previous affiliations of Ulrich Meyer include Max Planck Society.
Papers
More filters
Book ChapterDOI
Gossiping Large Packets on Full-Port Tori
Ulrich Meyer,Jop F. Sibeyn +1 more
TL;DR: In this paper, a near-optimal gossiping algorithm for two-dimensional tori is proposed. But it is assumed that the amount of data each PU is contributing is so large, that start-up time may be neglected.
Book ChapterDOI
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering
TL;DR: This work provides experimental results of the first external-memory dynamic breadth-first search (BFS) implementation based on earlier theoretical work that crucially relies on a randomized clustering that groups vertices in a level-aligned hierarchy and facilitates easy access to clusters of changing sizes during the BFS updates.
Proceedings ArticleDOI
Fragile complexity of comparison-based algorithms
Peyman Afshani,Rolf Fagerberg,David Hammer,David Hammer,Riko Jacob,Irina Kostitsyna,Ulrich Meyer,Manuel Penschuck,Nodari Sitchinava +8 more
TL;DR: It is proved that for some problems a fragile complexity equal to the best network depth can be achieved with less total work and that with randomization, even a lower fragile complexity is possible.
Book ChapterDOI
Online Paging for Flash Memory Devices
TL;DR: This work proposes a variation of online paging in two-level memory systems where pages in the fast cache get modified and therefore have to be explicitly written back to the slow memory upon evictions, and gives lower bounds for deterministic and randomized ?
Posted Content
An O(n^{2.75}) algorithm for online topological ordering
TL;DR: In this paper, the authors present an algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n 2.75 ) time, independent of the number of edges m inserted.