You are not logged in | Log in


Home page

List of talks

  • Jan. 13, 2021, 2 p.m.
    Aleksander Mądry (MIT)
    Machine Learning: A Robustness Perspective
    See here to register and for more details. Course summary: Machine learning has made tremendous progress over the last decade. It's thus tempting to believe that ML techniques are a "silver bullet", capable of making …

  • March 5, 2020, 2:15 p.m.
    Wim Martens (University of Bayreuth)
    Foundations of Graph Data Management
    Graph-structured data has become very popular recently, because they it is both very flexible and allows to model information closely to how we think about it, i.e., in terms of entities and connections between them. …

  • Jan. 9, 2020, 4 p.m.
    Nikhil Srivastava (UC Berkeley)
    Geometry of Polymomials
    We will discuss the fruitful paradigm of encoding discrete phenomena in complex multivariate polynomials, and understanding them via the interplay of the coefficients, zeros, and function values of these polynomials. Over the last fifteen years, …

  • Nov. 14, 2019, 2:15 p.m.
    Christian Wulff-Nilsen (University of Copenhagen (DIKU))
    Dynamic Graph Algorithms
    Computing shortest paths is a classical algorithmic problem dating back to the 1950s and the algorithms of Dijkstra and Bellman-Ford are typically part of an introductory course on algorithms. One down-side of such algorithms is …

  • Oct. 17, 2019, 2:15 p.m.
    Anuj Dawar (University of Cambridge)
    Symmetric Computation
    The notion of a symmetric algorithm, i.e. one with an explicit combinatorial property that guarantees isomorphism-invariant computation, arises naturally in the context of database theory, finite model theory, circuit complexity, the theory of relational machines, …

  • June 6, 2019, 2:15 p.m.
    Andrzej Wąsowski (IT University of Copenhagen)
    Bugs in Code: Understanding, Detecting, and Fixing
    The course will show the ways in which the software engineering research community approaches research on program correctness. I will present a summary of collaboration with open source projects around understanding historical bugs and building …

  • May 23, 2019, 2:15 p.m.
    Mikołaj Bojańczyk (UW)
    Slightly Infinite Sets
    This lecture is about algorithms which work on objects that are infinite, but still finite enough to admit methods like exhaustive search. For example, one can consider graphs with infinitely many vertices, and where the …

  • Nov. 22, 2018, 2:15 p.m.
    Dan Olteanu (University of Oxford)
    From Joins to Aggregates and Optimization Problems
    The course introduces recent development on solving a host of computational problems in the database. The unifying theme underlying this development is the use of the structure of the problem to avoid redundancy in data …

  • Oct. 25, 2018, 2:15 p.m.
    Krzysztof Apt (CWI, Netherlands)
    A Crash Course in Strategic Games
    Strategic games deal with the analysis of interaction between rational players, where rationality is understood as utility maximization. In strategic games the players take their actions simultaneously and the utility (payoff) for each player depends …

  • Oct. 18, 2018, 2:15 p.m.
    Cezary Kaliszyk (University of Innsbruck)
    Learning-Assisted Automated Reasoning
    In this course we will look at a number of classical automated reasoning problems and explore to what extent machine learning can be used to solve them. We will start with the basic reasoning calculi: …

  • Sept. 24, 2018, 2:15 p.m.
    Peter Selinger (Dalhousie University)
    Quantum computing
    As an idea, quantum computing has been around for more than 30 years. During most of this time, practical quantum computers were considered a far-in-the-future prospect. Consequently, most research focused on theoretical questions, such as …

  • May 24, 2018, 2:15 p.m.
    Atri Rudra (SUNY University at Buffalo)
    Dense Structured) Matrix Vector Multiplicatio
    We will study the problem of matrix-vector multiplication. In particular, we consider the case when the matrix is dense and structured (but the vector is arbitrary). We will study the arithmetic complexity of this operation …

  • May 10, 2018, 1:15 p.m.
    Daniel Kral (University of Warwick)
    Combinatorial limits
    The theory of combinatorial limits provides analytic tools to represent and analyze large discrete objects. Such tools have found important applications in various areas of computer science and mathematics. They also led to opening new …

  • April 18, 2018, 2:15 p.m.
    Carsten Lutz (University of Bremen)
    Ontology Engineering and Ontological Data Access
    In artificial intelligence, ontologies are used to capture the knowledge of an application domain. They constitute a core component of `intelligent' systems and also play an important role in querying data that is incomplete and …

  • March 15, 2018, 2:15 p.m.
    Marcin Jurdziński (University of Warwick)
    Algorithms for solving parity games
    Parity games have played a fundamental role in automata theory, logic, and their applications to verification and synthesis since early 1990's. Solving parity games is polynomial-time equivalent to checking emptiness of tree automata and to …

  • Jan. 25, 2018, 2:15 p.m.
    Albert Atserias (Universitat Politècnica de Catalunya)
    The Width Method for Resolution and Sums-of-Squares Proofs
    Resolution is a proof system for propositional logic of great practical use. Indeed, virtually all practically-used SAT-solvers are "resolution-based" in the sense that their underlying inference system is Resolution. In particular, when the SAT-solvers halt …

  • Dec. 1, 2017, 2:15 p.m.
    Jakob Rehof (Technische Universität Dortmund)
    A Type-Based Approach to Component-Oriented Synthesis
    The synthesis problem (given a logical specification, to construct a program satisfying the specification) is one of the most challenging problems in computer science. The problem is intrinsically of high computational complexity. Moreover, a no …

  • Oct. 12, 2017, 3 p.m.
    Piotr Faliszewski (AGH)
    Algorithmic Analysis of Elections
    (see for full description) Computational social choice (COMSOC) is an interdisciplinary research that focuses on using methods from computer science, economics, and operations research in the context of group decision making. In this course we …

  • May 18, 2017, 2:45 p.m.
    Gerhard Lauer (University of Goettingen)
    Humanities in the Digital Age
    I give an introduction to digital humanities, encompassing major fields of research. We will go more into detail about exploring texts by computers. Text mining is a fast growing area to use machine for reading …

  • April 27, 2017, 3:30 p.m.
    Bartosz Klin (Uniwersytet Warszawski)
    Computation theory with atoms
    First, a caveat: "atoms" here are mathematical rather than physical entities, so people hoping for some kind of nuclear computation devices will be disappointed. "Computation with atoms" means computation over structures that are infinite, but …