Ulrich Meyer

	2009
49		Ulrich Meyer, Vitaly Osipov: Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX 2009: 85-96
48		Deepak Ajwani, Ulrich Meyer: Design and Engineering of External Memory Traversal Algorithms for General Graphs. Algorithmics of Large and Complex Networks 2009: 1-33
47		Ulrich Meyer: Via Detours to I/O-Efficient Shortest Paths. Efficient Algorithms 2009: 219-232
46		Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz: On Computational Models for Flash Memory Devices. SEA 2009: 16-27
	2008
45		Ulrich Meyer: On Dynamic Breadth-First Search in External-Memory. STACS 2008: 551-560
44		Ulrich Meyer: On Trade-Offs in External-Memory Diameter-Approximation. SWAT 2008: 426-436
43		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		Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for incremental topological ordering. ACM Transactions on Algorithms 4(4): (2008)
41		Ulrich Meyer: On Dynamic Breadth-First Search in External-Memory CoRR abs/0802.2847: (2008)
	2007
40		Deepak Ajwani, Ulrich Meyer, Vitaly Osipov: Improved External Memory BFS Implementation. ALENEX 2007
	2006
39		Ulrich Meyer, Norbert Zeh: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA 2006: 540-551
38		Deepak Ajwani, Roman Dementiev, Ulrich Meyer: A computational study of external-memory BFS algorithms. SODA 2006: 601-610
37		Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64
36		Deepak Ajwani, Tobias Friedrich, Ulrich Meyer: An O(n2.75) algorithm for online topological ordering CoRR abs/cs/0602073: (2006)
35		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		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		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		Lars Arge, Ulrich Meyer, Laura Toma: External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157
31		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		Ulrich Meyer, Norbert Zeh: I/O-Efficient Undirected Shortest Paths. ESA 2003: 434-445
27		Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn: Algorithms and Experiments for the Webgraph. ESA 2003: 703-714
26		Ulrich Meyer: Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48(1): 91-134 (2003)
25		Ulrich Meyer, Peter Sanders: [Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1): 114-152 (2003)
24		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		Irit Katriel, Ulrich Meyer: Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies 2002: 62-84
22		Kurt Mehlhorn, Ulrich Meyer: External-Memory Breadth-First Search with Sublinear I/O. ESA 2002: 723-735
21		Ulrich Meyer: Buckets Strike Back: Improved Parallel Shortest Paths. IPDPS 2002
20		Jop F. Sibeyn, James Abello, Ulrich Meyer: Heuristics for semi-external depth first search on directed graphs. SPAA 2002: 282-292
19		Ulrich Meyer, Jop F. Sibeyn: Oblivious Gossiping on Tori. J. Algorithms 42(1): 1-19 (2002)
	2001
18		Ulrich Meyer: Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. Euro-Par 2001: 343-351
17		Stefan Edelkamp, Ulrich Meyer: Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. KI/ÖGAI 2001: 169-184
16		Ulrich Meyer: Single-source shortest-paths on arbitrary directed graphs in linear average-case time. SODA 2001: 797-806
15		Ulrich Meyer: External memory BFS on undirected graphs with bounded degree. SODA 2001: 87-88
14		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		Ulrich Meyer, Peter Sanders: Parallel Shortest Path for Arbitrary Graphs. Euro-Par 2000: 461-470
11		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		Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer: An Experimental Study of Priority Queues in External Memory. Algorithm Engineering 1999: 346-360
	1998
9		Ulrich Meyer, Peter Sanders: Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA 1998: 393-404
8		Ulrich Meyer, Jop F. Sibeyn: Gossiping Large Packets on Full-Port Tori. Euro-Par 1998: 1040-1046
7		Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders: A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731
6		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		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

Coauthor Index

1	James Abello	[20]
2	Deepak Ajwani	[35] [36] [37] [38] [40] [42] [43] [46] [48]
3	Lars Arge	[14] [24] [32]
4	Andreas Beckmann	[46]
5	Klaus Brengel	[10] [11]
6	Gerth Stølting Brodal	[31]
7	Andreas Crauser	[6] [7] [10] [11] [13]
8	Roman Dementiev	[38]
9	Dieter Dirksen	[29]
10	Debora Donato	[34]
11	Stefan Edelkamp	[17]
12	Rolf Fagerberg	[31]
13	Paolo Ferragina	[6] [10] [11] [13]
14	T. Fillies	[29]
15	Tobias Friedrich	[35] [36] [37] [42]
16	Stefan Funke	[33]
17	Riko Jacob	[46]
18	Ulrich Joos	[29]
19	Irit Katriel	[23]
20	Michael Kaufmann	[4] [5]
21	Alexander Kesselman (Alexander Keizelman)	[33]
22	Luigi Laura	[27] [34]
23	Stefano Leonardi	[27] [34]
24	Itay Malinger	[43]
25	Kurt Mehlhorn	[6] [7] [13] [22]
26	Stefano Millozzi	[27] [34]
27	Gabriel Moruz	[46]
28	Vitaly Osipov	[40] [49]
29	Edgar A. Ramos	[6] [13]
30	Christoph Runte	[29]
31	Peter Sanders	[7] [9] [12] [25] [30]
32	Thomas Schmidt	[1]
33	Michael Segal	[33]
34	Jop F. Sibeyn	[3] [4] [5] [8] [19] [20] [27] [30] [34]
35	T. Stamm	[29]
36	Sivan Toledo	[43]
37	Laura Toma	[14] [24] [32]
38	Hans-Peter Wiesmann	[29]
39	Norbert Zeh	[14] [24] [28] [31] [39]

Colors in the list of coauthors