Prof. Dr. Ulrich Meyer
Institute for Computer Science
60325 Frankfurt am Main
PACE 2023 Winner
The PACE 2023 challenge asked to design and implement practical algorithms to compute contraction sequences of small twin-width. Together with our collegues from Holger Dell’s group and Frank Kammer’s group we contributed the winning heuristic solver and placed second in the exact track.
Staff News - Dr. Hung Tran
SEA 2023 Submission accepted
Our article on the engineering of parallel in-place shuffling was accepted for presentation at SEA 2023.
STOC 2023 Submission accepted
Algorithms for Big Data Book finally published
Our LNCS survey book on the results of the SPP 1736 Priority Programme Algorithm for Big Data has just been published. Check it out here, open access!
WALCOM 2023 Submission accepted
ALENEX 2023 Submission accepted
Book Chapter in Massive Graph Analytics (Bader ed.) finally in print
DFG SPP 1736 (Algorithms for Big Data) Final Event
We have celebrated the final meeting of our Big Data priority programme in Frankfurt with many members of both funding phases and and various invited talks.
IPDPS 2022 Submission accepted
ALENEX 2022 Submission accepted
FOCS 2021 Submission accepted
ICALP 2021 Submission accepted
Staff News - Dr. Manuel Penschuck
Staff News - Daniel Allendorf
Daniel Allendorf joined the group as a new PhD student. Welcome, Daniel!
SEA 2021 Submission accepted
Staff News - Dr. David Hammer
David Hammer successfully defended his PhD thesis with results on algorithms and data structures for external memory, efficient simulation of population protocols, and first insights for fragile computing. Congrats, Dr. Hammer!!! The joint PhD project was carried out under the Cotutelle framework between the University of Southern Denmark (SDU) and Goethe University Frankfurt.
ESA 2020 Submission accepted
Forthcoming special issue on Algorithms for Big Data @ it - Information Technology
Ziawasch Abedjan and Ulrich Meyer have been guest-editing a new Special Issue of Algorithms for Big Data appearing soon in it - Information Technology. It contains several articles from reseachers working at the Berlin Big Data Center / BIFOLD and the DFG SPP 1736 Priority Programme on Algorithms for Big Data. Group members Manuel Penschuck and Ulrich Meyer contributed an update on Large-Scale Graph Generation.
DFG Research Group FOR 2975
The German Research Foundation grants funding for a new research group on Algorithms, Dynamics, and Information Flow in Networks. The group is headed by Martin Hoefer, the participating PIs are Petra Berenbrink (Hamburg), Nils Bertschinger, Amin Coja Oghlan, Ulrich Meyer (all Frankfurt/M), and Tobias Friedrich (HPI/Potsdam). The goals are to advance our understanding of dynamic processes on networks and their relation to efficient algorithms, e.g., in the analysis of spreading processes, distributed network algorithms, network generation models, as well as application domains such as financial markets.
Staff News - Dr. David Veith
Staff News - Elizaveta Kovalevskaya
ESA Test of Time Award
Ulrich Meyer (together with Peter Sanders from KIT) will be awarded the Test-of-Time Award of the European Symposium on Algorithms 2019 (ESA) at ESA 2020.
ESA is the premier European conference on algorithms research. The ESA Test-of-Time Award (ToTA) recognizes excellent papers in algorithms research that were published in the ESA proceedings 19 to 21 years ago which are still influential and stimulating for the field today. For 2019, the Award Committee selected
SPP Spring School on Algorithms for Big Data
We successfully coorganized and ran the 3rd Indo-German Spring School on Algorithms for Big Data. It took place at IIIT Delhi and SNU during Feb 10th-13 2020.
Information on speakers and programme be found on the webpage of the school. There is also a report with pictures on the webpage of the DFG Office India.
STOC 2020 Submission accepted
Two Best Paper Awards at ESA 2019
Group members Manuel Penschuck and Ulrich Meyer coauthored two best papers at ESA 2019:
- On the Fragile Complexity of Comparison-Based Algorithms (Best Paper in Track A)
- On Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs (Best Paper in Track B)