default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDUlrich Meyer 0001
Ulrich Carsten Meyer
Person information
- affiliation: Goethe University of Frankfurt, Germany
Other persons with the same name
- Ulrich Meyer — disambiguation page
- Ulrich Meyer 0002
![[0000-0002-4040-6203]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-4040-6203")
— Colgate University, Hamilton, USA - Ulrich Meyer 0003 — Technical University Munich, Germany
- Ulrich Meyer 0004 — Universität Kaiserslautern, Germany
- Ulrich Meyer 0005 — University of Bern, Astronomical Institute, Switzerland
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j26]Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. J. Graph Algorithms Appl. 28(3): 49-68 (2024)- [c63]Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck:
Insights into (k, ρ)-Shortcutting Algorithms. ESA 2024: 84:1-84:17 - [i20]Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck:
Insights into (k, ρ)-shortcutting algorithms. CoRR abs/2402.07771 (2024) - [i19]Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Uniform Sampling of Negative Edge Weights in Shortest Path Networks. CoRR abs/2410.22717 (2024) - 2023
- [j25]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: 118-129 (2023) - [c62]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX 2023: 65-76 - [c61]Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck:
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC 2023: 37:1-37:7 - [c60]Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. WALCOM 2023: 229-241 - 2022
- [j24]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): 361-380 (2022) - [c59]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX 2022: 27-40 - [c58]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. IPDPS 2022: 269-279 - [p2]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation1. Massive Graph Analytics 2022: 333-376 - [p1]Ulrich Meyer, Manuel Penschuck:
Generating Synthetic Graph Data from Random Network Models. Algorithms for Big Data 2022: 21-38 - [e5]Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck:
Algorithms for Big Data - DFG Priority Program 1736. Lecture Notes in Computer Science 13201, Springer 2022, ISBN 978-3-031-21533-9 [contents] - [i18]Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis:
Certifying Induced Subgraphs in Large Graphs. CoRR abs/2210.13057 (2022) - [i17]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. CoRR abs/2211.06884 (2022) - 2021
- [c57]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: 23:1-23:23 - [i16]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald:
Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. CoRR abs/2110.15015 (2021) - [i15]Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. CoRR abs/2111.03005 (2021) - 2020
- [j23]Ulrich Meyer, Ziawasch Abedjan:
Algorithms for Big Data. it Inf. Technol. 62(3-4): 117-118 (2020) - [j22]Ulrich Meyer, Manuel Penschuck:
Large-scale graph generation: Recent results of the SPP 1736 - Part II. it Inf. Technol. 62(3-4): 135-144 (2020) - [c56]Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Simulating Population Protocols in Sub-Constant Time per Interaction. ESA 2020: 16:1-16:22 - [i14]Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz:
Recent Advances in Scalable Network Generation. CoRR abs/2003.00736 (2020) - [i13]Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran:
Simulating Population Protocols in Sub-Constant Time per Interaction. CoRR abs/2005.03584 (2020)
2010 – 2019
- 2019
- [j21]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: 200-217 (2019) - [c55]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. ESA 2019: 2:1-2:19 - [c54]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA 2019: 21:1-21:14 - [c53]Rolf Fagerberg, David Hammer, Ulrich Meyer:
On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ISAAC 2019: 35:1-35:16 - [i12]Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava:
Fragile Complexity of Comparison-Based Algorithms. CoRR abs/1901.02857 (2019) - [i11]Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand:
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR abs/1905.06706 (2019) - [i10]Gerth Stølting Brodal, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick:
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). Dagstuhl Reports 9(1): 104-124 (2019) - 2018
- [j20]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner:
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. ACM J. Exp. Algorithmics 23 (2018) - [j19]Kristian Kersting, Ulrich Meyer:
From Big Data to Big Artificial Intelligence? - Algorithmic Challenges and Opportunities of Big Data. Künstliche Intell. 32(1): 3-8 (2018) - [j18]Mahyar Behdju, Ulrich Meyer:
DFG Priority Programme SPP 1736: Algorithms for Big Data. Künstliche Intell. 32(1): 77-84 (2018) - [c52]Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, Pawel Gawrychowski:
Average-Case Behavior of k-Shortest Path Algorithms. COMPLEX NETWORKS (1) 2018: 28-40 - [c51]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: 11:1-11:15 - [c50]Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, Alexander Schickedanz:
An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. ICPP 2018: 78:1-78:12 - [i9]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 abs/1804.08487 (2018) - 2017
- [j17]Ulrich Meyer, Manuel Penschuck:
Large-scale Graph Generation and Big Data: An Overview on Recent Results. Bull. EATCS 122 (2017) - [j16]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): 2:1-2:44 (2017) - [c49]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. ALENEX 2017: 58-72 - [i8]Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens:
GPU Multisplit. CoRR abs/1701.01189 (2017) - 2016
- [c48]Ulrich Meyer, Manuel Penschuck:
Generating Massive Scale-Free Networks under Resource Constraints. ALENEX 2016: 39-52 - [c47]Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens:
GPU multisplit. PPoPP 2016: 12:1-12:13 - [r2]Norbert Zeh, Ulrich Meyer:
I/O-Model. Encyclopedia of Algorithms 2016: 943-947 - [r1]Riko Jacob, Ulrich Meyer, Laura Toma:
List Ranking. Encyclopedia of Algorithms 2016: 1117-1121 - [i7]Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner:
I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. CoRR abs/1604.08738 (2016) - [i6]Alejandro López-Ortiz, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick:
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). Dagstuhl Reports 6(3): 1-23 (2016) - 2015
- [j15]Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
The optimal structure of algorithms for α-paging. Inf. Process. Lett. 115(12): 932-938 (2015) - [c46]Deepak Ajwani, Ulrich Meyer, David Veith:
An I/O-efficient Distance Oracle for Evolving Real-World Graphs. ALENEX 2015: 159-172 - [c45]Annamária Kovács, Ulrich Meyer, Carmine Ventre:
Mechanisms with Monitoring for Truthful RAM Allocation. WINE 2015: 398-412 - [i5]Patricia Wollstadt, Ulrich Meyer, Michael Wibral:
A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions. CoRR abs/1504.00156 (2015) - 2014
- [e4]Catherine C. McGeoch, Ulrich Meyer:
2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014. SIAM 2014, ISBN 978-1-61197-319-8 [contents] - [i4]Alejandro López-Ortiz, Ulrich Carsten Meyer, Robert Sedgewick:
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091). Dagstuhl Reports 4(2): 129-149 (2014) - [i3]Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, Ilya Safro:
High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). Dagstuhl Reports 4(11): 40-58 (2014) - 2013
- [j14]Ulrich Meyer, Volker Weichert:
Algorithm Engineering für moderne Hardware. Inform. Spektrum 36(2): 153-161 (2013) - [c44]Andreas Beckmann, Ulrich Meyer, David Veith:
An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. ESA 2013: 121-132 - 2012
- [j13]Ulrich Meyer, Norbert Zeh:
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. ACM Trans. Algorithms 8(3): 22:1-22:28 (2012) - [c43]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: 493-504 - [c42]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: 3676-3679 - [c41]Deepak Ajwani, Ulrich Meyer, David Veith:
I/O-efficient Hierarchical Diameter Approximation. ESA 2012: 72-83 - [c40]Andreas Beckmann, Jaroslaw Fedorowicz, Jörg Keller, Ulrich Meyer:
A structural analysis of the A5/1 state transition graph. GRAPHITE 2012: 5-19 - 2011
- [j12]Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler:
Energy-efficient sorting using solid state disks. Sustain. Comput. Informatics Syst. 1(2): 151-163 (2011) - [c39]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: 217-228 - 2010
- [c38]Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler:
Energy-efficient sorting using solid state disks. Green Computing Conference 2010: 191-202 - [e3]Mark de Berg, Ulrich Meyer:
Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I. Lecture Notes in Computer Science 6346, Springer 2010, ISBN 978-3-642-15774-5 [contents] - [e2]Mark de Berg, Ulrich Meyer:
Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II. Lecture Notes in Computer Science 6347, Springer 2010, ISBN 978-3-642-15780-6 [contents]
2000 – 2009
- 2009
- [c37]Ulrich Meyer, Vitaly Osipov:
Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX 2009: 85-96 - [c36]Ulrich Meyer:
Via Detours to I/O-Efficient Shortest Paths. Efficient Algorithms 2009: 219-232 - [c35]Deepak Ajwani, Ulrich Meyer:
Design and Engineering of External Memory Traversal Algorithms for General Graphs. Algorithmics of Large and Complex Networks 2009: 1-33 - [c34]Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu:
Online paging for flash memory devices. ISAAC 2009: 352-361 - [c33]Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz:
On Computational Models for Flash Memory Devices. SEA 2009: 16-27 - 2008
- [j11]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for incremental topological ordering. ACM Trans. Algorithms 4(4): 39:1-39:14 (2008) - [c32]Ulrich Meyer:
On Dynamic Breadth-First Search in External-Memory. STACS 2008: 551-560 - [c31]Ulrich Meyer:
On Trade-Offs in External-Memory Diameter-Approximation. SWAT 2008: 426-436 - [c30]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 - [i2]Ulrich Meyer:
On Dynamic Breadth-First Search in External-Memory. CoRR abs/0802.2847 (2008) - 2007
- [c29]Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Improved External Memory BFS Implementation. ALENEX 2007 - 2006
- [j10]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. Electron. Notes Discret. Math. 25: 7-12 (2006) - [j9]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) - [j8]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): 444-453 (2006) - [c28]Deepak Ajwani, Ulrich Meyer, Vitaly Osipov:
Breadth First Search on Massive Graphs. The Shortest Path Problem 2006: 291-307 - [c27]Ulrich Meyer, Norbert Zeh:
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA 2006: 540-551 - [c26]Deepak Ajwani, Roman Dementiev, Ulrich Meyer:
A computational study of external-memory BFS algorithms. SODA 2006: 601-610 - [c25]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) Algorithm for Online Topological Ordering. SWAT 2006: 53-64 - [i1]Deepak Ajwani, Tobias Friedrich, Ulrich Meyer:
An O(n2.75) algorithm for online topological ordering. CoRR abs/cs/0602073 (2006) - 2005
- [c24]Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal:
A simple improved distributed algorithm for minimum CDS in unit disk graphs. WiMob (2) 2005: 220-223 - 2004
- [c23]Lars Arge, Ulrich Meyer, Laura Toma:
External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP 2004: 146-157 - [c22]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
- [j7]Ulrich Meyer:
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms 48(1): 91-134 (2003) - [j6]Ulrich Meyer, Peter Sanders:
[Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms 49(1): 114-152 (2003) - [j5]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. 7(2): 105-129 (2003) - [c21]Ulrich Meyer, Norbert Zeh:
I/O-Efficient Undirected Shortest Paths. ESA 2003: 434-445 - [c20]Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn:
Algorithms and Experiments for the Webgraph. ESA 2003: 703-714 - [e1]Ulrich Meyer, Peter Sanders, Jop F. Sibeyn:
Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]. Lecture Notes in Computer Science 2625, Springer 2003, ISBN 3-540-00883-7 [contents] - 2002
- [b1]Ulrich Meyer:
Design and analysis of sequential and parallel single-source shortest-paths algorithms. Saarland University, Saarbrücken, Germany, 2002, pp. I-VIII, 1-110 - [j4]Ulrich Meyer, Jop F. Sibeyn:
Oblivious Gossiping on Tori. J. Algorithms 42(1): 1-19 (2002) - [c19]Irit Katriel, Ulrich Meyer:
Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies 2002: 62-84 - [c18]Kurt Mehlhorn, Ulrich Meyer:
External-Memory Breadth-First Search with Sublinear I/O. ESA 2002: 723-735 - [c17]Ulrich Meyer:
Buckets Strike Back: Improved Parallel Shortest Paths. IPDPS 2002 - [c16]Jop F. Sibeyn, James Abello, Ulrich Meyer:
Heuristics for semi-external depth first search on directed graphs. SPAA 2002: 282-292 - 2001
- [j3]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): 305-337 (2001) - [c15]Ulrich Meyer:
Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. Euro-Par 2001: 343-351 - [c14]Stefan Edelkamp, Ulrich Meyer:
Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. KI/ÖGAI 2001: 169-184 - [c13]Ulrich Meyer:
External memory BFS on undirected graphs with bounded degree. SODA 2001: 87-88 - [c12]Ulrich Meyer:
Single-source shortest-paths on arbitrary directed graphs in linear average-case time. SODA 2001: 797-806 - [c11]Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh:
On External-Memory Planar Depth First Search. WADS 2001: 471-482 - 2000
- [j2]Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory. ACM J. Exp. Algorithmics 5: 17 (2000) - [c10]Ulrich Meyer, Peter Sanders:
Parallel Shortest Path for Arbitrary Graphs. Euro-Par 2000: 461-470
1990 – 1999
- 1999
- [c9]Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer:
An Experimental Study of Priority Queues in External Memory. WAE 1999: 346-360 - 1998
- [c8]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
Randomized External-Memory Algorithms for Some Geometric Problems. SCG 1998: 259-268 - [c7]Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos:
I/O-optimal computation of segment intersections. External Memory Algorithms 1998: 131-138 - [c6]Ulrich Meyer, Peter Sanders:
Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA 1998: 393-404 - [c5]Ulrich Meyer, Jop F. Sibeyn:
Gossiping Large Packets on Full-Port Tori. Euro-Par 1998: 1040-1046 - [c4]Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders:
A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS 1998: 722-731 - 1997
- [j1]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. Comput. Artif. Intell. 16(2): 107-140 (1997) - [c3]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Matrix Transpose on Meshes: Theory and Practice. IPPS 1997: 315-319 - 1995
- [c2]Ulrich Meyer, Jop F. Sibeyn:
Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator. EUROSIM 1995: 285-290 - 1994
- [c1]Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn:
Towards practical permutation routing on meshes. SPDP 1994: 664-671
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
