Ulrich Meyer

ORCID

Publication Activity (10 Years)

Years Active: 1994-2024
Publications (10 Years): 38

Top Venues

Saarland University, Saarbrücken, Germany (PHD)

Education History

Saarland University, Saarbrücken, Germany

PHD

Publications

Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck
Insights into (k, ρ)-shortcutting algorithms. CoRR (2024)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX (2023)
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC (2023)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. J. Parallel Distributed Comput. 174 (2023)
Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis
Certifying Induced Subgraphs in Large Graphs. WALCOM (2023)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. CoRR (2022)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. IPDPS (2022)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX (2022)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. 10 (4) (2022)
Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis
Certifying Induced Subgraphs in Large Graphs. CoRR (2022)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. CoRR (2021)
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. CoRR (2021)
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran
An Experimental Study of External Memory Algorithms for Connected Components. SEA (2021)
Ulrich Meyer, Ziawasch Abedjan
Algorithms for Big Data. it Inf. Technol. 62 (3-4) (2020)
Ulrich Meyer, Manuel Penschuck
Large-scale graph generation: Recent results of the SPP 1736 - Part II. it Inf. Technol. 62 (3-4) (2020)
Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz
Recent Advances in Scalable Network Generation. CoRR (2020)
Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
Simulating Population Protocols in Sub-Constant Time per Interaction. ESA (2020)
Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
Simulating Population Protocols in Sub-Constant Time per Interaction. CoRR (2020)
Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
Communication-free massively distributed graph generation. J. Parallel Distributed Comput. 131 (2019)
Rolf Fagerberg, David Hammer, Ulrich Meyer
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ISAAC (2019)
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
Fragile Complexity of Comparison-Based Algorithms. ESA (2019)
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
Fragile Complexity of Comparison-Based Algorithms. CoRR (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA (2019)
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR (2019)
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA (2018)
Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, Alexander Schickedanz
An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. ICPP (2018)
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
Benchmark. ACM J. Exp. Algorithmics 23 (2018)
Kristian Kersting, Ulrich Meyer
From Big Data to Big Artificial Intelligence? - Algorithmic Challenges and Opportunities of Big Data. Künstliche Intell. 32 (1) (2018)
Mahyar Behdju, Ulrich Meyer
DFG Priority Programme SPP 1736: Algorithms for Big Data. Künstliche Intell. 32 (1) (2018)
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. CoRR (2018)
Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, Pawel Gawrychowski
Average-Case Behavior of k-Shortest Path Algorithms. COMPLEX NETWORKS (1) (2018)
Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens
GPU Multisplit. CoRR (2017)
Ulrich Meyer, Manuel Penschuck
Large-scale Graph Generation and Big Data: An Overview on Recent Results. Bull. EATCS 122 (2017)
Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens
GPU Multisplit: An Extended Study of a Parallel Algorithm. ACM Trans. Parallel Comput. 4 (1) (2017)
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. ALENEX (2017)
Ulrich Meyer, Manuel Penschuck
Generating Massive Scale-Free Networks under Resource Constraints. ALENEX (2016)
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. CoRR (2016)
Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens
GPU multisplit. PPOPP (2016)
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115 (12) (2015)
Annamária Kovács, Ulrich Meyer, Carmine Ventre
Mechanisms with Monitoring for Truthful RAM Allocation. WINE (2015)
Deepak Ajwani, Ulrich Meyer, David Veith
An I/O-efficient Distance Oracle for Evolving Real-World Graphs. ALENEX (2015)
Patricia Wollstadt, Ulrich Meyer, Michael Wibral
A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions. CoRR (2015)
Andreas Beckmann, Ulrich Meyer, David Veith
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. ESA (2013)
Ulrich Meyer, Volker Weichert
Algorithm Engineering für moderne Hardware. Inform. Spektrum 36 (2) (2013)
Michael Wibral, Patricia Wollstadt, Ulrich Meyer, Nicolae Pampu, Viola Priesemann, Raul Vicente
Revisiting Wiener's principle of causality - interaction-delay reconstruction using transfer entropy and multivariate analysis on delay-weighted graphs. EMBC (2012)
Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith
I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. ARCS Workshops (2012)
Andreas Beckmann, Jaroslaw Fedorowicz, Jörg Keller, Ulrich Meyer
A structural analysis of the A5/1 state transition graph GRAPHITE (2012)
Deepak Ajwani, Ulrich Meyer, David Veith
I/O-efficient Hierarchical Diameter Approximation. ESA (2012)
Ulrich Meyer, Norbert Zeh
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. ACM Trans. Algorithms 8 (3) (2012)
Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler
Energy-efficient sorting using solid state disks. Sustain. Comput. Informatics Syst. 1 (2) (2011)
Ulrich Meyer, Andrei Negoescu, Volker Weichert
New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. TAPAS (2011)
Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler
Energy-efficient sorting using solid state disks. Green Computing Conference (2010)
Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz
On Computational Models for Flash Memory Devices. SEA (2009)
Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
Online paging for flash memory devices. ISAAC (2009)
Deepak Ajwani, Ulrich Meyer
Design and Engineering of External Memory Traversal Algorithms for General Graphs. Algorithmics of Large and Complex Networks (2009)
Ulrich Meyer
Via Detours to I/O-Efficient Shortest Paths. Efficient Algorithms (2009)
Ulrich Meyer, Vitaly Osipov
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX (2009)
Deepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo
Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. WEA (2008)
Ulrich Meyer
On Dynamic Breadth-First Search in External-Memory CoRR (2008)
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
) algorithm for incremental topological ordering. ACM Trans. Algorithms 4 (4) (2008)
Ulrich Meyer
On Trade-Offs in External-Memory Diameter-Approximation. SWAT (2008)
Ulrich Meyer
On Dynamic Breadth-First Search in External-Memory. STACS (2008)
Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
Improved External Memory BFS Implementation. ALENEX (2007)
Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
Breadth First Search on Massive Graphs. The Shortest Path Problem (2006)
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
) algorithm for online topological ordering CoRR (2006)
Deepak Ajwani, Roman Dementiev, Ulrich Meyer
A computational study of external-memory BFS algorithms. SODA (2006)
Ulrich Meyer, Norbert Zeh
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA (2006)
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) (2006)
Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Networks 2 (3) (2006)
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
) algorithm for online topological ordering. Electron. Notes Discret. Math. 25 (2006)
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
) Algorithm for Online Topological Ordering. SWAT (2006)
Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
A simple improved distributed algorithm for minimum CDS in unit disk graphs. WiMob (2) (2005)
Lars Arge, Ulrich Meyer, Laura Toma
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP (2004)
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)
Ulrich Meyer, Norbert Zeh
I/O-Efficient Undirected Shortest Paths. ESA (2003)
Ulrich Meyer
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48 (1) (2003)
Ulrich Meyer, Peter Sanders
[Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms 49 (1) (2003)
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7 (2) (2003)
Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
Algorithms and Experiments for the Webgraph. ESA (2003)
Kurt Mehlhorn, Ulrich Meyer
External-Memory Breadth-First Search with Sublinear I/O. ESA (2002)
Jop F. Sibeyn, James Abello, Ulrich Meyer
Heuristics for semi-external depth first search on directed graphs. SPAA (2002)
Irit Katriel, Ulrich Meyer
Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies (2002)
Ulrich Meyer
Buckets Strike Back: Improved Parallel Shortest Paths. IPDPS (2002)
Ulrich Meyer, Jop F. Sibeyn
Oblivious Gossiping on Tori. J. Algorithms 42 (1) (2002)
Ulrich Meyer
Single-source shortest-paths on arbitrary directed graphs in linear average-case time. SODA (2001)
Stefan Edelkamp, Ulrich Meyer
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. KI/ÖGAI (2001)
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. Geom. Appl. 11 (3) (2001)
Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
On External-Memory Planar Depth First Search. WADS (2001)
Ulrich Meyer
External memory BFS on undirected graphs with bounded degree. SODA (2001)
Ulrich Meyer
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. Euro-Par (2001)
Ulrich Meyer, Peter Sanders
Parallel Shortest Path for Arbitrary Graphs. Euro-Par (2000)
Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
An Experimental Study of Priority Queues in External Memory. ACM J. Exp. Algorithmics 5 (2000)
Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
An Experimental Study of Priority Queues in External Memory. WAE (1999)
Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders
A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS (1998)
Ulrich Meyer, Jop F. Sibeyn
Gossiping Large Packets on Full-Port Tori. Euro-Par (1998)
Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
I/O-optimal computation of segment intersections. External Memory Algorithms (1998)
Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
Randomized External-Memory Algorithms for Some Geometric Problems. SCG (1998)
Ulrich Meyer, Peter Sanders
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA (1998)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Matrix Transpose on Meshes: Theory and Practice. Comput. Artif. Intell. 16 (2) (1997)
Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
Matrix Transpose on Meshes: Theory and Practice. IPPS (1997)

Ulrich Meyer.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ulrich Meyer