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
Journal ArticleDOI
An O(n2.75) algorithm for online topological ordering
TL;DR: A simple 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 is presented.
An Experimental Study of Priority Queues in External Memory
TL;DR: It is required to design PQs which take explicitly into account the physical properties of the disk systems in order to achieve efficient I/O-performances that allow these data structures to be plugged successfully in software libraries.
Journal ArticleDOI
From Big Data to Big Artificial Intelligence
Kristian Kersting,Ulrich Meyer +1 more
TL;DR: This special issue constitutes an attempt to highlight the algorithmic challenges and opportunities but also the social and ethical issues of Big Data.
Proceedings ArticleDOI
GPU multisplit
TL;DR: This work provides a parallel model and multiple implementations for the multisplit problem, and uses warp-synchronous programming models to avoid branch divergence and reduce memory usage, as well as hierarchical reordering of input elements to achieve better coalescing of global memory accesses.
Book ChapterDOI
I/O-efficient undirected shortest paths with unbounded edge lengths
Ulrich Meyer,Norbert Zeh +1 more
TL;DR: In this paper, the authors show how to compute single-source shortest paths in undirected graphs with nonnegative edge lengths in O(√nm/Blogn+MST(n,m)I/Os, where n is the number of vertices, m is the total number of edges, B is the disk block size, and MST is the I/O cost of computing a minimum spanning tree.