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
Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
TL;DR: In this article, a new parallel algorithm for the single-source shortest-path problem (SSSP) was proposed, which runs in O(log2 nċmini{2iċLċlog n+|Vi|}) average case time using O(nċ log n+m) operations where |Vi| is the number of graph vertices with degree at least 2i.
Journal Article
Large-scale Graph Generation and Big Data: An Overview on Recent Results
Ulrich Meyer,Manuel Penschuck +1 more
TL;DR: A number of recent results for large-scale graph generation obtained within the DFG priority programme SPP 1736 (Algorithms for Big Data) are surveyed.
Journal ArticleDOI
A structural analysis of the A5/1 state transition graph
TL;DR: In this paper, the authors describe efficient algorithms to analyze the cycle structure of the graph induced by the state transition function of the A5/1 stream cipher used in GSM mobile phones.
Posted Content
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
Corrie Jacobien Carstens,Michael Hamann,Ulrich Meyer,Manuel Penschuck,Hung Tran,Dorothea Wagner +5 more
TL;DR: In this paper, the I/O-efficient Curveball algorithm EM-CB is proposed for simple undirected graphs and its internal memory pendant IM-CB for global trades.
Posted Content
Simulating Population Protocols in Sub-Constant Time per Interaction.
TL;DR: This work empirically and analytically analyze two classes of simulators for the problem of efficiently simulating population protocols, and considers batch processing to efficiently update the states of multiple independent agents in one step.