Organizatorzy

prof. dr hab. Mikołaj Bojańczyk
prof. dr hab. Damian Niwiński

Informacje

środy, 14:15 , sala: 5440

Dziedziny badań

Lista referatów

22 maja 2024 14:15
Jakub Kozik (Jagiellonian University)
Choosability version of Thue's theorem on nonrepetitive sequences
Pattern avoidance is a deeply studied problem within the field of combinatorics on words. One of the seminal results of this area is the theorem of Thue which asserts that there exists an infinite word …
15 maja 2024 14:15
Igor Walukiewicz (CNRS, LaBRI, Bordeaux University)
Rethinking Partial-Order Methods
The goal of partial-order methods is to speed up explicit state exploration of concurrent systems. The state space of these systems grows exponentially with the number of components. Yet, explicit state exploration remains one of …
24 kwietnia 2024 14:15
Gorav Jindal (Max Planck Institute for Software Systems)
Sign Me Up: PosSLP, Sign Testing, and Polynomials
Given an integer, deciding its positivity may appear trivial initially. However, this problem becomes more compelling when the integer is presented in a compact form, as opposed to being explicitly represented as a bit string. …
17 kwietnia 2024 14:15
Shuo Pang (University of Copenhagen)
Supercritical and Robust Trade-offs for Resolution Depth Versus Width and Weisfeiler–Leman
We give the first robust resolution trade-offs for which low width implies depth superlinear in the formula size. We show analogous results for the Weisfeiler–Leman algorithm, which also translate into trade-offs between number of variables …
10 kwietnia 2024 14:15
Clotilde Biziere (University of Warsaw / ENS Paris)
Reachability in 2-dimensional Branching Vector Addition Systems with States
Vector addition systems with states (VASS) are finite-state machines equipped with a finite number of counters ranging over nonnegative integers. Operations on counters are limited to incrementation and decrementation. Their central algorithmic problem is reachability: …
3 kwietnia 2024 14:15
Tomasz Gogacz (University of Warsaw)
TBA
TBA
27 marca 2024 14:15
Tim Seppelt (RWTH Aachen University)
Homomorphism Indistinguishability: Characterisations, Closure, Complexity
In 1967, Lovász proved that two graphs G and H are isomorphic iff they are homomorphism indistinguishable over the the family of all graphs, i.e. for all graphs F the number of homomorphisms from F …
20 marca 2024 14:15
Jingjie Yang (University of Oxford)
Niezmiennicze podprzestrzenie przestrzeni liniowych orbitowo skończonego wymiaru (Equivariant subspaces of orbit-finite-dimensional vector spaces)
In their LICS21 paper, Bojańczyk, Klin, and Moerman gave an equivalence algorithm for weighted orbit-finite automata: they construct a chain of configuration spaces that are closed under both linear combinations and atom permutations; crucially, termination …
13 marca 2024 14:15
Alexandra Rogova
Connecting graph and relational query languages
Practical query languages for graph and relational databases are based on similar concepts: In the former, base relations are extracted from graphs, and in the latter, they are given as input. In both, these base …
6 marca 2024 14:15
Szymon Toruńczyk (MIMUW)
Combinatorial Characterizations of Monadically Dependent Graph Classes
We provide the first two combinatorial characterizations of monadically dependent graph classes. This yields the following dichotomy. On the structure side, we characterize monadic dependence by a property called flip-breakability. This notion generalizes the notions …
28 lutego 2024 14:15
Michał Pilipczuk (MIMUW)
First-Order Model Checking on Monadically Stable Graph Classes
A graph class C is monadically stable if one cannot interpret arbitrary long linear orders in colored graphs from C using any fixed first-order interpretation. We prove that on any monadically stable class, the model-checking …
21 lutego 2024 14:15
Vincent Michielini (University of Warsaw)
Complexity of Maslov's Class K-bar
Maslov’s class K-bar is a fragment of First-Order Logic consisting of formulae in NNF whose variables occurring in the different atoms obey a certain pattern [*]. It embeds many well-known fragments, such as the two-variable …
14 lutego 2024 14:15
Daniel Smertnig (University of Ljubljana)
On the linear hull of a weighted automaton
Previous work reduces the problem of deciding whether a weighted finite automaton (WFA) over a field is equivalent to a deterministic, respectively, unambiguous, WFA to the computation of the linear hull. The linear hull is …
7 lutego 2024 14:15
Mikołaj Bojańczyk (University of Warsaw)
On function spaces for orbit-finite sets
Joint work with Tito Nguyen and Rafał Stefański. Orbit-finite sets are a generalisation of finite sets, and as such support many operations allowed for finite sets, such as pairing, quotienting, or taking subsets. However, they …
31 stycznia 2024 14:15
Cristian Riveros Jaeger (Pontificia Universidad Católica de Chile (PUC Chile))
#NFA admits an FPRAS
#NFA is the following problem over non-deterministic finite automata (NFA) over words: you receive as input an NFA A and a length N (in unary), and you want to count the number of words of …