Ulrich Meyer’s research covers both theoretical and experimental aspects of processing large data sets on advanced models of computation. For example, was spokesperson of the DFG priority program (SPP 1736) on Algorithms for Big Data in Germany. He has been contributing to parallel and external-memory graph algorithms for many years and has recently focused on efficient large-scale network generation according to various stochastic models. Key results include the parallel Delta-Stepping algorithm (ESA Test of Time Award 2019) and the first BFS approach with sublinear I/O. His work also covers more exotic topics like energy-efficient sorting (records in the JouleSort competition 2009/10, Germany Land of Ideas Award) and fragile computing, which received he a best-paper award at ESA 2019.
@article{DBLP:journals/jgaa/MeyerTT24,
author = "Meyer, Ulrich and Tran, Hung and Tsakalidis, Konstantinos",
title = "Certifying Induced Subgraphs in Large Graphs",
journal = "J. Graph Algorithms Appl.",
volume = "28",
number = "3",
pages = "49--68",
year = "2024"
}@inproceedings{DBLP:conf/esa/Leonhardt0P24,
author = "Leonhardt, Alexander and Meyer, Ulrich and Penschuck, Manuel",
title = "Insights into (k, {\(\rho\)})-Shortcutting Algorithms",
booktitle = "{ESA}",
series = "LIPIcs",
volume = "308",
pages = "84:1--84:17",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = "2024"
}@inproceedings{DBLP:conf/walcom/MeyerTT23,
author = "Meyer, Ulrich and Tran, Hung and Tsakalidis, Konstantinos",
editor = "Lin, Chun{-}Cheng and Lin, Bertrand M. T. and Liotta, Giuseppe",
title = "Certifying Induced Subgraphs in Large Graphs",
booktitle = "{WALCOM:} Algorithms and Computation - 17th International Conference and Workshops, {WALCOM} 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings",
series = "Lecture Notes in Computer Science",
volume = "13973",
pages = "229--241",
publisher = "Springer",
year = "2023"
}@inproceedings{DBLP:conf/alenex/Allendorf0PT23,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
editor = "Navarro, Gonzalo and Shun, Julian",
title = "Parallel and {I/O}-Efficient Algorithms for Non-Linear Preferential Attachment",
doi = "10.1137/1.9781611977561.ch6",
url = "https://doi.org/10.1137/1.9781611977561.ch6",
booktitle = "Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2023, Florence, Italy, January 22-23, 2023",
pages = "65--76",
publisher = "{SIAM}",
year = "2023"
}@article{DBLP:journals/jpdc/AllendorfMPT23,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
title = "Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees",
doi = "10.1016/j.jpdc.2022.12.010",
url = "https://doi.org/10.1016/j.jpdc.2022.12.010",
journal = "J. Parallel Distributed Comput.",
volume = "174",
pages = "118--129",
year = "2023"
}@InProceedings{leonhardt_et_al:LIPIcs.IPEC.2023.37,
author = "Leonhardt, Alexander and Dell, Holger and Haak, Anselm and Kammer, Frank and Meintrup, Johannes and Meyer, Ulrich and Penschuck, Manuel",
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
title = "{PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)}",
booktitle = "18th International Symposium on Parameterized and Exact Computation (IPEC 2023)",
pages = "37:1--37:7",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
ISBN = "978-3-95977-305-8",
ISSN = "1868-8969",
year = "2023",
volume = "285",
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = "Dagstuhl, Germany",
URL = "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.37",
URN = "urn:nbn:de:0030-drops-194563",
doi = "10.4230/LIPIcs.IPEC.2023.37",
annote = "Keywords: PACE 2023 Challenge, Heuristic, Exact, Twin-Width"
}@proceedings{DBLP:books/sp/22/2022BKMP,
editor = "Bast, Hannah and Korzen, Claudius and Meyer, Ulrich and Penschuck, Manuel",
title = "Algorithms for Big Data - {DFG} Priority Program 1736",
series = "Lecture Notes in Computer Science",
volume = "13201",
publisher = "Springer",
year = "2022"
}@article{DBLP:journals/netsci/BlasiusFKMPW22,
author = {Bl{\"{a}}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian and Meyer, Ulrich and Penschuck, Manuel and Weyand, Christopher},
title = "Efficiently generating geometric inhomogeneous and hyperbolic random graphs",
journal = "Netw. Sci.",
volume = "10",
number = "4",
pages = "361--380",
year = "2022"
}@inproceedings{allendorf2022engineering,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wormald, Nick",
title = "Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence",
booktitle = "2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)",
pages = "27--40",
year = "2022",
organization = "SIAM",
url = "https://doi.org/10.1137/1.9781611977042.3",
doi = "10.1137/1.9781611977042.3"
}@incollection{DBLP:books/sp/22/0001P22,
author = "Meyer, Ulrich and Penschuck, Manuel",
title = "Generating Synthetic Graph Data from Random Network Models",
booktitle = "Algorithms for Big Data",
series = "Lecture Notes in Computer Science",
volume = "13201",
pages = "21--38",
publisher = "Springer",
year = "2022"
}@inproceedings{allendorf2022parallel,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
booktitle = "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
title = "Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees",
year = "2022",
volume = "",
issn = "",
pages = "269-279",
keywords = "distributed processing;runtime;scalability;switches;markov processes;data structures;generators",
doi = "10.1109/IPDPS53621.2022.00034",
url = "https://doi.ieeecomputersociety.org/10.1109/IPDPS53621.2022.00034",
publisher = "IEEE Computer Society",
address = "Los Alamitos, CA, USA",
month = "jun"
}@incollection{DBLP:books/crc/22/PenschuckBHL0S0022,
author = "Penschuck, Manuel and Brandes, Ulrik and Hamann, Michael and Lamm, Sebastian and Meyer, Ulrich and Safro, Ilya and Sanders, Peter and Schulz, Christian",
title = "Recent Advances in Scalable Network Generation",
booktitle = "Massive Graph Analytics",
pages = "333--376",
publisher = "Chapman and Hall/CRC",
year = "2022"
}@InProceedings{brodal_et_al:LIPIcs.SEA.2021.23,
author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Hammer, David and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
editor = "Coudert, David and Natale, Emanuele",
title = "An Experimental Study of External Memory Algorithms for Connected Components",
booktitle = "19th International Symposium on Experimental Algorithms (SEA 2021)",
pages = "23:1--23:23",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
ISBN = "978-3-95977-185-6",
ISSN = "1868-8969",
year = "2021",
volume = "190",
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = "Dagstuhl, Germany",
URL = "https://drops.dagstuhl.de/opus/volltexte/2021/13795",
URN = "urn:nbn:de:0030-drops-137958",
doi = "10.4230/LIPIcs.SEA.2021.23",
annote = "Keywords: Connected Components, Experimental Evaluation, External Memory, Graph Algorithms, Randomization"
}@article{DBLP:journals/it/0001P20,
author = "Meyer, Ulrich and Penschuck, Manuel",
title = "Large-scale graph generation: Recent results of the {SPP} 1736 - Part {II}",
journal = "it Inf. Technol.",
volume = "62",
number = "3-4",
pages = "135--144",
year = "2020",
url = "https://doi.org/10.1515/itit-2019-0041",
doi = "10.1515/itit-2019-0041",
biburl = "https://dblp.org/rec/journals/it/0001P20.bib"
}@InProceedings{berenbrink_et_al:LIPIcs:2020:12882,
author = "Berenbrink, Petra and Hammer, David and Kaaser, Dominik and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
editor = "Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter",
title = "{Simulating Population Protocols in Sub-Constant Time per Interaction}",
booktitle = "28th Annual European Symposium on Algorithms (ESA 2020)",
pages = "16:1--16:22",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
ISBN = "978-3-95977-162-7",
ISSN = "1868-8969",
year = "2020",
volume = "173",
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = "Dagstuhl, Germany",
URL = "https://drops.dagstuhl.de/opus/volltexte/2020/12882",
URN = "urn:nbn:de:0030-drops-128827",
doi = "10.4230/LIPIcs.ESA.2020.16",
annote = "Keywords: Population Protocols, Simulation, Random Sampling, Dynamic Alias Table"
}@article{DBLP:journals/jpdc/FunkeLMPSSSL19,
author = "Funke, Daniel and Lamm, Sebastian and Meyer, Ulrich and Penschuck, Manuel and Sanders, Peter and Schulz, Christian and Strash, Darren and von Looz, Moritz",
title = "Communication-free massively distributed graph generation",
journal = "J. Parallel Distributed Comput.",
volume = "131",
pages = "200--217",
year = "2019",
url = "https://doi.org/10.1016/j.jpdc.2019.03.011",
doi = "10.1016/j.jpdc.2019.03.011",
biburl = "https://dblp.org/rec/journals/jpdc/FunkeLMPSSSL19.bib"
}@inproceedings{DBLP:conf/esa/Blasius0K0PW19,
author = {Bl{\"{a}}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian and Meyer, Ulrich and Penschuck, Manuel and Weyand, Christopher},
editor = "Bender, Michael A. and Svensson, Ola and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/Blasius0K0PW19.bib",
booktitle = "27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany",
doi = "10.4230/LIPIcs.ESA.2019.21",
pages = "21:1--21:14",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs",
url = "https://doi.org/10.4230/LIPIcs.ESA.2019.21",
volume = "144",
year = "2019"
}@inproceedings{DBLP:conf/esa/AfshaniFHJK0PS19,
author = "Afshani, Peyman and Fagerberg, Rolf and Hammer, David and Jacob, Riko and Kostitsyna, Irina and Meyer, Ulrich and Penschuck, Manuel and Sitchinava, Nodari",
editor = "Bender, Michael A. and Svensson, Ola and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/AfshaniFHJK0PS19.bib",
booktitle = "27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany",
doi = "10.4230/LIPIcs.ESA.2019.2",
pages = "2:1--2:19",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Fragile Complexity of Comparison-Based Algorithms",
url = "https://doi.org/10.4230/LIPIcs.ESA.2019.2",
volume = "144",
year = "2019"
}@inproceedings{DBLP:conf/isaac/FagerbergH019,
author = "Fagerberg, Rolf and Hammer, David and Meyer, Ulrich",
title = "On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape?",
booktitle = "30th International Symposium on Algorithms and Computation, {ISAAC} 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China",
pages = "35:1--35:16",
year = "2019",
url = "https://doi.org/10.4230/LIPIcs.ISAAC.2019.35",
doi = "10.4230/LIPIcs.ISAAC.2019.35",
biburl = "https://dblp.org/rec/conf/isaac/FagerbergH019.bib"
}@inproceedings{DBLP:conf/icpp/AjwaniDH0S18,
author = "Ajwani, Deepak and Duriakova, Erika and Hurley, Neil and Meyer, Ulrich and Schickedanz, Alexander",
biburl = "https://dblp.org/rec/conf/icpp/AjwaniDH0S18.bib",
booktitle = "Proceedings of the 47th International Conference on Parallel Processing, {ICPP} 2018, Eugene, OR, USA, August 13-16, 2018",
doi = "10.1145/3225058.3225075",
pages = "78:1--78:12",
publisher = "{ACM}",
title = "An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores",
url = "https://doi.org/10.1145/3225058.3225075",
year = "2018"
}@inproceedings{DBLP:conf/complexnetworks/SchickedanzA0G18,
author = "Schickedanz, Alexander and Ajwani, Deepak and Meyer, Ulrich and Gawrychowski, Pawel",
editor = "Aiello, Luca Maria and Cherifi, Chantal and Cherifi, Hocine and Lambiotte, Renaud and Li{\'{o}}, Pietro and Rocha, Luis M.",
biburl = "https://dblp.org/rec/conf/complexnetworks/SchickedanzA0G18.bib",
booktitle = "Complex Networks and Their Applications {VII} - Volume 1 Proceedings The 7th International Conference on Complex Networks and Their Applications {COMPLEX} {NETWORKS} 2018, Cambridge, UK, December 11-13, 2018",
doi = "10.1007/978-3-030-05411-3\_3",
pages = "28--40",
publisher = "Springer",
series = "Studies in Computational Intelligence",
title = "Average-Case Behavior of k-Shortest Path Algorithms",
url = "https://doi.org/10.1007/978-3-030-05411-3\_3",
volume = "812",
year = "2018"
}@article{DBLP:journals/ki/KerstingM18,
author = "Kersting, Kristian and Meyer, Ulrich",
biburl = "https://dblp.org/rec/journals/ki/KerstingM18.bib",
doi = "10.1007/s13218-017-0523-7",
journal = "{KI}",
number = "1",
pages = "3--8",
title = "From Big Data to Big Artificial Intelligence? - Algorithmic Challenges and Opportunities of Big Data",
url = "https://doi.org/10.1007/s13218-017-0523-7",
volume = "32",
year = "2018"
}@inproceedings{DBLP:conf/esa/CarstensH0PTW18,
author = "Carstens, Corrie Jacobien and Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea",
editor = "Azar, Yossi and Bast, Hannah and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/CarstensH0PTW18.bib",
booktitle = "26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland",
doi = "10.4230/LIPIcs.ESA.2018.11",
pages = "11:1--11:15",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Parallel and {I/O}-efficient Randomisation of Massive Networks using Global Curveball Trades",
url = "https://doi.org/10.4230/LIPIcs.ESA.2018.11",
volume = "112",
year = "2018"
}@article{DBLP:journals/ki/BehdjuM18,
author = "Behdju, Mahyar and Meyer, Ulrich",
biburl = "https://dblp.org/rec/journals/ki/BehdjuM18.bib",
doi = "10.1007/s13218-017-0518-4",
journal = "{KI}",
number = "1",
pages = "77--84",
title = "{DFG} Priority Programme {SPP} 1736: Algorithms for Big Data",
url = "https://doi.org/10.1007/s13218-017-0518-4",
volume = "32",
year = "2018"
}@article{DBLP:journals/jea/HamannMPTW18,
author = "Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea",
biburl = "https://dblp.org/rec/journals/jea/HamannMPTW18.bib",
doi = "10.1145/3230743",
journal = "{ACM} Journal of Experimental Algorithmics",
title = "{I/O}-Efficient Generation of Massive Graphs Following the {LFR} Benchmark",
url = "https://doi.org/10.1145/3230743",
volume = "23",
year = "2018"
}@article{DBLP:journals/eatcs/0001P17,
author = "Meyer, Ulrich and Penschuck, Manuel",
biburl = "https://dblp.org/rec/journals/eatcs/0001P17.bib",
journal = "Bulletin of the {EATCS}",
title = "Large-scale Graph Generation and Big Data: An Overview on Recent Results",
url = "http://eatcs.org/beatcs/index.php/beatcs/article/view/494",
volume = "122",
year = "2017"
}@inproceedings{DBLP:conf/alenex/HamannMPW17,
author = "Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Wagner, Dorothea",
editor = "Fekete, S{\'{a}}ndor P. and Ramachandran, Vijaya",
biburl = "https://dblp.org/rec/conf/alenex/HamannMPW17.bib",
booktitle = "Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017",
doi = "10.1137/1.9781611974768.5",
pages = "58--72",
publisher = "{SIAM}",
title = "{I/O}-efficient Generation of Massive Graphs Following the {LFR} Benchmark",
url = "https://doi.org/10.1137/1.9781611974768.5",
year = "2017"
}@inproceedings{DBLP:conf/alenex/MeyerP16,
author = "Meyer, Ulrich and Penschuck, Manuel",
editor = "Goodrich, Michael T. and Mitzenmacher, Michael",
biburl = "https://dblp.org/rec/conf/alenex/MeyerP16.bib",
booktitle = "Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10, 2016",
doi = "10.1137/1.9781611974317.4",
pages = "39--52",
publisher = "{SIAM}",
title = "Generating Massive Scale-Free Networks under Resource Constraints",
url = "https://doi.org/10.1137/1.9781611974317.4",
year = "2016"
}@incollection{DBLP:reference/algo/JacobMT16,
author = "Jacob, Riko and Meyer, Ulrich and Toma, Laura",
biburl = "https://dblp.org/rec/reference/algo/JacobMT16.bib",
booktitle = "Encyclopedia of Algorithms",
doi = "10.1007/978-1-4939-2864-4\_592",
pages = "1117--1121",
title = "List Ranking",
url = "https://doi.org/10.1007/978-1-4939-2864-4\_592",
year = "2016"
}@inproceedings{DBLP:conf/ppopp/AshkianiDMO16,
author = "Ashkiani, Saman and Davidson, Andrew A. and Meyer, Ulrich and Owens, John D.",
editor = "Asenjo, Rafael and Harris, Tim",
biburl = "https://dblp.org/rec/conf/ppopp/AshkianiDMO16.bib",
booktitle = "Proceedings of the 21st {ACM} {SIGPLAN} Symposium on Principles and Practice of Parallel Programming, PPoPP 2016, Barcelona, Spain, March 12-16, 2016",
doi = "10.1145/2851141.2851169",
pages = "12:1--12:13",
publisher = "{ACM}",
title = "{GPU} multisplit",
url = "https://doi.org/10.1145/2851141.2851169",
year = "2016"
}@incollection{DBLP:reference/algo/ZehM16,
author = "Zeh, Norbert and Meyer, Ulrich",
biburl = "https://dblp.org/rec/reference/algo/ZehM16.bib",
booktitle = "Encyclopedia of Algorithms",
doi = "10.1007/978-1-4939-2864-4\_190",
pages = "943--947",
title = "{I/O}-Model",
url = "https://doi.org/10.1007/978-1-4939-2864-4\_190",
year = "2016"
}@article{DBLP:journals/corr/WollstadtMW15,
author = "Wollstadt, Patricia and Meyer, Ulrich and Wibral, Michael",
archiveprefix = "arXiv",
biburl = "https://dblp.org/rec/journals/corr/WollstadtMW15.bib",
eprint = "1504.00156",
journal = "CoRR",
title = "A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions",
url = "http://arxiv.org/abs/1504.00156",
volume = "abs/1504.00156",
year = "2015"
}@inproceedings{DBLP:conf/alenex/AjwaniMV15,
author = "Ajwani, Deepak and Meyer, Ulrich and Veith, David",
editor = "Brandes, Ulrik and Eppstein, David",
biburl = "https://dblp.org/rec/conf/alenex/AjwaniMV15.bib",
booktitle = "Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2015, San Diego, CA, USA, January 5, 2015",
doi = "10.1137/1.9781611973754.14",
pages = "159--172",
publisher = "{SIAM}",
title = "An {I/O}-efficient Distance Oracle for Evolving Real-World Graphs",
url = "https://doi.org/10.1137/1.9781611973754.14",
year = "2015"
}@inproceedings{DBLP:conf/wine/KovacsMV15,
author = "Kov{\'{a}}cs, Annam{\'{a}}ria and Meyer, Ulrich and Ventre, Carmine",
editor = {Markakis, Evangelos and Sch{\"{a}}fer, Guido},
biburl = "https://dblp.org/rec/conf/wine/KovacsMV15.bib",
booktitle = "Web and Internet Economics - 11th International Conference, {WINE} 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings",
doi = "10.1007/978-3-662-48995-6\_29",
pages = "398--412",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Mechanisms with Monitoring for Truthful {RAM} Allocation",
url = "https://doi.org/10.1007/978-3-662-48995-6\_29",
volume = "9470",
year = "2015"
}@article{DBLP:journals/ipl/KovacsMMN15,
author = "Kov{\'{a}}cs, Annam{\'{a}}ria and Meyer, Ulrich and Moruz, Gabriel and Negoescu, Andrei",
biburl = "https://dblp.org/rec/journals/ipl/KovacsMMN15.bib",
doi = "10.1016/j.ipl.2015.07.011",
journal = "Inf. Process. Lett.",
number = "12",
pages = "932--938",
title = "The optimal structure of algorithms for {\(\alpha\)}-paging",
url = "https://doi.org/10.1016/j.ipl.2015.07.011",
volume = "115",
year = "2015"
}@proceedings{DBLP:conf/alenex/2014,
editor = "McGeoch, Catherine C. and Meyer, Ulrich",
biburl = "https://dblp.org/rec/conf/alenex/2014.bib",
doi = "10.1137/1.9781611973198",
isbn = "978-1-61197-319-8",
publisher = "{SIAM}",
title = "2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2014, Portland, Oregon, USA, January 5, 2014",
url = "https://doi.org/10.1137/1.9781611973198",
year = "2014"
}@article{DBLP:journals/insk/MeyerW13,
author = "Meyer, Ulrich and Weichert, Volker",
biburl = "https://dblp.org/rec/journals/insk/MeyerW13.bib",
doi = "10.1007/s00287-013-0681-4",
journal = "Informatik Spektrum",
number = "2",
pages = "153--161",
title = {Algorithm Engineering f{\"{u}}r moderne Hardware},
url = "https://doi.org/10.1007/s00287-013-0681-4",
volume = "36",
year = "2013"
}@inproceedings{DBLP:conf/esa/BeckmannMV13,
author = "Beckmann, Andreas and Meyer, Ulrich and Veith, David",
editor = "Bodlaender, Hans L. and Italiano, Giuseppe F.",
biburl = "https://dblp.org/rec/conf/esa/BeckmannMV13.bib",
booktitle = "Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings",
doi = "10.1007/978-3-642-40450-4\_11",
pages = "121--132",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "An Implementation of {I/O}-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering",
url = "https://doi.org/10.1007/978-3-642-40450-4\_11",
volume = "8125",
year = "2013"
}@inproceedings{DBLP:journals/corr/abs-1210-6411,
author = {Beckmann, Andreas and Fedorowicz, Jaroslaw and Keller, J{\"{o}}rg and Meyer, Ulrich},
editor = "Wijs, Anton and Bosnacki, Dragan and Edelkamp, Stefan",
biburl = "https://dblp.org/rec/journals/corr/abs-1210-6411.bib",
booktitle = "Proceedings First Workshop on {GRAPH} Inspection and Traversal Engineering, {GRAPHITE} 2012, Tallinn, Estonia, 1st April 2012",
doi = "10.4204/EPTCS.99.4",
pages = "5--19",
series = "{EPTCS}",
title = "A structural analysis of the {A5/1} state transition graph",
url = "https://doi.org/10.4204/EPTCS.99.4",
volume = "99",
year = "2012"
}@inproceedings{DBLP:conf/embc/WibralW0PPV12,
author = "Wibral, Michael and Wollstadt, Patricia and Meyer, Ulrich and Pampu, Nicolae and Priesemann, Viola and Vicente, Raul",
biburl = "https://dblp.org/rec/conf/embc/WibralW0PPV12.bib",
booktitle = "Annual International Conference of the {IEEE} Engineering in Medicine and Biology Society, {EMBC} 2012, San Diego, CA, USA, August 28 - September 1, 2012",
doi = "10.1109/EMBC.2012.6346764",
pages = "3676--3679",
publisher = "{IEEE}",
title = "Revisiting Wiener's principle of causality - interaction-delay reconstruction using transfer entropy and multivariate analysis on delay-weighted graphs",
url = "https://doi.org/10.1109/EMBC.2012.6346764",
year = "2012"
}@inproceedings{DBLP:conf/esa/AjwaniMV12,
author = "Ajwani, Deepak and Meyer, Ulrich and Veith, David",
editor = "Epstein, Leah and Ferragina, Paolo",
biburl = "https://dblp.org/rec/conf/esa/AjwaniMV12.bib",
booktitle = "Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings",
doi = "10.1007/978-3-642-33090-2\_8",
pages = "72--83",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "{I/O}-efficient Hierarchical Diameter Approximation",
url = "https://doi.org/10.1007/978-3-642-33090-2\_8",
volume = "7501",
year = "2012"
}@inproceedings{DBLP:conf/arcs/AjwaniBMV11,
author = "Ajwani, Deepak and Beckmann, Andreas and Meyer, Ulrich and Veith, David",
editor = {M{\"{u}}hl, Gero and Richling, Jan and Herkersdorf, Andreas},
biburl = "https://dblp.org/rec/conf/arcs/AjwaniBMV11.bib",
booktitle = {{ARCS} 2012 Workshops, 28. Februar - 2. M{\"{a}}rz 2012, M{\"{u}}nchen, Germany},
pages = "493--504",
publisher = "{GI}",
series = "{LNI}",
title = "{I/O}-efficient approximation of graph diameters by parallel cluster growing - a first experimental study",
url = "http://ieeexplore.ieee.org/document/6222204/",
volume = "{P-200}",
year = "2012"
}@article{DBLP:journals/talg/MeyerZ12,
author = "Meyer, Ulrich and Zeh, Norbert",
biburl = "https://dblp.org/rec/journals/talg/MeyerZ12.bib",
doi = "10.1145/2229163.2229166",
journal = "{ACM} Trans. Algorithms",
number = "3",
pages = "22:1--22:28",
title = "{I/O}-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths",
url = "https://doi.org/10.1145/2229163.2229166",
volume = "8",
year = "2012"
}@inproceedings{DBLP:conf/tapas/MeyerNW11,
author = "Meyer, Ulrich and Negoescu, Andrei and Weichert, Volker",
editor = "Marchetti{-}Spaccamela, Alberto and Segal, Michael",
biburl = "https://dblp.org/rec/conf/tapas/MeyerNW11.bib",
booktitle = "Theory and Practice of Algorithms in (Computer) Systems - First International {ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings",
doi = "10.1007/978-3-642-19754-3\_22",
pages = "217--228",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches",
url = "https://doi.org/10.1007/978-3-642-19754-3\_22",
volume = "6595",
year = "2011"
}@proceedings{DBLP:conf/esa/2010-2,
editor = "de Berg, Mark and Meyer, Ulrich",
biburl = "https://dblp.org/rec/conf/esa/2010-2.bib",
doi = "10.1007/978-3-642-15781-3",
isbn = "978-3-642-15780-6",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part {II}",
url = "https://doi.org/10.1007/978-3-642-15781-3",
volume = "6347",
year = "2010"
}@proceedings{DBLP:conf/esa/2010-1,
editor = "de Berg, Mark and Meyer, Ulrich",
biburl = "https://dblp.org/rec/conf/esa/2010-1.bib",
doi = "10.1007/978-3-642-15775-2",
isbn = "978-3-642-15774-5",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part {I}",
url = "https://doi.org/10.1007/978-3-642-15775-2",
volume = "6346",
year = "2010"
}@inproceedings{DBLP:conf/dfg/AjwaniM09,
author = "Ajwani, Deepak and Meyer, Ulrich",
editor = {Lerner, J{\"{u}}rgen and Wagner, Dorothea and Zweig, Katharina Anna},
biburl = "https://dblp.org/rec/conf/dfg/AjwaniM09.bib",
booktitle = "Algorithmics of Large and Complex Networks - Design, Analysis, and Simulation {[DFG} priority program 1126]",
doi = "10.1007/978-3-642-02094-0\_1",
pages = "1--33",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Design and Engineering of External Memory Traversal Algorithms for General Graphs",
url = "https://doi.org/10.1007/978-3-642-02094-0\_1",
volume = "5515",
year = "2009"
}@inproceedings{DBLP:conf/alenex/MeyerO09,
author = "Meyer, Ulrich and Osipov, Vitaly",
editor = "Finocchi, Irene and Hershberger, John",
biburl = "https://dblp.org/rec/conf/alenex/MeyerO09.bib",
booktitle = "Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments, {ALENEX} 2009, New York, New York, USA, January 3, 2009",
doi = "10.1137/1.9781611972894.9",
pages = "85--96",
publisher = "{SIAM}",
title = "Design and Implementation of a Practical {I/O}-efficient Shortest Paths Algorithm",
url = "https://doi.org/10.1137/1.9781611972894.9",
year = "2009"
}@inproceedings{DBLP:conf/wea/AjwaniBJMM09,
author = "Ajwani, Deepak and Beckmann, Andreas and Jacob, Riko and Meyer, Ulrich and Moruz, Gabriel",
editor = "Vahrenhold, Jan",
biburl = "https://dblp.org/rec/conf/wea/AjwaniBJMM09.bib",
booktitle = "Experimental Algorithms, 8th International Symposium, {SEA} 2009, Dortmund, Germany, June 4-6, 2009. Proceedings",
doi = "10.1007/978-3-642-02011-7\_4",
pages = "16--27",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "On Computational Models for Flash Memory Devices",
url = "https://doi.org/10.1007/978-3-642-02011-7\_4",
volume = "5526",
year = "2009"
}@inproceedings{DBLP:conf/isaac/KovacsMN09,
author = "Kov{\'{a}}cs, Annam{\'{a}}ria and Meyer, Ulrich and Moruz, Gabriel and Negoescu, Andrei",
editor = "Dong, Yingfei and Du, Ding{-}Zhu and Ibarra, Oscar H.",
biburl = "https://dblp.org/rec/conf/isaac/KovacsMN09.bib",
booktitle = "Algorithms and Computation, 20th International Symposium, {ISAAC} 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings",
doi = "10.1007/978-3-642-10631-6\_37",
pages = "352--361",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Online paging for flash memory devices",
url = "https://doi.org/10.1007/978-3-642-10631-6\_37",
volume = "5878",
year = "2009"
}@inproceedings{DBLP:conf/birthday/Meyer09,
author = "Meyer, Ulrich",
editor = {Albers, Susanne and Alt, Helmut and N{\"{a}}her, Stefan},
biburl = "https://dblp.org/rec/conf/birthday/Meyer09.bib",
booktitle = "Efficient Algorithms, Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday",
doi = "10.1007/978-3-642-03456-5\_15",
pages = "219--232",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Via Detours to {I/O}-Efficient Shortest Paths",
url = "https://doi.org/10.1007/978-3-642-03456-5\_15",
volume = "5760",
year = "2009"
}@article{DBLP:journals/talg/AjwaniFM08,
author = "Ajwani, Deepak and Friedrich, Tobias and Meyer, Ulrich",
biburl = "https://dblp.org/rec/journals/talg/AjwaniFM08.bib",
doi = "10.1145/1383369.1383370",
journal = "{ACM} Trans. Algorithms",
number = "4",
pages = "39:1--39:14",
title = "An O(n^2.75) algorithm for incremental topological ordering",
url = "https://doi.org/10.1145/1383369.1383370",
volume = "4",
year = "2008"
}@inproceedings{DBLP:conf/wea/AjwaniMMT08,
author = "Ajwani, Deepak and Malinger, Itay and Meyer, Ulrich and Toledo, Sivan",
editor = "McGeoch, Catherine C.",
biburl = "https://dblp.org/rec/conf/wea/AjwaniMMT08.bib",
booktitle = "Experimental Algorithms, 7th International Workshop, {WEA} 2008, Provincetown, MA, USA, May 30-June 1, 2008, Proceedings",
doi = "10.1007/978-3-540-68552-4\_16",
pages = "208--219",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design",
url = "https://doi.org/10.1007/978-3-540-68552-4\_16",
volume = "5038",
year = "2008"
}@inproceedings{DBLP:conf/stacs/Meyer08,
author = "Meyer, Ulrich",
editor = "Albers, Susanne and Weil, Pascal",
biburl = "https://dblp.org/rec/conf/stacs/Meyer08.bib",
booktitle = "{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science, Bordeaux, France, February 21-23, 2008, Proceedings",
doi = "10.4230/LIPIcs.STACS.2008.1316",
pages = "551--560",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany",
series = "LIPIcs",
title = "On Dynamic Breadth-First Search in External-Memory",
url = "https://doi.org/10.4230/LIPIcs.STACS.2008.1316",
volume = "1",
year = "2008"
}@inproceedings{DBLP:conf/swat/Meyer08,
author = "Meyer, Ulrich",
editor = "Gudmundsson, Joachim",
biburl = "https://dblp.org/rec/conf/swat/Meyer08.bib",
booktitle = "Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings",
doi = "10.1007/978-3-540-69903-3\_38",
pages = "426--436",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "On Trade-Offs in External-Memory Diameter-Approximation",
url = "https://doi.org/10.1007/978-3-540-69903-3\_38",
volume = "5124",
year = "2008"
}@inproceedings{DBLP:conf/alenex/AjwaniMO07,
author = "Ajwani, Deepak and Meyer, Ulrich and Osipov, Vitaly",
biburl = "https://dblp.org/rec/conf/alenex/AjwaniMO07.bib",
booktitle = "Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, {ALENEX} 2007, New Orleans, Louisiana, USA, January 6, 2007",
doi = "10.1137/1.9781611972870.1",
publisher = "{SIAM}",
title = "Improved External Memory {BFS} Implementation",
url = "https://doi.org/10.1137/1.9781611972870.1",
year = "2007"
}@inproceedings{DBLP:conf/esa/BrodalFFGIJMM07,
author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F. and J{\o}rgensen, Allan Gr{\o}nlund and Moruz, Gabriel and M{\o}lhave, Thomas",
editor = "Arge, Lars and Hoffmann, Michael and Welzl, Emo",
biburl = "https://dblp.org/rec/conf/esa/BrodalFFGIJMM07.bib",
booktitle = "Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings",
doi = "10.1007/978-3-540-75520-3\_32",
pages = "347--358",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Optimal Resilient Dynamic Dictionaries",
url = "https://doi.org/10.1007/978-3-540-75520-3\_32",
volume = "4698",
year = "2007"
}@inproceedings{DBLP:conf/soda/AjwaniDM06,
author = "Ajwani, Deepak and Dementiev, Roman and Meyer, Ulrich",
biburl = "https://dblp.org/rec/conf/soda/AjwaniDM06.bib",
booktitle = "Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006",
pages = "601--610",
publisher = "{ACM} Press",
title = "A computational study of external-memory {BFS} algorithms",
url = "http://dl.acm.org/citation.cfm?id=1109557.1109623",
year = "2006"
}@article{DBLP:journals/tosn/FunkeKMS06,
author = "Funke, Stefan and Kesselman, Alexander and Meyer, Ulrich and Segal, Michael",
biburl = "https://dblp.org/rec/journals/tosn/FunkeKMS06.bib",
doi = "10.1145/1167935.1167941",
journal = "{TOSN}",
number = "3",
pages = "444--453",
title = "A simple improved distributed algorithm for minimum {CDS} in unit disk graphs",
url = "https://doi.org/10.1145/1167935.1167941",
volume = "2",
year = "2006"
}@article{DBLP:journals/jgaa/DonatoLLMMS06,
author = "Donato, Debora and Laura, Luigi and Leonardi, Stefano and Meyer, Ulrich and Millozzi, Stefano and Sibeyn, Jop F.",
biburl = "https://dblp.org/rec/journals/jgaa/DonatoLLMMS06.bib",
doi = "10.7155/jgaa.00125",
journal = "J. Graph Algorithms Appl.",
number = "2",
pages = "219--236",
title = "Algorithms and Experiments for the Webgraph",
url = "https://doi.org/10.7155/jgaa.00125",
volume = "10",
year = "2006"
}@inproceedings{DBLP:conf/swat/AjwaniFM06,
author = "Ajwani, Deepak and Friedrich, Tobias and Meyer, Ulrich",
editor = "Arge, Lars and Freivalds, Rusins",
biburl = "https://dblp.org/rec/conf/swat/AjwaniFM06.bib",
booktitle = "Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings",
doi = "10.1007/11785293\_8",
pages = "53--64",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "An O(n^2.75) Algorithm for Online Topological Ordering",
url = "https://doi.org/10.1007/11785293\_8",
volume = "4059",
year = "2006"
}@inproceedings{DBLP:conf/dimacs/AjwaniMO06,
author = "Ajwani, Deepak and Meyer, Ulrich and Osipov, Vitaly",
editor = "Demetrescu, Camil and Goldberg, Andrew V. and Johnson, David S.",
biburl = "https://dblp.org/rec/conf/dimacs/AjwaniMO06.bib",
booktitle = "The Shortest Path Problem, Proceedings of a {DIMACS} Workshop, Piscataway, New Jersey, USA, November 13-14, 2006",
doi = "10.1090/dimacs/074/11",
pages = "291--307",
publisher = "{DIMACS/AMS}",
series = "{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science",
title = "Breadth First Search on Massive Graphs",
url = "https://doi.org/10.1090/dimacs/074/11",
volume = "74",
year = "2006"
}@inproceedings{DBLP:conf/esa/MeyerZ06,
author = "Meyer, Ulrich and Zeh, Norbert",
editor = "Azar, Yossi and Erlebach, Thomas",
biburl = "https://dblp.org/rec/conf/esa/MeyerZ06.bib",
booktitle = "Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings",
doi = "10.1007/11841036\_49",
pages = "540--551",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "{I/O}-Efficient Undirected Shortest Paths with Unbounded Edge Lengths",
url = "https://doi.org/10.1007/11841036\_49",
volume = "4168",
year = "2006"
}@inproceedings{DBLP:conf/swat/BrodalFMZ04,
author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Meyer, Ulrich and Zeh, Norbert",
editor = "Hagerup, Torben and Katajainen, Jyrki",
biburl = "https://dblp.org/rec/conf/swat/BrodalFMZ04.bib",
booktitle = "Algorithm Theory - {SWAT} 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings",
doi = "10.1007/978-3-540-27810-8\_41",
pages = "480--492",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths",
url = "https://doi.org/10.1007/978-3-540-27810-8\_41",
volume = "3111",
year = "2004"
}@inproceedings{DBLP:conf/icalp/ArgeMT04,
author = "Arge, Lars and Meyer, Ulrich and Toma, Laura",
editor = {D{\'{\i}}az, Josep and Karhum{\"{a}}ki, Juhani and Lepist{\"{o}}, Arto and Sannella, Donald},
biburl = "https://dblp.org/rec/conf/icalp/ArgeMT04.bib",
booktitle = "Automata, Languages and Programming: 31st International Colloquium, {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings",
doi = "10.1007/978-3-540-27836-8\_15",
pages = "146--157",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs",
url = "https://doi.org/10.1007/978-3-540-27836-8\_15",
volume = "3142",
year = "2004"
}@article{DBLP:journals/jal/Meyer03,
author = "Meyer, Ulrich",
biburl = "https://dblp.org/rec/journals/jal/Meyer03.bib",
doi = "10.1016/S0196-6774(03)00046-4",
journal = "J. Algorithms",
number = "1",
pages = "91--134",
title = "Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds",
url = "https://doi.org/10.1016/S0196-6774(03)00046-4",
volume = "48",
year = "2003"
}@article{DBLP:journals/jgaa/ArgeMTZ03,
author = "Arge, Lars and Meyer, Ulrich and Toma, Laura and Zeh, Norbert",
biburl = "https://dblp.org/rec/journals/jgaa/ArgeMTZ03.bib",
doi = "10.7155/jgaa.00063",
journal = "J. Graph Algorithms Appl.",
number = "2",
pages = "105--129",
title = "On External-Memory Planar Depth First Search",
url = "https://doi.org/10.7155/jgaa.00063",
volume = "7",
year = "2003"
}@article{DBLP:journals/jal/MeyerS03,
author = "Meyer, Ulrich and Sanders, Peter",
biburl = "https://dblp.org/rec/journals/jal/MeyerS03.bib",
doi = "10.1016/S0196-6774(03)00076-2",
journal = "J. Algorithms",
number = "1",
pages = "114--152",
title = "[Delta]-stepping: a parallelizable shortest path algorithm",
url = "https://doi.org/10.1016/S0196-6774(03)00076-2",
volume = "49",
year = "2003"
}@inproceedings{DBLP:conf/ipps/Meyer02,
author = "Meyer, Ulrich",
biburl = "https://dblp.org/rec/conf/ipps/Meyer02.bib",
booktitle = "16th International Parallel and Distributed Processing Symposium {(IPDPS} 2002), 15-19 April 2002, Fort Lauderdale, FL, USA, CD-ROM/Abstracts Proceedings",
doi = "10.1109/IPDPS.2002.1015582",
publisher = "{IEEE} Computer Society",
title = "Buckets Strike Back: Improved Parallel Shortest Paths",
url = "https://doi.org/10.1109/IPDPS.2002.1015582",
year = "2002"
}@phdthesis{DBLP:books/daglib/0009356,
author = "Meyer, Ulrich",
biburl = "https://dblp.org/rec/books/daglib/0009356.bib",
school = {Saarland University, Saarbr{\"{u}}cken, Germany},
title = "Design and analysis of sequential and parallel single-source shortest-paths algorithms",
url = "http://scidok.sulb.uni-saarland.de/volltexte/2004/207/index.html",
year = "2002"
}@inproceedings{DBLP:conf/dagstuhl/KatrielM02,
author = "Katriel, Irit and Meyer, Ulrich",
editor = "Meyer, Ulrich and Sanders, Peter and Sibeyn, Jop F.",
biburl = "https://dblp.org/rec/conf/dagstuhl/KatrielM02.bib",
booktitle = "Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002]",
doi = "10.1007/3-540-36574-5\_4",
pages = "62--84",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Elementary Graph Algorithms in External Memory",
url = "https://doi.org/10.1007/3-540-36574-5\_4",
volume = "2625",
year = "2002"
}@inproceedings{DBLP:conf/esa/MehlhornM02,
author = "Mehlhorn, Kurt and Meyer, Ulrich",
editor = {M{\"{o}}hring, Rolf H. and Raman, Rajeev},
biburl = "https://dblp.org/rec/conf/esa/MehlhornM02.bib",
booktitle = "Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings",
doi = "10.1007/3-540-45749-6\_63",
pages = "723--735",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "External-Memory Breadth-First Search with Sublinear {I/O}",
url = "https://doi.org/10.1007/3-540-45749-6\_63",
volume = "2461",
year = "2002"
}@inproceedings{DBLP:conf/spaa/SibeynAM02,
author = "Sibeyn, Jop F. and Abello, James and Meyer, Ulrich",
editor = "Rosenberg, Arnold L. and Maggs, Bruce M.",
biburl = "https://dblp.org/rec/conf/spaa/SibeynAM02.bib",
booktitle = "Proceedings of the Fourteenth Annual {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} 2002, Winnipeg, Manitoba, Canada, August 11-13, 2002",
doi = "10.1145/564870.564917",
pages = "282--292",
publisher = "{ACM}",
title = "Heuristics for semi-external depth first search on directed graphs",
url = "https://doi.org/10.1145/564870.564917",
year = "2002"
}@article{DBLP:journals/jal/MeyerS02,
author = "Meyer, Ulrich and Sibeyn, Jop F.",
biburl = "https://dblp.org/rec/journals/jal/MeyerS02.bib",
doi = "10.1006/jagm.2001.1200",
journal = "J. Algorithms",
number = "1",
pages = "1--19",
title = "Oblivious Gossiping on Tori",
url = "https://doi.org/10.1006/jagm.2001.1200",
volume = "42",
year = "2002"
}@inproceedings{DBLP:conf/soda/Meyer01,
author = "Meyer, Ulrich",
editor = "Kosaraju, S. Rao",
biburl = "https://dblp.org/rec/conf/soda/Meyer01.bib",
booktitle = "Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}",
pages = "87--88",
publisher = "{ACM/SIAM}",
title = "External memory {BFS} on undirected graphs with bounded degree",
url = "http://dl.acm.org/citation.cfm?id=365411.365422",
year = "2001"
}@inproceedings{DBLP:conf/europar/Meyer01,
author = "Meyer, Ulrich",
editor = "Sakellariou, Rizos and Keane, John A. and Gurd, John R. and Freeman, Len",
biburl = "https://dblp.org/rec/conf/europar/Meyer01.bib",
booktitle = "Euro-Par 2001: Parallel Processing, 7th International Euro-Par Conference Manchester, {UK} August 28-31, 2001, Proceedings",
doi = "10.1007/3-540-44681-8\_49",
pages = "343--351",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs",
url = "https://doi.org/10.1007/3-540-44681-8\_49",
volume = "2150",
year = "2001"
}@article{DBLP:journals/ijcga/CrauserFMMR01,
author = "Crauser, Andreas and Ferragina, Paolo and Mehlhorn, Kurt and Meyer, Ulrich and Ramos, Edgar A.",
biburl = "https://dblp.org/rec/journals/ijcga/CrauserFMMR01.bib",
doi = "10.1142/S0218195901000523",
journal = "Int. J. Comput. Geometry Appl.",
number = "3",
pages = "305--337",
title = "Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems",
url = "https://doi.org/10.1142/S0218195901000523",
volume = "11",
year = "2001"
}@inproceedings{DBLP:conf/soda/Meyer01a,
author = "Meyer, Ulrich",
editor = "Kosaraju, S. Rao",
biburl = "https://dblp.org/rec/conf/soda/Meyer01a.bib",
booktitle = "Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, {USA}",
pages = "797--806",
publisher = "{ACM/SIAM}",
title = "Single-source shortest-paths on arbitrary directed graphs in linear average-case time",
url = "http://dl.acm.org/citation.cfm?id=365411.365784",
year = "2001"
}@inproceedings{DBLP:conf/ki/EdelkampM01,
author = "Edelkamp, Stefan and Meyer, Ulrich",
editor = "Baader, Franz and Brewka, Gerhard and Eiter, Thomas",
biburl = "https://dblp.org/rec/conf/ki/EdelkampM01.bib",
booktitle = "{KI} 2001: Advances in Artificial Intelligence, Joint German/Austrian Conference on AI, Vienna, Austria, September 19-21, 2001, Proceedings",
doi = "10.1007/3-540-45422-5\_13",
pages = "169--184",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Theory and Practice of Time-Space Trade-Offs in Memory Limited Search",
url = "https://doi.org/10.1007/3-540-45422-5\_13",
volume = "2174",
year = "2001"
}@article{DBLP:journals/jea/BrengelCFM00,
author = "Brengel, Klaus and Crauser, Andreas and Ferragina, Paolo and Meyer, Ulrich",
biburl = "https://dblp.org/rec/journals/jea/BrengelCFM00.bib",
doi = "10.1145/351827.384259",
journal = "{ACM} Journal of Experimental Algorithmics",
pages = "17",
title = "An Experimental Study of Priority Queues in External Memory",
url = "https://doi.org/10.1145/351827.384259",
volume = "5",
year = "2000"
}@inproceedings{DBLP:conf/europar/MeyerS00,
author = "Meyer, Ulrich and Sanders, Peter",
editor = {Bode, Arndt and Ludwig, Thomas and Karl, Wolfgang and Wism{\"{u}}ller, Roland},
biburl = "https://dblp.org/rec/conf/europar/MeyerS00.bib",
booktitle = "Euro-Par 2000, Parallel Processing, 6th International Euro-Par Conference, Munich, Germany, August 29 - September 1, 2000, Proceedings",
doi = "10.1007/3-540-44520-X\_61",
pages = "461--470",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Parallel Shortest Path for Arbitrary Graphs",
url = "https://doi.org/10.1007/3-540-44520-X\_61",
volume = "1900",
year = "2000"
}@inproceedings{DBLP:conf/mfcs/CrauserMMS98,
author = "Crauser, Andreas and Mehlhorn, Kurt and Meyer, Ulrich and Sanders, Peter",
editor = "Brim, Lubos and Gruska, Jozef and Zlatuska, Jir{\'{\i}}",
biburl = "https://dblp.org/rec/conf/mfcs/CrauserMMS98.bib",
booktitle = "Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings",
doi = "10.1007/BFb0055823",
pages = "722--731",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "A Parallelization of Dijkstra's Shortest Path Algorithm",
url = "https://doi.org/10.1007/BFb0055823",
volume = "1450",
year = "1998"
}@inproceedings{DBLP:conf/esa/MeyerS98,
author = "Meyer, Ulrich and Sanders, Peter",
editor = "Bilardi, Gianfranco and Italiano, Giuseppe F. and Pietracaprina, Andrea and Pucci, Geppino",
biburl = "https://dblp.org/rec/conf/esa/MeyerS98.bib",
booktitle = "Algorithms - {ESA} '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings",
doi = "10.1007/3-540-68530-8\_33",
pages = "393--404",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Delta-Stepping: {A} Parallel Single Source Shortest Path Algorithm",
url = "https://doi.org/10.1007/3-540-68530-8\_33",
volume = "1461",
year = "1998"
}@inproceedings{DBLP:conf/europar/MeyerS98,
author = "Meyer, Ulrich and Sibeyn, Jop F.",
editor = "Pritchard, David J. and Reeve, Jeff",
biburl = "https://dblp.org/rec/conf/europar/MeyerS98.bib",
booktitle = "Euro-Par '98 Parallel Processing, 4th International Euro-Par Conference, Southampton, UK, September 1-4, 1998, Proceedings",
doi = "10.1007/BFb0057964",
pages = "1040--1046",
publisher = "Springer",
series = "Lecture Notes in Computer Science",
title = "Gossiping Large Packets on Full-Port Tori",
url = "https://doi.org/10.1007/BFb0057964",
volume = "1470",
year = "1998"
}@inproceedings{DBLP:conf/compgeom/CrauserFMMR98,
author = "Crauser, Andreas and Ferragina, Paolo and Mehlhorn, Kurt and Meyer, Ulrich and Ramos, Edgar A.",
editor = "Janardan, Ravi",
biburl = "https://dblp.org/rec/conf/compgeom/CrauserFMMR98.bib",
booktitle = "Proceedings of the Fourteenth Annual Symposium on Computational Geometry, Minneapolis, Minnesota, USA, June 7-10, 1998",
doi = "10.1145/276884.276914",
pages = "259--268",
publisher = "{ACM}",
title = "Randomized External-Memory Algorithms for Some Geometric Problems",
url = "https://doi.org/10.1145/276884.276914",
year = "1998"
}@inproceedings{DBLP:conf/dimacs/CrauserFMMR98,
author = "Crauser, Andreas and Ferragina, Paolo and Mehlhorn, Kurt and Meyer, Ulrich and Ramos, Edgar A.",
editor = "Abello, James M. and Vitter, Jeffrey Scott",
biburl = "https://dblp.org/rec/conf/dimacs/CrauserFMMR98.bib",
booktitle = "External Memory Algorithms, Proceedings of a {DIMACS} Workshop, New Brunswick, New Jersey, USA, May 20-22, 1998",
doi = "10.1090/dimacs/050/07",
pages = "131--138",
publisher = "{DIMACS/AMS}",
series = "{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science",
title = "{I/O}-optimal computation of segment intersections",
url = "https://doi.org/10.1090/dimacs/050/07",
volume = "50",
year = "1998"
}@inproceedings{DBLP:conf/ipps/KaufmannMS97,
author = "Kaufmann, Michael and Meyer, Ulrich and Sibeyn, Jop F.",
biburl = "https://dblp.org/rec/conf/ipps/KaufmannMS97.bib",
booktitle = "11th International Parallel Processing Symposium {(IPPS} '97), 1-5 April 1997, Geneva, Switzerland, Proceedings",
doi = "10.1109/IPPS.1997.580918",
pages = "315--319",
publisher = "{IEEE} Computer Society",
title = "Matrix Transpose on Meshes: Theory and Practice",
url = "https://doi.org/10.1109/IPPS.1997.580918",
year = "1997"
}@MastersThesis{UlrichMeyerMaster1995,
author = "Meyer, Ulrich",
title = "Deterministische Simulation einer {PRAM} auf Gitterrechnern",
school = "Universität des Saarlandes",
year = "1995"
}@inproceedings{DBLP:conf/eurosim/MeyerS95,
author = "Meyer, Ulrich and Sibeyn, Jop F.",
editor = "Breitenecker, Felix and Husinsky, Irmgard",
biburl = "https://dblp.org/rec/conf/eurosim/MeyerS95.bib",
booktitle = "EUROSIM'96, Simulation Congress, Proceedings of the 1995 {EUROSIM} Conference, Vienna, Austria, 11-15 September 1995",
pages = "285--290",
publisher = "Elsevier",
title = "Simulating the Simulator: Deterministic {PRAM} Simulation on a Mesh Simulator",
year = "1995"
}@inproceedings{DBLP:conf/spdp/KaufmannMS94,
author = "Kaufmann, Michael and Meyer, Ulrich and Sibeyn, Jop F.",
biburl = "https://dblp.org/rec/conf/spdp/KaufmannMS94.bib",
booktitle = "Proceedings of the Sixth {IEEE} Symposium on Parallel and Distributed Processing, {SPDP} 1994, Dallas, Texas, {USA} , October 26-29, 1994",
doi = "10.1109/SPDP.1994.346110",
pages = "664--671",
publisher = "{IEEE} Computer Society",
title = "Towards practical permutation routing on meshes",
url = "https://doi.org/10.1109/SPDP.1994.346110",
year = "1994"
}