Lenzen and Johannes Bund more Parametrized Algorithms (external) Advanced Course (2+2). Given by: Dániel Marx and Roohani Sharma more Reading Group Algorithms: Continuous Methods for Combinatorial Problems [...] Theory Metastability-Containing Synchronization Circuits (external) Parametrized Algorithms (external) Reading Group Algorithms: Continuous Methods for Combinatorial Problems Ideen und Konzepte der Informatik [...] Research Departments Algorithms and Complexity Teaching Winter 2021/22 Winter 2021/22 Fine-Grained Complexity Theory Advanced Course (2+2). Given by: Karl Bringmann more Metastability-Containing Synch
efficient algorithm) or the problem is NP-hard (by providing a reduction). For practical purposes however the label "polynomial-time" is too coarse: it may make a huge difference whether an algorithm runs in [...] Research Departments Algorithms and Complexity Teaching Summer 2018 Selected Topics in Fine-Grained Complexity Theory Selected Topics in Fine-Grained Complexity Theory Seminar Lecturers: Karl Bringmann [...] the above lectures - in this case, you should bring a strong background in complexity theory and algorithms. News Room change: On June 12 we will be in HS 001, building E 1 3 Talk on June 19 is canceled
Research Departments Algorithms and Complexity Teaching Winter 2020/21 Winter Semester 2020/21 Algorithms and Data Structures Core Course (4+2). Lecturers: Karl Bringmann and Marvin Künnemann more How [...] Christoph Lenzen and Corinna Coupette more Topics in Algorithmic Game Theory and Economics Advanced Course (2+1). Lecturer: Pieter Kleer more Algorithms and Data Structures How To Clock Your Computer Ideen [...] Ideen und Konzepte der Informatik Property Testing Theory of Distributed Systems Topics in Algorithmic Game Theory and Economics
performance gains are instantaneous and the learning curve is almost flat. Algorithmic reinterpretation : More elaborate algorithms which involve substantial connectivity changes cannot be directly translated [...] Novel Abstraction : Many existing algorithmic solutions find their roots in early days of computing where the hardware of the day dictated the nature of successful algorithms. As a result, the serial nature [...] embarrassingly parallel task or require dedicated platform-specific engineering efforts for each single algorithm. Our research aims to streamline geometry processing operations from the ground up in an intuitive
Research Departments Algorithms and Complexity Teaching Summer 2019 Reading Group Algorithms Reading Group Algorithms Seminar Basic Information Given by: Kurt Mehlhorn , Bhaskar Ray Chaudhury Time: (Wednesday [...] Manurangsi [Jul10] An Illuminating Algorithm for the Light Bulb Problem Josh Alman [Jul17] Separating Monotone VP and VNP Amir Yehudayoff Distributed and Sequential Graph Algorithms Fine-Grained Complexity Theory [...] Meeting: April, 10th Credits: 7 credit points Prerequisites: You should bring a solid background in algorithms and data structures. This is an advanced seminar. The papers are challenging and a proper preparation
fast) Euclidean algorithm, greatest common divisor, factorization, comparison and representation of algebraic numbers. polynomial root finding : Sturm sequences, Descartes algorithm, Newton-Raphson method [...] method, complex root finding. modular arithmetic and modular algorithms : evaluation, interpolation, Chinese Remainder Algorithm, prime number tests. discrete and Fast Fourier transformation : fast mul [...] Pollack, Marie-Françoise Roy: Algorithms in Real Algebraic Geometry . Springer, 2003, ISBN 3-540-00973-6. Available for download here . Yap, Chee: Fundamental Problems in Algorithmic Algebra . Oxford University
based on their DNA, has an algorithm that takes O(n^2) time. Using a fine-grained reduction it can be shown that faster algorithms for edit distance also imply a faster algorithm for the Boolean Satisfiability [...] Quantum algorithms for search and optimization Quantum algorithms are useful for a variety of problems in search and optimization. This line of work started with Grover's quantum search algorithm which achieved [...] almost all known lower bounds for quantum algorithms are defined in terms of query complexity, which doesn’t help much for problems for which the best-known algorithms take super-linear time. Therefore, employing
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 [...] computational hardness: approximation, moderately exponential-time, and parameterized algorithms (external) Geometric algorithms with limited resources Optimization [...] Research Departments Algorithms and Complexity Teaching Summer 2021 Optimization Optimization Core Course, 4+2 Basic Information Lecturer: Andreas Karrenbauer Lectures: Wednesday + Thursday, 14:00 - 16:00
D1 Algorithms and Complexity Prof. Danupon Na Nongkai, Ph.D. Algorithmic Game Theory Prof. Dr. Kurt Mehlhorn Approximation Algorithms Evangelos Kipouridis, PhD Fine-Grained Complexity and Algorithm Design [...] investigates a broad range of theoretical and practical aspects of modern algorithmics. We design new algorithms and algorithmic techniques, analyze their efficiency and the quality of their solutions, [...] Design Prof. Dr. Karl Bringmann Graph Algorithms Prof. Dr. Danupon Na Nongkai, PhD Optimization Dr. Andreas Karrenbauer Parameterized and Counting Algorithms and Complexity Karol Wegrzycki, PhD Robust Learning
Mining MG-FSM is a scalable, distributed (i.e., shared nothing) algorithm for frequent sequence mining (FSM) on MapReduce. The algorithm can handle so-called "gap constraints", which can be used to limit [...] MG-FSM is multiple orders of magnitude faster than baseline algorithms for general gap-constrained FSM and is competitive to state-of-the-art algorithms for n-gram mining. For more information, please refer [...] extending the notion of item-based partitioning, which underlies a number of frequent pattern mining algorithms to gap-contrained frequent sequence mining. Our experiments, in which we mined more than 1 billion
