×
Author ID: meyer.ulrich.1 Recent zbMATH articles by "Meyer, Ulrich"
Published as: Meyer, Ulrich; Meyer, U.

Publications by Year

Citations contained in zbMATH Open

39 Publications have been cited 123 times in 77 Documents Cited by Year
Algorithms for memory hierarchies. Advanced lectures. Zbl 1018.68761
13
2003
External-memory breadth-first search with sublinear I/O. Zbl 1019.68595
Mehlhorn, Kurt; Meyer, Ulrich
9
2002
Randomized external-memory algorithms for line segment intersection and other geometric problems. Zbl 1074.68669
Crauser, A.; Ferragina, P.; Mehlhorn, K.; Meyer, U.; Ramos, E. A.
8
2001
I/O-efficient undirected shortest paths. Zbl 1266.68239
Meyer, Ulrich; Zeh, Norbert
7
2003
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. Zbl 1095.68572
Brodal, Gerth Stølting; Fagerberg, Rolf; Meyer, Ulrich; Zeh, Norbert
7
2004
A parallelization of Dijkstra’s shortest path algorithm. Zbl 0912.05056
Crauser, A.; Mehlhorn, K.; Meyer, U.; Sanders, P.
6
1998
An \({\mathcal O}(n^{2.75})\) algorithm for online topological ordering. Zbl 1142.05364
Ajwani, Deepak; Friedrich, Tobias; Meyer, Ulrich
5
2006
External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs. Zbl 1098.68630
Arge, Lars; Meyer, Ulrich; Toma, Laura
5
2004
External memory BFS on undirected graphs with bounded degree. Zbl 1113.68041
Meyer, Ulrich
4
2001
Single-source shortest-paths on arbitrary directed graphs in linear average-case time. Zbl 0988.05088
Meyer, Ulrich
4
2001
On external-memory planar depth first search. Zbl 1027.05089
Arge, Lars; Meyer, Ulrich; Toma, Laura; Zeh, Norbert
4
2003
Algorithms and experiments for the Webgraph. Zbl 1161.68659
Donato, Debora; Laura, Luigi; Leonardi, Stefano; Meyer, Ulrich; Millozzi, Stefano; Sibeyn, Jop F.
4
2006
I/O-efficient undirected shortest paths with unbounded edge lengths. Zbl 1131.05316
Meyer, Ulrich; Zeh, Norbert
3
2006
\(\Delta\)-stepping: A parallelizable shortest path algorithm. Zbl 1091.68560
Meyer, U.; Sanders, P.
3
2003
I/O-efficient generation of massive graphs following the LFR benchmark. Zbl 1430.68214
Hamann, Michael; Meyer, Ulrich; Penschuck, Manuel; Wagner, Dorothea
3
2017
The nature of time. Zbl 1279.03005
Meyer, Ulrich
3
2013
A computational study of external-memory BFS algorithms. Zbl 1192.68937
Ajwani, Deepak; Dementiev, Roman; Meyer, Ulrich
3
2006
\(\Delta\)-stepping: A parallel single source shortest path algorithm. Zbl 0932.68136
Meyer, Ulrich; Sanders, Peter
2
1998
‘Now’ and ‘then’ in tense logic. Zbl 1175.03006
Meyer, Ulrich
2
2009
Times in tense logic. Zbl 1197.03016
Meyer, Ulrich
2
2009
Average-case complexity of single-source shortest-paths algorithms: Lower and upper bounds. Zbl 1079.68108
Meyer, Ulrich
2
2003
Mechanisms with monitoring for truthful RAM allocation. Zbl 1403.68024
Kovács, Annamária; Meyer, Ulrich; Ventre, Carmine
2
2015
Is science first-order? Zbl 1023.03509
Meyer, Ulrich
2
2002
Elementary graph algorithms in external memory. Zbl 1024.68759
Katriel, Irit; Meyer, Ulrich
2
2003
Generating massive scale-free networks under resource constraints. Zbl 1430.68229
Meyer, Ulrich; Penschuck, Manuel
2
2016
Simulating population protocols in sub-constant time per interaction. Zbl 07651155
Berenbrink, Petra; Hammer, David; Kaaser, Dominik; Meyer, Ulrich; Penschuck, Manuel; Tran, Hung
2
2020
An \(O(n^{2.75})\) algorithm for incremental topological ordering. Zbl 1446.68109
Ajwani, Deepak; Friedrich, Tobias; Meyer, Ulrich
2
2008
New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches. Zbl 1325.68111
Meyer, Ulrich; Negoescu, Andrei; Weichert, Volker
1
2011
Online paging for flash memory devices. Zbl 1272.68469
Kovács, Annamária; Meyer, Ulrich; Moruz, Gabriel; Negoescu, Andrei
1
2009
Design and engineering of external memory traversal algorithms for general graphs. Zbl 1248.68364
Ajwani, Deepak; Meyer, Ulrich
1
2009
Theory and practice of time-space trade-offs in memory limited search. Zbl 1007.68582
Edelkamp, Stefan; Meyer, Ulrich
1
2001
Worlds and times. Zbl 1107.03014
Meyer, Ulrich
1
2006
How to apply mathematics. Zbl 1142.00302
Meyer, Ulrich
1
2004
An experimental study of priority queues in external memory. Zbl 1071.68512
Brengel, Klaus; Crauser, Andreas; Ferragina, Paolo; Meyer, Ulrich
1
2000
On trade-offs in external-memory diameter-approximation. Zbl 1155.68477
Meyer, Ulrich
1
2008
Design and implementation of a practical I/O-efficient shortest paths algorithm. Zbl 1430.68228
Meyer, Ulrich; Osipov, Vitaly
1
2009
Fragile complexity of comparison-based algorithms. Zbl 07525439
Afshani, Peyman; Fagerberg, Rolf; Hammer, David; Jacob, Riko; Kostitsyna, Irina; Meyer, Ulrich; Penschuck, Manuel; Sitchinava, Nodari
1
2019
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Zbl 07525458
Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Meyer, Ulrich; Penschuck, Manuel; Weyand, Christopher
1
2019
On dynamic breadth-first search in external-memory. Zbl 1259.68162
Meyer, Ulrich
1
2008
Simulating population protocols in sub-constant time per interaction. Zbl 07651155
Berenbrink, Petra; Hammer, David; Kaaser, Dominik; Meyer, Ulrich; Penschuck, Manuel; Tran, Hung
2
2020
Fragile complexity of comparison-based algorithms. Zbl 07525439
Afshani, Peyman; Fagerberg, Rolf; Hammer, David; Jacob, Riko; Kostitsyna, Irina; Meyer, Ulrich; Penschuck, Manuel; Sitchinava, Nodari
1
2019
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Zbl 07525458
Bläsius, Thomas; Friedrich, Tobias; Katzmann, Maximilian; Meyer, Ulrich; Penschuck, Manuel; Weyand, Christopher
1
2019
I/O-efficient generation of massive graphs following the LFR benchmark. Zbl 1430.68214
Hamann, Michael; Meyer, Ulrich; Penschuck, Manuel; Wagner, Dorothea
3
2017
Generating massive scale-free networks under resource constraints. Zbl 1430.68229
Meyer, Ulrich; Penschuck, Manuel
2
2016
Mechanisms with monitoring for truthful RAM allocation. Zbl 1403.68024
Kovács, Annamária; Meyer, Ulrich; Ventre, Carmine
2
2015
The nature of time. Zbl 1279.03005
Meyer, Ulrich
3
2013
New bounds for old algorithms: on the average-case behavior of classic single-source shortest-paths approaches. Zbl 1325.68111
Meyer, Ulrich; Negoescu, Andrei; Weichert, Volker
1
2011
‘Now’ and ‘then’ in tense logic. Zbl 1175.03006
Meyer, Ulrich
2
2009
Times in tense logic. Zbl 1197.03016
Meyer, Ulrich
2
2009
Online paging for flash memory devices. Zbl 1272.68469
Kovács, Annamária; Meyer, Ulrich; Moruz, Gabriel; Negoescu, Andrei
1
2009
Design and engineering of external memory traversal algorithms for general graphs. Zbl 1248.68364
Ajwani, Deepak; Meyer, Ulrich
1
2009
Design and implementation of a practical I/O-efficient shortest paths algorithm. Zbl 1430.68228
Meyer, Ulrich; Osipov, Vitaly
1
2009
An \(O(n^{2.75})\) algorithm for incremental topological ordering. Zbl 1446.68109
Ajwani, Deepak; Friedrich, Tobias; Meyer, Ulrich
2
2008
On trade-offs in external-memory diameter-approximation. Zbl 1155.68477
Meyer, Ulrich
1
2008
On dynamic breadth-first search in external-memory. Zbl 1259.68162
Meyer, Ulrich
1
2008
An \({\mathcal O}(n^{2.75})\) algorithm for online topological ordering. Zbl 1142.05364
Ajwani, Deepak; Friedrich, Tobias; Meyer, Ulrich
5
2006
Algorithms and experiments for the Webgraph. Zbl 1161.68659
Donato, Debora; Laura, Luigi; Leonardi, Stefano; Meyer, Ulrich; Millozzi, Stefano; Sibeyn, Jop F.
4
2006
I/O-efficient undirected shortest paths with unbounded edge lengths. Zbl 1131.05316
Meyer, Ulrich; Zeh, Norbert
3
2006
A computational study of external-memory BFS algorithms. Zbl 1192.68937
Ajwani, Deepak; Dementiev, Roman; Meyer, Ulrich
3
2006
Worlds and times. Zbl 1107.03014
Meyer, Ulrich
1
2006
Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths. Zbl 1095.68572
Brodal, Gerth Stølting; Fagerberg, Rolf; Meyer, Ulrich; Zeh, Norbert
7
2004
External memory algorithms for diameter and all-pairs shortest-paths on sparse graphs. Zbl 1098.68630
Arge, Lars; Meyer, Ulrich; Toma, Laura
5
2004
How to apply mathematics. Zbl 1142.00302
Meyer, Ulrich
1
2004
Algorithms for memory hierarchies. Advanced lectures. Zbl 1018.68761
13
2003
I/O-efficient undirected shortest paths. Zbl 1266.68239
Meyer, Ulrich; Zeh, Norbert
7
2003
On external-memory planar depth first search. Zbl 1027.05089
Arge, Lars; Meyer, Ulrich; Toma, Laura; Zeh, Norbert
4
2003
\(\Delta\)-stepping: A parallelizable shortest path algorithm. Zbl 1091.68560
Meyer, U.; Sanders, P.
3
2003
Average-case complexity of single-source shortest-paths algorithms: Lower and upper bounds. Zbl 1079.68108
Meyer, Ulrich
2
2003
Elementary graph algorithms in external memory. Zbl 1024.68759
Katriel, Irit; Meyer, Ulrich
2
2003
External-memory breadth-first search with sublinear I/O. Zbl 1019.68595
Mehlhorn, Kurt; Meyer, Ulrich
9
2002
Is science first-order? Zbl 1023.03509
Meyer, Ulrich
2
2002
Randomized external-memory algorithms for line segment intersection and other geometric problems. Zbl 1074.68669
Crauser, A.; Ferragina, P.; Mehlhorn, K.; Meyer, U.; Ramos, E. A.
8
2001
External memory BFS on undirected graphs with bounded degree. Zbl 1113.68041
Meyer, Ulrich
4
2001
Single-source shortest-paths on arbitrary directed graphs in linear average-case time. Zbl 0988.05088
Meyer, Ulrich
4
2001
Theory and practice of time-space trade-offs in memory limited search. Zbl 1007.68582
Edelkamp, Stefan; Meyer, Ulrich
1
2001
An experimental study of priority queues in external memory. Zbl 1071.68512
Brengel, Klaus; Crauser, Andreas; Ferragina, Paolo; Meyer, Ulrich
1
2000
A parallelization of Dijkstra’s shortest path algorithm. Zbl 0912.05056
Crauser, A.; Mehlhorn, K.; Meyer, U.; Sanders, P.
6
1998
\(\Delta\)-stepping: A parallel single source shortest path algorithm. Zbl 0932.68136
Meyer, Ulrich; Sanders, Peter
2
1998
all top 5

Cited by 145 Authors

10 Meyer, Ulrich
4 Ajwani, Deepak
4 Arge, Lars
3 Edelkamp, Stefan
3 Friedrich, Tobias
3 Jacob, Riko
3 Penschuck, Manuel
3 Sanders, Peter
3 Wagner, Dorothea
2 Afshani, Peyman
2 Dębski, Roman
2 Hamann, Michael
2 Her, Jun-Ho
2 Kovács, Annamária
2 Madduri, Kamesh
2 Maheshwari, Anil
2 Ramakrishna, R. S.
2 Schweikardt, Nicole
2 Šimeček, Pavel
2 Stølting Brodal, Gerth
2 Subramani, Krishnan
2 Tsakalidis, Konstantinos
2 Vahrenhold, Jan
2 Ventre, Carmine
2 Zeh, Norbert
1 Agarwal, Pankaj Kumar
1 Aljazzar, Husain
1 Arslan, Hilal Karakus
1 Baek, Sun Geol
1 Barnat, Jiří
1 Becker, Ruben
1 Bender, Michael A.
1 Bhushan, Alka
1 Bošnački, Dragan
1 Brim, Luboš
1 Carstens, Corrie Jacobien
1 Chan, Timothy Moon-Yew
1 Chao, Kunmao
1 Chen, Eric Y.
1 Chen, Shuyu
1 Cresswell, Maxwell John
1 Czumaj, Artur
1 Danner, Andrew
1 de Berg, Mark Theodoor
1 Delling, Daniel
1 Demaine, Erik D.
1 Dementiev, Roman
1 Derungs, Jörg
1 Doty, David
1 Eom, Young Ik
1 Eppstein, David Arthur
1 Erickson, Jeff
1 Fagerberg, Rolf
1 Fehnker, Ansgar
1 Ferraioli, Diodato
1 Fletcher, Samuel Craig
1 Forster, Sebastian
1 Franciosa, Paulo G.
1 Gan, Junhao
1 Geissmann, Barbara
1 Gianinazzi, Lukas
1 Gieseke, Fabian
1 Gleinig, Niels
1 Gołosz, Jerzy
1 Graziani, Ernesto
1 Grohe, Martin
1 Gudmundsson, Joachim
1 Hammer, David
1 Haverkort, Herman J.
1 Hernich, André
1 Hoefler, Torsten
1 Iacono, John
1 Karrenbauer, Andreas
1 Kelly, Paul H. J.
1 Ketsman, Bas
1 Koch, Christoph T.
1 Komjáthy, Júlia
1 Kostitsyna, Irina
1 Kouroupas, Georgios
1 Koutris, Paraschos
1 Kuszmaul, Bradley C.
1 Lapinskas, John
1 Larsen, Kasper Green
1 Lee, Sungkil
1 Lengler, Johannes
1 Lenzen, Christoph
1 Liggins, David
1 Lincoln, Andrea
1 Lingas, Andrzej
1 Liu, Hsiao-Fei
1 Liu, Quanquan C.
1 Lynch, Jayson
1 Manguoglu, Murat
1 Mao, Guoyong
1 Markakis, Evangelos
1 Mishra, Vinod Kumar
1 Moruz, Gabriel
1 Navarro, Gonzalo
1 Negoescu, Andrei
1 Orilia, Francesco
...and 45 more Authors

Citations by Year