Room Recordings
Name | Thumbnails | Length | Users | Visibility | Formats |
---|---|---|---|---|---|
Richard Combes -- Solving Random Parity Games in Polynomial Time
Recorded on
|
![]() ![]() ![]() |
50 min | 25 |
Public
|
Presentation |
Igor Konnov -- Using TLA+ and Apalache to specify and check the Tendermint light client
Recorded on
|
![]() ![]() ![]() |
1 h 12 min | 23 |
Public
|
Presentation |
Mikael Monet -- Counting Problems over Incomplete Databases
Recorded on
|
![]() ![]() ![]() |
42 min | 24 |
Public
|
Presentation |
Loïc Paulevé -- Boolean networks: semantics, complexity, and abstraction of
quantitative systems
Recorded on
|
![]() ![]() ![]() |
52 min | 15 |
Public
|
Presentation |
Damien Busatto-Gaston -- Monte Carlo Tree Search guided by Symbolic Advice for MDPs
Recorded on
|
![]() ![]() ![]() |
59 min | 14 |
Public
|
Presentation |
Guillermo A. Perez -- Safe Learning for Near Optimal Scheduling
Recorded on
|
![]() ![]() ![]() |
52 min | 19 |
Public
|
Presentation |
Helmut Seidl -- When Is a Bottom-up Deterministic Tree Transducer Top-down Deterministic?
Recorded on
|
![]() ![]() ![]() |
57 min | 25 |
Public
|
Presentation |
Elena Gutierrez -- A Congruence-based Perspective on Automata Minimization Algorithms
Recorded on
|
![]() ![]() ![]() |
46 min | 36 |
Public
|
Presentation |
Ana Ozaki -- Learning Description Logic Ontologies
Recorded on
|
![]() ![]() ![]() |
52 min | 29 |
Public
|
Presentation |
Abhishek De -- A parallel syntax for non-wellfounded proof theory
Recorded on
|
![]() ![]() ![]() |
50 min | 17 |
Public
|
Presentation |
Antoine Amarilli -- Query evaluation on probabilistic data: a story of dichotomies
Recorded on
|
![]() ![]() ![]() |
1 h 4 min | 27 |
Public
|
Presentation |
Thibault Godin -- Order problem for automaton semigroups
Recorded on
|
![]() ![]() ![]() |
1 h 1 min | 49 |
Public
|
Presentation |
Filip Mazowiecki -- On polynomial recursive sequences
Recorded on
|
![]() ![]() ![]() |
1 h 2 min | 33 |
Public
|
Presentation |