2009 | ||
---|---|---|
46 | EE | Ulrich Meyer, Vitaly Osipov: Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX 2009: 85-96 |
2008 | ||
45 | EE | Ulrich Meyer: On Dynamic Breadth-First Search in External-Memory. STACS 2008: 551-560 |
44 | EE | Ulrich Meyer: On Trade-Offs in External-Memory Diameter-Approximation. SWAT 2008: 426-436 |
43 | EE | Deepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo: Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. WEA 2008: 208-219 |
42 | EE | Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for incremental topological ordering. ACM Transactions on Algorithms 4(4): (2008) |
41 | EE | Ulrich Meyer: On Dynamic Breadth-First Search in External-Memory CoRR abs/0802.2847: (2008) |
2007 | ||
40 | EE | Deepak Ajwani, Ulrich Meyer, Vitaly Osipov: Improved External Memory BFS Implementation. ALENEX 2007 |
2006 | ||
39 | EE | Ulrich Meyer, Norbert Zeh: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA 2006: 540-551 |
38 | EE | Deepak Ajwani, Roman Dementiev, Ulrich Meyer: A computational study of external-memory BFS algorithms. SODA 2006: 601-610 |
37 | EE | Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64 |
36 | EE | Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for online topological ordering CoRR abs/cs/0602073: (2006) |
35 | EE | Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for online topological ordering. Electronic Notes in Discrete Mathematics 25: 7-12 (2006) |
34 | EE | Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. J. Graph Algorithms Appl. 10(2): 219-236 (2006) |
33 | EE | Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal: A simple improved distributed algorithm for minimum CDS in unit disk graphs. TOSN 2(3): 444-453 (2006) |
2004 | ||
32 | EE | Lars Arge, Ulrich Meyer, Laura Toma: External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157 |
31 | EE | Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh: Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT 2004: 480-492 |
2003 | ||
30 | Ulrich Meyer, Peter Sanders, Jop F. Sibeyn: Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002] Springer 2003 | |
29 | Ulrich Meyer, Christoph Runte, Dieter Dirksen, T. Stamm, T. Fillies, Ulrich Joos, Hans-Peter Wiesmann: Image-based biomimetric approach to design and fabrication of tissue engineered bone. CARS 2003: 726-732 | |
28 | EE | Ulrich Meyer, Norbert Zeh: I/O-Efficient Undirected Shortest Paths. ESA 2003: 434-445 |
27 | EE | Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. ESA 2003: 703-714 |
26 | EE | Ulrich Meyer: Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48(1): 91-134 (2003) |
25 | EE | Ulrich Meyer, Peter Sanders: [Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1): 114-152 (2003) |
24 | EE | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003) |
2002 | ||
23 | EE | Irit Katriel, Ulrich Meyer: Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies 2002: 62-84 |
22 | EE | Kurt Mehlhorn, Ulrich Meyer: External-Memory Breadth-First Search with Sublinear I/O. ESA 2002: 723-735 |
21 | EE | Ulrich Meyer: Buckets Strike Back: Improved Parallel Shortest Paths. IPDPS 2002 |
20 | EE | Jop F. Sibeyn, James Abello, Ulrich Meyer: Heuristics for semi-external depth first search on directed graphs. SPAA 2002: 282-292 |
19 | EE | Ulrich Meyer, Jop F. Sibeyn: Oblivious Gossiping on Tori. J. Algorithms 42(1): 1-19 (2002) |
2001 | ||
18 | EE | Ulrich Meyer: Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. Euro-Par 2001: 343-351 |
17 | EE | Stefan Edelkamp, Ulrich Meyer: Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. KI/ÖGAI 2001: 169-184 |
16 | EE | Ulrich Meyer: Single-source shortest-paths on arbitrary directed graphs in linear average-case time. SODA 2001: 797-806 |
15 | EE | Ulrich Meyer: External memory BFS on undirected graphs with bounded degree. SODA 2001: 87-88 |
14 | EE | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh: On External-Memory Planar Depth First Search. WADS 2001: 471-482 |
13 | Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geometry Appl. 11(3): 305-337 (2001) | |
2000 | ||
12 | EE | Ulrich Meyer, Peter Sanders: Parallel Shortest Path for Arbitrary Graphs. Euro-Par 2000: 461-470 |
11 | EE | Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. ACM Journal of Experimental Algorithmics 5: 17 (2000) |
1999 | ||
10 | EE | Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. Algorithm Engineering 1999: 346-360 |
1998 | ||
9 | EE | Ulrich Meyer, Peter Sanders: Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA 1998: 393-404 |
8 | EE | Ulrich Meyer, Jop F. Sibeyn: Gossiping Large Packets on Full-Port Tori. Euro-Par 1998: 1040-1046 |
7 | EE | Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders: A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731 |
6 | EE | Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos: Randomized External-Memory Algorithms for Some Geometric Problems. Symposium on Computational Geometry 1998: 259-268 |
1997 | ||
5 | EE | Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn: Matrix Transpose on Meshes: Theory and Practice. IPPS 1997: 315-319 |
4 | Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn: Matrix Transpose on Meshes: Theory and Practice. Computers and Artificial Intelligence 16(2): (1997) | |
1995 | ||
3 | Ulrich Meyer, Jop F. Sibeyn: Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator. EUROSIM 1995: 285-290 | |
2 | Ulrich Meyer: Philosophische Grundlagen des Intentionalitätsbegriffs in der VKI und Möglichkeiten seiner Modellierung. KI 9(2): 14-19 (1995) | |
1991 | ||
1 | Ulrich Meyer, Thomas Schmidt: Konzeption und Implementierung eines Expertensystems im Bereich des städtebaulichen Lärmschutzes. Informatik für den Umweltschutz 1991: 596-605 |