Information I am a Postdoctoral Researcher in the AlgorithmsandComplexity Department (D1). I primarily research replicability for machine learning algorithms , from a theoretical perspective. I joined the [...] Forschung Abteilungen AlgorithmsandComplexity People Rex Lei Rex Lei Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Standort E1 4 - 317 Telefon +49 [...] Reading it does not require a mathematical background, and it explains the overall goals of my research. Research Interests Learning Theory Complexity Theory Publications Note: In the theoretical computer
Forschung Abteilungen AlgorithmsandComplexity People Daniel Neuen Dr. Daniel Neuen Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Standort E1 4 - [...] dneuen@mpi-inf.mpg.de Research Interests parameterized complexity graph isomorphism problem and symmetry detection computational group theory graph similarity and graph motifs Publications A list of publications [...] 2023. DOI . Martin Grohe and Daniel Neuen. Canonisation and definability for graphs of bounded rank width. ACM Trans. Comput. Log., 24(1):6:1–6:31, 2023. DOI . Daniel Neuen and Pascal Schweitzer. An exponential
Research Interests Algorithm design and Theoretical Computer Science Graph Algorithms Distributed Algorithms Computational Geometry Algorithmic Game Theory Parameterized Algorithms Publications Towards [...] Forschung Abteilungen AlgorithmsandComplexity People Zahra Parsaeian Zahra Parsaeian Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Standort E1 4 [...] al Geometry (SoCG 2022). List of all publications Teaching Winter 2021 Tutor for Parameterized Algorithms (CS6190) at Indian Institute of Technology Madras, Chennai Several tutoring experiences at Isfahan
Forschung Abteilungen AlgorithmsandComplexity News News ADFOCS 2024 The goal of this year's ADFOCS is to educate people with a TCS background on Algorithmic Game Theory. Details on the summer school
Algorithmic Game Theory Approximation Algorithms Fine-Grained ComplexityandAlgorithm Design Graph Algorithms Optimization Parameterized and Counting AlgorithmsandComplexity Robust Learning [...] Forschung Abteilungen AlgorithmsandComplexity Research Robust Learning Robust Learning Machine learning algorithms have many applications. Can we theoretically prove they are consistent and helpful? We focus [...] stability andalgorithms with predictions. Stable algorithms, which can tolerate changes in their inputs, can inherit many desirable properties such as generalization, differential privacy, and replicability
Forschung Abteilungen AlgorithmsandComplexity Seminars Algorithms with Predictions Algorithms with Predictions Schedule Date Speaker Title November 5 Nicole Megow Non-Clairvoyant Scheduling with Predictions [...] online algorithm that yields enhanced performance when these predictions are sufficiently accurate, and (ii) a classical online algorithm that disregards predictions. Our learning augmented algorithm ass [...] in the popular framework of Algorithms with Predictions, which integrates such error-prone predictions into online algorithm design. We examine various prediction models and error measures, showcasing
Forschung Abteilungen AlgorithmsandComplexity People Marek Sokolowski Marek Sokolowski Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Standort E1 [...] 681 9325 5719 E-mail msokolow@mpi-inf.mpg.de Research Interests graph algorithms dynamic data structures parameterized algorithms structural graph theory Publications See my DBLP . Education October 2020 [...] student at the University of Warsaw, Faculty of Informatics, Mathematics, and Mechanics Dissertation title: Efficient Data Structures and Graph Width Parameters (compiles papers: [1] [2] [3] [4] [5] ) October
