Search

Departments ALGO Algorithmic Game Theory Approximation Algorithms Fine-Grained Complexity and Algorithm Design Graph Algorithms Optimization Parameterized and Counting Algorithms and Complexity Robust Learning [...] Research Departments Algorithms and Complexity Research Algorithmic Game Theory Algorithmic Game Theory In the problems we consider in this group, we usually try to optimize some goal function while dealing [...] dealing with selfish agents that may have separate and conflicting goals, and that may lie to us in order to improve their own goal function. In algorithmic mechanism design, we ensure that it is in the best

Research Departments Algorithms and Complexity Teaching Algorithmic Game Theory, Mechanism Design and Computational Economics Algorithmic Game Theory, Mechanism Design and Computational Economics Advanced [...] from enrolled students: Basic knowledge in algorithms and data structure, and their analyses Calculus, including the concepts of limit, convergence, derivative and integration Basic Linear Algebra, including [...] ns, expected values and variances) Linear programming and its duality Basic max-flow algorithm, e.g. Ford-Fulkerson For more details about course logistics, syllabus, exercises and examinations, click

Research Departments Algorithms and Complexity Teaching Algorithmic Lower Bound Techniques Algorithmic Lower Bound Techniques Seminar Basic Information Given by: Parinya Chalermsook (and featured a guest lecture [...] TBD Mar 24 Aditi Papers Algorithms and Data Structures Approximation Algorithms Theory of Distributed Systems Ideen und Konzepte der Informatik Reading Group Algorithms Algorithmic Lower Bound Techniques [...] design efficient algorithms for our problems, e.g., we cannot achieve an efficient approximation algorithm that is 10% close to the optimal, or an exact algorithm that is both space and time efficient.

Research Departments Automation of Logic Teaching Summer 2023 Algorithmic Quantifier Elimination Algorithmic Quantifier Elimination Overview Lecturer Thomas Sturm Start Tuesday, April 11, 2023, 8: 30 a [...] (Excercises) Wednesdays 8: 30– 10 s.t. Place Room 630, building E1 5(6 th floor) for both lecture and excercises Prerequisites Basic knowledge in computer science, in particular in first-order logic Quantifier [...] Nutshell Consider the formula ∀x ∃y (x² + xy + b > 0 ∧ x + ay² + b ≤ 0). A quantifier elimination algorithm for the real numbers can compute an equivalent formula without any quantifiers, which in this example

Departments Algorithms and Complexity Department 1: Algorithms and Complexity The department investigates a broad range of theoretical and practical aspects of modern algorithmics. We design new algorithms and [...] scheduling, and several others. more More information Parameterized and Counting Algorithms and Complexity Parameterized complexity analyzes how different parameters of the input influence the complexity of hard [...] learning algorithms have many applications. Can we theoretically prove they are consistent and helpful? We focus on two paradigms: algorithmic stability and algorithms with predictions. Stable algorithms, which

Research Departments Algorithms and Complexity Teaching Winter 2020/21 Algorithms and Data Structures Algorithms and Data Structures Core Course, 4+2 Basic Information Lectures: Tuesday + Friday, 10:15 [...] saarland/algodat_20/ Algorithms and Data Structures How To Clock Your Computer Ideen und Konzepte der Informatik Property Testing Theory of Distributed Systems Topics in Algorithmic Game Theory and Economics [...] Lecturers: Karl Bringmann and Marvin Künnemann First lecture: 3 November 2020 Assistant: Alejandro Cassis Credits: 9 Prerequisites: The course requires basic knowledge in algorithms and data structures as covered

Research Departments Algorithms and Complexity Teaching Algorithms and Data Structures Algorithms and Data Structures Core Course, 4+2 Basic Information Lectures: Monday + Wednesday, 16:15 - 18:00, E1 [...] Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2005 (ISBN: 0-321-29535-8) [Meh] K. Mehlhorn, Data Structures and Algorithms, Vols. 1-3, Springer Verlag, 1984 [Koz] D. Kozen, The Design and Analysis [...] 29: Subset Sum Algorithm Algorithms and Data Structures Theory of Distributed Systems Grundzüge von Algorithmen und Datenstrukturen Ideen und Konzepte der Informatik Reading Group Algorithms

Departments Algorithms and Complexity Teaching Algorithms and Data Structures Algorithms and Data Structures Core Course, 4+2 Basic Information Lectures: 29.02. - 01.04.2016 Lecturers: Martin Hoefer and Raimund [...] Analysis of Algorithms, Springer Verlag, 1991 Algorithms and Data Structures Approximation Algorithms Theory of Distributed Systems Ideen und Konzepte der Informatik Reading Group Algorithms Algorithmic Lower [...] Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2005 (ISBN: 0-321-29535-8) [Meh] K. Mehlhorn, Data Structures and Algorithms, Vols. 1-3, Springer Verlag, 1984 [Koz] D. Kozen, The Design and Analysis

Research Departments Algorithms and Complexity Teaching Winter 2018/19 Algorithms on Directed Graphs Algorithms on Digraphs Advanced Course 2+1 Basic Information Given by: Saeed Amiri and Will Rosenbaum (Featured [...] Konzepte der Informatik Multivariate Algorithmics Randomized and Approximation Algorithms Algorithms on Directed Graphs Theory of Distributed Systems Reading Group Algorithms [...] solutions to the homework and 25 percent productive appearance in the exercise sessions) Prerequisites: The course will assume a basic background in graph theory and the analysis of algorithms, but we will not

Research Departments Algorithms and Complexity 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