Ulrich Meyer

According to our database, Ulrich Meyer authored at least 91 papers between 1994 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Insights into (k, ρ)-shortcutting algorithms.

Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck

CoRR, 2024

2023

Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees.

Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran

J. Parallel Distributed Comput., April, 2023

Certifying Induced Subgraphs in Large Graphs.

Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis

Proceedings of the WALCOM: Algorithms and Computation, 2023

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).

Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment.

Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022

Efficiently generating geometric inhomogeneous and hyperbolic random graphs.

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand

Netw. Sci., December, 2022

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence.

Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Generating Synthetic Graph Data from Random Network Models.

Ulrich Meyer, Manuel Penschuck

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Recent Advances in Scalable Network Generation1.

Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz

Proceedings of the Massive Graph Analytics, 2022

2021

An Experimental Study of External Memory Algorithms for Connected Components.

Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran

Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020

Large-scale graph generation: Recent results of the SPP 1736 - Part II.

Ulrich Meyer, Manuel Penschuck

it Inf. Technol., 2020

Algorithms for Big Data.

Ulrich Meyer, Ziawasch Abedjan

it Inf. Technol., 2020

Recent Advances in Scalable Network Generation.

Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz

CoRR, 2020

Simulating Population Protocols in Sub-Constant Time per Interaction.

Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

Communication-free massively distributed graph generation.

Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz

J. Parallel Distributed Comput., 2019

Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051).

Gerth Stølting Brodal, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick

Dagstuhl Reports, 2019

On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?

Rolf Fagerberg, David Hammer, Ulrich Meyer

Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

Fragile Complexity of Comparison-Based Algorithms.

Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

From Big Data to Big Artificial Intelligence? - Algorithmic Challenges and Opportunities of Big Data.

Kristian Kersting, Ulrich Meyer

Künstliche Intell., 2018

DFG Priority Programme SPP 1736: Algorithms for Big Data.

Mahyar Behdju, Ulrich Meyer

Künstliche Intell., 2018

I/O-Efficient Generation of Massive Graphs Following the <i>LFR</i> Benchmark.

Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner

ACM J. Exp. Algorithmics, 2018

An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores.

Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, Alexander Schickedanz

Proceedings of the 47th International Conference on Parallel Processing, 2018

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.

Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

Average-Case Behavior of k-Shortest Path Algorithms.

Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, Pawel Gawrychowski

Proceedings of the Complex Networks and Their Applications VII, 2018

2017

GPU Multisplit: An Extended Study of a Parallel Algorithm.

Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens

ACM Trans. Parallel Comput., 2017

Large-scale Graph Generation and Big Data: An Overview on Recent Results.

Ulrich Meyer, Manuel Penschuck

Bull. EATCS, 2017

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.

Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner

Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016

I/O-Model.

Norbert Zeh, Ulrich Meyer

Encyclopedia of Algorithms, 2016

List Ranking.

Riko Jacob, Ulrich Meyer, Laura Toma

Encyclopedia of Algorithms, 2016

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101).

Alejandro López-Ortiz, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick

Dagstuhl Reports, 2016

GPU multisplit.

Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens

Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2016

Generating Massive Scale-Free Networks under Resource Constraints.

Ulrich Meyer, Manuel Penschuck

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

The optimal structure of algorithms for α-paging.

Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu

Inf. Process. Lett., 2015

A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions.

Patricia Wollstadt, Ulrich Meyer, Michael Wibral

CoRR, 2015

Mechanisms with Monitoring for Truthful RAM Allocation.

Annamária Kovács, Ulrich Meyer, Carmine Ventre

Proceedings of the Web and Internet Economics - 11th International Conference, 2015

An I/O-efficient Distance Oracle for Evolving Real-World Graphs.

Deepak Ajwani, Ulrich Meyer, David Veith

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461).

Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, Ilya Safro

Dagstuhl Reports, 2014

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091).

Alejandro López-Ortiz, Ulrich Carsten Meyer, Robert Sedgewick

Dagstuhl Reports, 2014

2013

Algorithm Engineering für moderne Hardware.

Ulrich Meyer, Volker Weichert

Inform. Spektrum, 2013

An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering.

Andreas Beckmann, Ulrich Meyer, David Veith

Proceedings of the Algorithms - ESA 2013, 2013

2012

I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths.

Ulrich Meyer, Norbert Zeh

ACM Trans. Algorithms, 2012

A structural analysis of the A5/1 state transition graph

Andreas Beckmann, Jaroslaw Fedorowicz, Jörg Keller, Ulrich Meyer

Proceedings of the Proceedings First Workshop on GRAPH Inspection and Traversal Engineering, 2012

I/O-efficient Hierarchical Diameter Approximation.

Deepak Ajwani, Ulrich Meyer, David Veith

Proceedings of the Algorithms - ESA 2012, 2012

Revisiting Wiener's principle of causality - interaction-delay reconstruction using transfer entropy and multivariate analysis on delay-weighted graphs.

Michael Wibral, Patricia Wollstadt, Ulrich Meyer, Nicolae Pampu, Viola Priesemann, Raul Vicente

Proceedings of the Annual International Conference of the IEEE Engineering in Medicine and Biology Society, 2012

I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study.

Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith

Proceedings of the ARCS 2012 Workshops, 28. Februar - 2. März 2012, München, Germany, 2012

2011

Energy-efficient sorting using solid state disks.

Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler

Sustain. Comput. Informatics Syst., 2011

New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches.

Ulrich Meyer, Andrei Negoescu, Volker Weichert

Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2009

On Computational Models for Flash Memory Devices.

Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz

Proceedings of the Experimental Algorithms, 8th International Symposium, 2009

Online paging for flash memory devices.

Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Design and Engineering of External Memory Traversal Algorithms for General Graphs.

Deepak Ajwani, Ulrich Meyer

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Via Detours to I/O-Efficient Shortest Paths.

Ulrich Meyer

Proceedings of the Efficient Algorithms, 2009

Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm.

Ulrich Meyer, Vitaly Osipov

Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, 2009

2008

An <i>O</i>(<i>n</i>^2.75) algorithm for incremental topological ordering.

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer

ACM Trans. Algorithms, 2008

Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design.

Deepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo

Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

On Trade-Offs in External-Memory Diameter-Approximation.

Ulrich Meyer

Proceedings of the Algorithm Theory, 2008

On Dynamic Breadth-First Search in External-Memory.

Ulrich Meyer

Proceedings of the STACS 2008, 2008

2007

Improved External Memory BFS Implementation.

Deepak Ajwani, Ulrich Meyer, Vitaly Osipov

Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006

A simple improved distributed algorithm for minimum CDS in unit disk graphs.

Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal

ACM Trans. Sens. Networks, 2006

Algorithms and Experiments for the Webgraph.

Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn

J. Graph Algorithms Appl., 2006

An O(n^2.75) algorithm for online topological ordering.

Deepak Ajwani, Tobias Friedrich, Ulrich Meyer

Electron. Notes Discret. Math., 2006

A computational study of external-memory BFS algorithms.

Deepak Ajwani, Roman Dementiev, Ulrich Meyer

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths.

Ulrich Meyer, Norbert Zeh

Proceedings of the Algorithms, 2006

Breadth First Search on Massive Graphs.

Deepak Ajwani, Ulrich Meyer, Vitaly Osipov

Proceedings of the Shortest Path Problem, 2006

2004

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths.

Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh

Proceedings of the Algorithm Theory, 2004

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs.

Lars Arge, Ulrich Meyer, Laura Toma

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

On External-Memory Planar Depth First Search.

Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh

J. Graph Algorithms Appl., 2003

[Delta]-stepping: a parallelizable shortest path algorithm.

Ulrich Meyer, Peter Sanders

J. Algorithms, 2003

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds.

Ulrich Meyer

J. Algorithms, 2003

I/O-Efficient Undirected Shortest Paths.

Ulrich Meyer, Norbert Zeh

Proceedings of the Algorithms, 2003

Algorithms and Experiments for the Webgraph.

Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn

Proceedings of the Algorithms, 2003

2002

Oblivious Gossiping on Tori.

Ulrich Meyer, Jop F. Sibeyn

J. Algorithms, 2002

Heuristics for semi-external depth first search on directed graphs.

Jop F. Sibeyn, James Abello, Ulrich Meyer

Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2002

Buckets Strike Back: Improved Parallel Shortest Paths.

Ulrich Meyer

Proceedings of the 16th International Parallel and Distributed Processing Symposium (IPDPS 2002), 2002

External-Memory Breadth-First Search with Sublinear I/O.

Kurt Mehlhorn, Ulrich Meyer

Proceedings of the Algorithms, 2002

Elementary Graph Algorithms in External Memory.

Irit Katriel, Ulrich Meyer

Proceedings of the Algorithms for Memory Hierarchies, 2002

Design and analysis of sequential and parallel single-source shortest-paths algorithms.

Ulrich Meyer

PhD thesis, 2002

2001

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems.

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Int. J. Comput. Geom. Appl., 2001

Single-source shortest-paths on arbitrary directed graphs in linear average-case time.

Ulrich Meyer

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

External memory BFS on undirected graphs with bounded degree.

Ulrich Meyer

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search.

Stefan Edelkamp, Ulrich Meyer

Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs.

Ulrich Meyer

Proceedings of the Euro-Par 2001: Parallel Processing, 2001

2000

An Experimental Study of Priority Queues in External Memory.

Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer

ACM J. Exp. Algorithmics, 2000

Parallel Shortest Path for Arbitrary Graphs.

Ulrich Meyer, Peter Sanders

Proceedings of the Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29, 2000

1998

A Parallelization of Dijkstra's Shortest Path Algorithm.

Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Gossiping Large Packets on Full-Port Tori.

Ulrich Meyer, Jop F. Sibeyn

Proceedings of the Euro-Par '98 Parallel Processing, 1998

Delta-Stepping: A Parallel Single Source Shortest Path Algorithm.

Ulrich Meyer, Peter Sanders

Proceedings of the Algorithms, 1998

I/O-optimal computation of segment intersections.

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Proceedings of the External Memory Algorithms, 1998

Randomized External-Memory Algorithms for Some Geometric Problems.

Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Matrix Transpose on Meshes: Theory and Practice.

Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn

Comput. Artif. Intell., 1997

1995

Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator.

Ulrich Meyer, Jop F. Sibeyn

Proceedings of the EUROSIM'96, 1995

1994

Towards practical permutation routing on meshes.

Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994