Search

Michael Sagraloff DEPT. 1 Algorithms and ComplexityPhone +49 681 9325-1006Email msagralo@mpi-inf.mpg.deInternet www.mpi-inf.mpg.de/departments/d1/areas/software.html Distributed Algorithms for Fault-tolerant [...] in Geometric Computing Solving systems of polynomial equations poses a fundamental problem of algorithmic mathematics. For m given polynomials in n variables, all points in n-dimensional space should be [...] Computing” primarily investigates such systems as they typically arise from geometric problems. Most algorithms from computational geometry or computer-aided design require such exact calculations with geometric

polyhedral theory will be introduced. The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will [...] Bertsimas and John N. Tsitsiklis. Optimization Approximation Algorithms Introduction to Geometric Complexity Theory Reading Group Algorithms [...] Research Departments Algorithms and Complexity Teaching Optimization Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer Lectures: Tuesday + Thursday, 14:00 - 16:00, E1.3 HS003;

polyhedral theory will be introduced. The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will [...] Research Departments Algorithms and Complexity Teaching Summer 2025 Discrete Optimization Discrete Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer , Sander Borst Lectures: [...] 024 in E1 4) Credits: 9 Prerequisites: Basics in linear algebra, discrete mathematics, calculus, algorithms, and complexity. At Saarland University these topics are covered in the bachelor courses Mathematik

Energy Efficient Algorithms From Routing to Pricing and Learning: Why Are They Hard to Compute? Computation of Equilibrium Prices Rule-based Product Confi guration Approximation Algorithms for Profi t-maximizing [...] t-maximizing Pricing Problems Query Complexity: From Theory of Evolutionary Algorithms to Mastermind Optimality in Matching Problems

er 16/17 Wintersemester 15/16 Wintersemester 14/15 Randomized Algorithms and Probabilistic Analysis of Algorithms Approximation Algorithms Ideen und Konzepte der Informatik [...] Research Departments Algorithms and Complexity Teaching Winter 2022/23 Ideen und Konzepte der Informatik Ideen und Konzepte der Informatik Veranstaltung für Studierende anderer Fakultäten, 2+2 Neue Ku

Research Departments Algorithms and Complexity Seminars Our Seminars Algorithms with Predictions Talks by invited experts on learning-augmented algorithms. more Quantum Lecture Series Our series of talks

Departments Algorithms and Complexity Teaching Summer 2023 Teaching - Summer 2023 Techniques for Counting Problems Advanced Course (2+1). Lecturers: Jacob Focke, Philip Wellnitz more Parametrized Algorithms (external) [...] Roohani Sharma, Hans Simon, Shreyas Srinivas more Techniques for Counting Problems Parametrized Algorithms (external) Seminar: Foundations of Machine Learning

polyhedral theory will be introduced. The simplex algorithm and the ellipsoid method will be presented. The lecture concludes with exact and approximation algorithms for NP-hard optimization problems. There will [...] Research Departments Algorithms and Complexity Teaching Summer 2024 Discrete Optimization Discrete Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer Lectures: Wednesday + Thursday [...] 023 in E1 4) Credits: 9 Prerequisites: Basics in linear algebra, discrete mathematics, calculus, algorithms, and complexity. At Saarland University these topics are covered in the bachelor courses Mathematik

nrathi@mpi-inf.mpg.de Research Interests Computational Social Choice Theory Algorithmic Game Theory Approximation Algorithms Publications Publications of Dr. Nidhi Rathi Recent Positions 2021 - 2023 P [...] Research Departments Algorithms and Complexity People Nidhi Rathi Dr. Nidhi Rathi Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 311D

Wrap-Up Slides Literature Algorithms and Data Structures Approximation Algorithms Theory of Distributed Systems Ideen und Konzepte der Informatik Reading Group Algorithms Algorithmic Lower Bound Techniques [...] Research Departments Algorithms and Complexity Teaching Optimization and Entrepreneurship Optimization and Entrepreneurship Seminar Basic Information Given by: Andreas Karrenbauer Time: Tuesday, 2:15 PM