Researcher Portfolio

 
   

Dr. Meyer, Ulrich

Algorithms and Complexity, MPI for Informatics, Max Planck Society  

 

Researcher Profile

 
Position: Algorithms and Complexity, MPI for Informatics, Max Planck Society
Researcher ID: https://pure.mpg.de/cone/persons/resource/persons45038

External references

 
WorldCat Search for Meyer, Ulrich
Google Scholar Search for Meyer, Ulrich

Publications

 
  (1 - 25 of 49)
 : Ajwani, D., Malinger, I., Meyer, U., & Toledo, S.(2008). Characterizing the performance of Flash memory storage devices and its impact on algorithm design (MPI-I-2008-1-001). Saarbrücken: Max-Planck-Institut für Informatik. [PubMan] : Ajwani, D., Malinger, I., Meyer, U., & Toledo, S. (2008). Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. In C. McGeoch (Ed.), Experimental Algorithms (pp. 208-219). Berlin: Springer. doi:10.1007/978-3-540-68552-4_16. [PubMan] : Ajwani, D., Meyer, U., & Osipov, V. (2007). Improved External Memory BFS Implementations. In D. Applegate, G. S. Brodal, D. Panario, & R. Sedgewick (Eds.), Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics (pp. 3-12). Philadephia, PA: SIAM. doi:10.1137/1.9781611972870.1. [PubMan] : Donato, D., Laura, L., Leonardi, S., Millozzi, S., Meyer, U., & Sibeyn, J. F. (2006). Algorithms and Experiments for the Webgraph. Journal of Graph Algorithms and Applications, 10(2), 219-236. [PubMan] : Funke, S., Kesselman, A., Meyer, U., & Segal, M. (2006). A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs. ACM Transactions on Sensor Networks, 2, 444-453. [PubMan] : Ajwani, D., Friedrich, T., & Meyer, U. (2006). An O(n^2.75) algorithm for online topological ordering. In Algorithm theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory (pp. 53-64). Berlin, Germany: Springer. [PubMan] : Meyer, U., & Zeh, N. (2006). I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. In Algorithms - ESA 2006, 14th Annual European Symposium (pp. 540-551). Berlin, Germany: Springer. [PubMan] : Ajwani, D., Dementiev, R., & Meyer, U. (2006). A computational study of external memory BFS algorithms. In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06 (pp. 601-610). New York, USA: ACM / Siam. [PubMan] : Funke, S., Kesselmann, A., Meyer, U., & Segal, M. (2005). A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs. In 1st IEEE Intern. Conf. on Wireless and Mobile Computing, Networking and Communications (WiMob 2005) (pp. 220-223). Los Alamitos, USA: IEEE. [PubMan] : Brodal, G. S., Fagerberg, R., Meyer, U., & Zeh, N. (2004). Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. In Algorithm theory, SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory; Humlebæk, Denmark, July 8-10, 2004; proceedings (pp. 480-492). Berlin, Germany: Springer. [PubMan] : Arge, L., Meyer, U., & Toma, L. (2004). External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. In Automata, languages and programming: 31st International Colloquium, ICALP 2004 (pp. 146-157). Berlin, Germany: Springer. [PubMan] : Arge, L., Meyer, U., Toma, L., & Zeh, N. (2003). On external-memory planar depth first search. Journal of Graph Algorithms and Applications, 7, 105-129. [PubMan] : Laura, L., Leonardi, S., Millozzi, S., Meyer, U., & Sibeyn, J. F. (2003). Algorithms and Experiments for the Webgraph. In Algorithms - ESA 2003: 11th Annual European Symposium (pp. 703-714). Berlin, Germany: Springer. [PubMan] : Meyer, U., Sanders, P., & Sibeyn, J. F. (Eds.). (2003). Algorithms for Memory Hierarchies. Berlin, Germany: Springer. [PubMan] : Sanders, P. (2003). Memory hierarchies - models and lower bounds. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for memory hierarchies (pp. 1-10). Berlin, Germany: Springer. [PubMan] : Meyer, U., & Zeh, N. (2003). I/O-Efficient Undirected Shortest Paths. In Algorithms - ESA 2003: 11th Annual European Symposium (pp. 434-445). Berlin, Germany: Springer. [PubMan] : Kärkkäinen, J., & Rao, S. S. (2003). Full-Text Indexes in External Memory. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for Memory Hierarchies (pp. 149-170). Berlin, Germany: Springer. [PubMan] : Meyer, U. (2003). Average-case complexity of single-source shortest-path algorithms: lower and upper bounds. Journal of Algorithms, 48, 91-134. [PubMan] : Meyer, U., & Sanders, P. (2003). Δ-stepping: a parallelizable shortest path algorithm. Journal of Algorithms, 49, 114-152. [PubMan] : Katriel, I., & Meyer, U. (2003). Elementary Graph Algorithms in External Memory. In U. Meyer, P. Sanders, & J. Sibeyn (Eds.), Algorithms for Memory Hierarchies (pp. 62-84). Berlin, Germany: Springer. [PubMan] : Meyer, U., & Sibeyn, J. F. (2002). Oblivious Gossiping on Tori. Journal of Algorithms, 42, 1-19. [PubMan] : Sibeyn, J. F., Abello, J., & Meyer, U. (2002). Heuristics for Semi-External Depth First Search on Directed Graphs. In SPAA 2002: Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 282-292). New York, USA: ACM. [PubMan] : Meyer, U. (2002). Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms. PhD Thesis, Universität des Saarlandes, Saarbrücken. doi:10.22028/D291-25720. [PubMan] : Meyer, U. (2002). Buckets Strike Back: Improved Parallel Shortest-Paths. In International Parallel and Distributed Processing Symposium (IPDPS-02) (pp. 75-75). Los Alamitos, USA: IEEE. [PubMan] : Mehlhorn, K., & Meyer, U. (2002). External-Memory Breadth-First Search with Sublinear I/O. In Algorithms - ESA 2002: 10th Annual European Symposium (pp. 723-735). Berlin, Germany: Springer. [PubMan]