You are not logged in | log in

Wydział Matematyki, Informatyki i Mechaniki Uniwersytetu Warszawskiego

  • Skala szarości
  • Wysoki kontrast
  • Negatyw
  • Podkreślenie linków
  • Reset

PhD Open

List of talks

  • 2021-01-13, 14:00, zoom

    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 progress on any real-world problem they are applied to. But is tha...

  • 2020-03-05, 14:15, 5440

    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. These lectures will touch upon some classical results on graph data management, aft...

  • 2020-01-09, 16:00, 5440

    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, this perspective has led to several breakthroughs in c...

  • 2019-11-14, 14:15, 5440

    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 that they assume the graph to be static. However, real-life networks of...

  • 2019-10-17, 14:15, 5440

    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, and theory of linear programming. T...

  • 2019-06-06, 14:15, 5440

    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 tools for detecting new bugs. In the first part, I wil...

  • 2019-05-23, 14:15, 5440

    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 edge relation is represented in some kind of finite way (e.g. by a formula of l...

  • 2018-11-22, 14:15, 5440

    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 representation and computation. The first part overviews recent work on worst-c...

  • 2018-10-25, 14:15, 5440

    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 on the resulting joint action. The course will fo...

  • 2018-10-18, 14:15, 4420

    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: tableaux and resolution and their extensions to reasoning with orderings and equality. We will surv...