Your search returned the following 46 documents:

46. Breadth first search on massive graphs
    Deepak Ajwani, Ulrich Meyer, and Vitaly Osipov
    In: The shortest path problem : ninth DIMACS implemenation challenge, 2009, 291-307
    
45. An $O(n^2.75)$ algorithm for incremental topological ordering
    Deepak Ajwani, Tobias Friedrich, and Ulrich Meyer
    ACM Transactions on Algorithms 4 (4): 1-14, 2008
    
44. Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design
    Deepak Ajwani, Itay Malinger, Ulrich Meyer, and Sivan Toledo
    In: Proc. 7th Intern. Workshop on Experimental Algorithms (WEA), Provincetown, USA, 2008, 208-219
    
43. On Dynamic Breadth-First Search in External-Memory
    Ulrich Meyer
    In: Proc. 25th Annual Symposium on Theoretical Aspects (STACS), Bordeaux, France, 2008, 551-560
    
42. On Trade-Offs in External-Memory Diameter Approximation
    Ulrich Meyer
    In: Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008
    
41. Improved external memory BFS implementations
    Deepak Ajwani, Ulrich Meyer, and Vitaly Osipov
    In: 9th Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, USA, 2007, 3-12
    
40. A computational study of external memory BFS algorithms
    Deepak Ajwani, Roman Dementiev, and Ulrich Meyer
    In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'06, Miami, USA, 2006, 601-610
    
    
39. A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
    Stefan Funke, Alexander Kesselman, Ulrich Meyer, and Michael Segal
    ACM Transactions on Sensor Networks 2 (3): 444-453, 2006
    
38. Algorithms and Experiments for the Webgraph
    Debora Donato, Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, and Jop F. Sibeyn
    Journal of Graph Algorithms and Applications 10 (2): 219-236, 2006
    
    
37. An $O(n^2.75)$ algorithm for online topological ordering
    Deepak Ajwani, Tobias Friedrich, and Ulrich Meyer
    In: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, 2006, 53-64
    [PDF: Download: 2006SWATofficial_oto.pdf]
    
36. I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
    Ulrich Meyer and Norbert Zeh
    In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, 2006, 540-551
    
35. A Simple Improved Distributed Algorithm for Minimum CDS in Unit Disk Graphs
    Stefan Funke, Alexander Kesselman, Ulrich Meyer, and Michael Segal
    In: 1st IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2005), Montreal, Canada, 2005, 220-223
    
34. Certifying Algorithms (draft)
    Kurt Mehlhorn, Arno Eigenwillig, Kanela Kaligosi, Dieter Kratsch, Ross McConnell, Ulrich Meyer, and Jeremy P. Spinrad
    . Note: draft
    
33. Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
    Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, and Norbert Zeh
    In: Algorithm theory, SWAT 2004 : 9th Scandinavian Workshop on Algorithm Theory ; Humlebæk, Denmark, July 8-10, 2004 ; proceedings, Humlebaek, Denmark, 2004, 480-492
    
32. External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
    Lars Arge, Ulrich Meyer, and Laura Toma
    In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finland, 2004, 146-157
    
31. $\Delta$-stepping: a parallelizable shortest path algorithm
    Ulrich Meyer and Peter Sanders
    Journal of Algorithms 49: 114-152, 2003
    
30. Algorithms and Experiments for the Webgraph
    Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, and Jop F. Sibeyn
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, September, 16 - September, 19, 2003, 703-714
    
29. Average-case complexity of single-source shortest-path algorithms: lower and upper bounds
    Ulrich Meyer
    Journal of Algorithms 48: 91-134, 2003
    
28. Elementary Graph Algorithms in External Memory
    Irit Katriel and Ulrich Meyer
    In: Algorithms for Memory Hierarchies, 2003, 62-84
    
27. On external-memory planar depth first search
    Lars Arge, Ulrich Meyer, Laura Toma, and Norbert Zeh
    Journal of Graph Algorithms and Applications 7 (2): 105-129, 2003
    
26. I/O-Efficient Undirected Shortest Paths
    Ulrich Meyer and Norbert Zeh
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, September, 16 - September, 19, 2003, 434-445
    
25. Buckets Strike Back: Improved Parallel Shortest-Paths
    Ulrich Meyer
    In: International Parallel and Distributed Processing Symposium (IPDPS-02), Fort Lauderdale, USA, 2002, 75-75. Note: The proceedings book only contains the paper abstracts. The full papers are on a CD.
    
24. Design and Analysis of Sequential and Parallel Single-Source Shortest-Paths Algorithms
    Ulrich Meyer
    Doctoral dissertation, Universität des Saarlandes, 2002
    
23. External-Memory Breadth-First Search with Sublinear I/O
    Kurt Mehlhorn and Ulrich Meyer
    In: Algorithms - ESA 2002 : 10th Annual European Symposium, Rome, Italy, 2002, 723-735
    
    
22. Heuristics for Semi-External Depth First Search on Directed Graphs
    Jop F. Sibeyn, James Abello, and Ulrich Meyer
    In: SPAA 2002 : Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, Winnipeg, Canada, 2002, 282-292
    
21. Oblivious Gossiping on Tori
    Ulrich Meyer and Jop F. Sibeyn
    Journal of Algorithms 42 (1): 1-19, 2002
    
20. An experimental study of priority queues in external memory
    Andreas Crauser, Ulrich Meyer, and Klaus Brengel
    ACM
    
19. External Memory BFS on Undirected Graphs with Bounded Degree
    Ulrich Meyer
    In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Washington, DC, January, 07-09, 2001, 87-88
    
18. Heaps are better than Buckets: Parallel Shortest Paths on Unbalanced Graphs
    Ulrich Meyer
    In: Proceedings of the 7th International Euro-Par Conference on Parallel Processing (Euro-Par-01) :, Manchester, UK, August, 28 - August, 31, 2001, 343-351
    
17. On External-Memory Planar Depth First Search
    Lars Arge, Ulrich Meyer, Laura Toma, and Norbert Zeh
    In: Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS-01), Providence, Rhode Island, USA, August, 8 - August, 10, 2001, 471-482
    
16. Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    International Journal of Computational Geometry & Applications 11 (3): 305-337, 2001. Note: Special issue edited by J Hershberger: Selected Papers from the Fourteenth ACM Symposium on Computational Geometry, Minneapolis, MN, June, 1998
    
15. Single-Source Shortest-Paths on Arbitrary Directed Graphs in Linear Average-Case Time
    Ulrich Meyer
    In: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01), Washington, DC, January, 07-09, 2001, 797-806
    
14. Theory and Practice of Time-Space Trade-Offs in Memory Limited Search
    Stefan Edelkamp and Ulrich Meyer
    In: Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence (KI-01), Wien, Österreich, September, 19 - September, 21, 2001, 169-184
    
13. Parallel Shortest Path for Arbitrary Graphs
    Ulrich Meyer and Peter Sanders
    In: Euro-Par 2000 Parallel Processing, Proceedings of the 6th International Euro-Par Conference (Euro-Par-00), Munich, Germany, August, 29 - September, 1, 2000, 461-470
    
12. An Experimental Study of Priority Queues in External Memory
    Klaus Brengel, Andreas Crauser, Ulrich Meyer, and Paolo Ferragina
    In: Algorithm engineering (WAE-99) : 3rd International Workshop, WAE'99, London, UK, July, 19-21, 1999, 345-359
    
11. I/O-optimal computation of segment intersections
    Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
    In: Proceedings of the DIMACS Workshop on External Algorithms and Visualization, New Brunswick, New Jersey, May 20-22, 1998, 1999, 131-138
    
10. $\Delta$-Stepping: A Parallel Single Source Shortest Path Algorithm
    Ulrich Meyer and Peter Sanders
    In: Proceedings of the 6th Annual European Symposium on Algorithms (ESA-98), Venice, Italy, August, 24 - 26, 1998, 393-404
    
9. A Parallelization of Dijkstra's Shortest Path Algorithm
   Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, and Peter Sanders
   In: Proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science (MFCS-98), Brno, Czech Republic, August, 24 - August, 28, 1998, 722-731
   
   
8. Gossiping Large Packets on Full-Port Tori
   Ulrich Meyer and Jop F. Sibeyn
   In: Proceedings of the 4th International Euro-Par Conference (Euro-Par-98), Southampton, United Kingdom, September, 1 - September, 4, 1998, 1040-1046
   
7. Randomized External-Memory Algorithms for some Geometric Problems
   Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, and Edgar A. Ramos
   In: Proceedings of the 14th International Annual ACM Symposium on Computational Geometry (SCG-98), Minneapolis, Minnesota, June 7-10, 1998, 259-268
   
   
6. Kürzeste-Wege-Berechnung bei sehr großen Datenmengen
   Andreas Crauser, Kurt Mehlhorn, and Ulrich Meyer
   In: Promotion tut not: Innovationsmotor "Graduiertenkolleg", Aachen, Germany, September, 22-23, 1997, 113-132
   
5. Matrix Transpose on Meshes: Theory and Practice
   Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
   In: Proceedings of the 11th International Parallel Processing Symposium (IPPS-97), Geneva, Switzerland, April, 1-5, 1997, 315-319
   
4. Matrix Transpose on Meshes: Theory and Practice
   Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
   Computers and Artificial Intelligence 16 (2): 107-140, 1997
   
3. Towards Practical Permutation Routing on Meshes
   Michael Kaufmann, Ulrich Meyer, and Jop F. Sibeyn
   In: Proceedings of the 6th IEEE Symposium on Parallel and Distributed Processing, Dallas, Texas, October, 26-29, 1994, 656-663
   
2. Deterministische Simulation einer PRAM auf Gitterrechnern
   Ulrich Meyer
   Master's thesis, Universität des Saarlandes, 1995
   
1. Simulating the Simulator: Determinstic PRAM Simulation on a Mesh Simulator
   Ulrich Meyer and Jop F. Sibeyn
   In: Eurosim '95, Vienna, Austria, September, 11 - September, 15, 1995, 285-290