Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases
Research Departments Algorithms and Complexity Teaching Summer 2020 Parameterized Algorithms Parameterized Algorithms Advanced Course, 2+1 Basic Information Lectures: (Online) Friday 2PM to 4PM at Room [...] are small. We will see several algorithmic techniques to design fast algorithms for NP-hard problems in this setting, called Fixed Parameter Tractable (FPT) algorithms , as well as an overview of the lower-bound [...] comparison. The aim would be to obtain algorithms that have a small dependence on the database size, but possibly a larger dependence on the query size. Such an algorithm would be fast when the queries are
5719 Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust [...] Research Departments Algorithms and Complexity Research Parameterized and Counting Algorithms and Complexity Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different [...] different parameters of the input influence the complexity of hard algorithmic problems. The general goal is to show with fixed-parameter tractability results that the combinatorial explosion can be confined
Coupette Assistant Professor Aalto University, Helsinki (after having graduated with the MPI-Inf Dep. Algorithms and Complexity, Saarbruecken, Germany) Daniel Wagner Researcher DE-CIX Management GmbH, Frankfurt
Robert Strzodka, graduated 2013 - thesis: Cache based Optimization of Stencil Computations An Algorithmic Approach), now at IBM Andreas Baak (co-advised wth Meinard Mueller, graduated 2012 - thesis: R
Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases
Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6
Research Departments Algorithms and Complexity Offers Postdoc Application Postdoc and Group Leader positions We are looking for applicants from all areas of algorithms and complexity as well as related [...] related areas (such as algorithm engineering, high-performance computing, theory of computation, and quantum computing). Researchers of several nationalities work in the Algorithms and Complexity Department [...] the campus of Saarland University in Saarbruecken, Germany. We maintain close collaborations with algorithms and complexity researchers in other institutes on the campus, including the Department of Computer
Research Departments Algorithms and Complexity Offers Postdoc Position: ERC SYSTEMATICGRAPH project Postdoc positions are available at the Algorithms & Complexity group of the Max Planck Institute for [...] search for tractable algorithmic graph problems into a systematic and methodological framework: instead of focusing on specific sporadic problems, we intend to obtain a unified algorithmic understanding by [...] admit efficient algorithms and proves that all the other cases are computationally hard. Achieving such a complete understanding for a family of problems requires the joint effort of algorithm design (to identify
the axioms of E, substituting equals for equals. In 1970, Knuth and Bendix presented a completion algorithm, which later was extended to unfailing completion, as described e.g. by Bachmair et al . Parameterized
