Ulrich Meyer
Ulrich Meyer
Professor of Algorithm Engineering, Goethe University Frankfurt
Verified email at - Homepage
Cited by
Cited by
Δ-stepping: a parallelizable shortest path algorithm
U Meyer, P Sanders
Journal of Algorithms 49 (1), 114-152, 2003
A parallelization of Dijkstra's shortest path algorithm
A Crauser, K Mehlhorn, U Meyer, P Sanders
International Symposium on Mathematical Foundations of Computer Science, 722-731, 1998
A simple improved distributed algorithm for minimum CDS in unit disk graphs
S Funke, A Kesselman, U Meyer, M Segal
ACM Transactions on Sensor Networks (TOSN) 2 (3), 444-453, 2006
External-memory breadth-first search with sublinear I/O
K Mehlhorn, U Meyer
European Symposium on Algorithms, 723-735, 2002
Δ-Stepping : A Parallel Single Source Shortest Path Algorithm
U Meyer, P Sanders
European symposium on algorithms, 393-404, 1998
Single-source shortest-paths on arbitrary directed graphs in linear average-case time
U Meyer
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
Algorithms for memory hierarchies: advanced lectures
U Meyer, P Sanders
Springer Science & Business Media, 2003
Algorithms-ESA 2010
U Meyer
Springer-Verlag Berlin Heidelberg, 2010
A computational study of external-memory BFS algorithms
D Ajwani, R Dementiev, U Meyer
The Seventeenth Annual ACM-SIAM Symposium on Discrete Algorith (SODA'06 …, 2006
Characterizing the performance of flash memory storage devices and its impact on algorithm design
D Ajwani, I Malinger, U Meyer, S Toledo
International Workshop on Experimental and Efficient Algorithms, 208-219, 2008
Randomized external-memory algorithms for line segment intersection and other geometric problems
A Crauser, P Ferragina, K Mehlhorn, U Meyer, EA Ramos
International Journal of Computational Geometry & Applications 11 (03), 305-337, 2001
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
GS Brodal, R Fagerberg, U Meyer, N Zeh
Scandinavian Workshop on Algorithm Theory, 480-492, 2004
I/O-efficient undirected shortest paths
U Meyer, N Zeh
European Symposium on Algorithms, 434-445, 2003
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
U Meyer
Journal of Algorithms 48 (1), 91-134, 2003
Improved external memory BFS implementations
D Ajwani, U Meyer, V Osipov
2007 Proceedings of the Ninth Workshop on Algorithm Engineering and …, 2007
External memory BFS on undirected graphs with bounded degree.
U Meyer
SODA, 87-88, 2001
An experimental study of priority queues in external memory
K Brengel, A Crauser, P Ferragina, U Meyer
Journal of Experimental Algorithmics (JEA) 5, 17-es, 2000
Heuristics for semi-external depth first search on directed graphs
JF Sibeyn, J Abello, U Meyer
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
Communication-free massively distributed graph generation
D Funke, S Lamm, U Meyer, M Penschuck, P Sanders, C Schulz, D Strash, ...
Journal of Parallel and Distributed Computing 131, 200-217, 2019
Design and implementation of a practical i/o-efficient shortest paths algorithm
U Meyer, V Osipov
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and …, 2009
The system can't perform the operation now. Try again later.
Articles 1–20