Computational aspects of infinite-duration games

2021/41/B/ST6/03914

Keywords

Descriptors

  • ST6_006: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier
  • ST6_004: Metody formalne, teoretyczne podstawy informatyki w tym informatyka teoretyczna, algorytmy kwantowe

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Uniwersytet Warszawski, Wydział Matematyki, Informatyki i Mechaniki

Voivodeship: mazowieckie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr hab. Paweł Czesław Parys

Number of co-investigators in the project: 8

Call

OPUS 21 – announced on 2021-03-15

Amount awarded
937 570 PLN
Project start date
2022-01-21
Project end date
2027-01-20
Project duration
60 months (the same as in the proposal)
Project status
Pending project

Project description

Download the project description in a pdf file

Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

Articles in post-conference publications (6)

  1. Improved Complexity Analysis of Quasi-Polynomial Algorithms Solving Parity Games

    Authors:
    Paweł Parys, Aleksander Wiącek
    Conference:
    Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023 (year: 2023, volume: Unity of Logic and Computation - 19th Conference on Computability in Europe, CiE 2023, pages: 275-286), Publisher: Springer
    Date:
    conference 24-28.07.2023
    Status:
    Published
    DOI:
    10.1007/978-3-031-36978-0_22 – link to the publication
  2. Uniformisation of Regular Relations in First-Order Logic with Two Variables

    Authors:
    Nathan Lhote, Vincent Michielini, Michał Skrzypczak
    Conference:
    Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, Tallinn, Estonia, July 8-11, 2024 (year: 2024, volume: 39th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2024, pages: 54:1-54:13), Publisher: ACM
    Date:
    conference 8-11.07.2024
    Status:
    Published
    DOI:
    10.1145/3661814.3662114 – link to the publication
  3. Languages Given by Finite Automata over the Unary Alphabet

    Authors:
    Wojciech Czerwiński, Maciej Dębski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michał Skrzypczak, Frank Stephan, Christopher Tan
    Conference:
    43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, December 18-20, 2023, IIIT Hyderabad, Telangana, India (year: 2023, volume: 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2023), pages: 22:1-22:20), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference 18-20.122023
    Status:
    Published
    DOI:
    10.4230/LIPIcs.FSTTCS.2023.22 – link to the publication
  4. Parity Games of Bounded Tree-Depth

    Authors:
    Konrad Staniszewski
    Conference:
    31st EACSL Annual Conference on Computer Science Logic, CSL 2023, February 13-16, 2023, Warsaw, Poland (year: 2023, volume: 31st EACSL Annual Conference on Computer Science Logic (CSL 2023), pages: 33:1-33:20), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference 13-16.02.2023
    Status:
    Published
    DOI:
    10.4230/LIPIcs.CSL.2023.33 – link to the publication
  5. The Probabilistic Rabin Tree Theorem

    Authors:
    Damian Niwiński, Paweł Parys, Michał Skrzypczak
    Conference:
    Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science (year: 2023, volume: 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2023), pages: 46035), Publisher: ACM/IEEE
    Date:
    conference 26-29.06.2023
    Status:
    Published
    DOI:
    10.1109/LICS56636.2023.10175800 – link to the publication
  6. Positionality in Σ⁰₂ and a Completeness Result

    Authors:
    Pierre Ohlmann, Michał Skrzypczak
    Conference:
    41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, March 12-14, 2024, Clermont-Ferrand, France (year: 2024, volume: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024, pages: 54:1-54:18), Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
    Date:
    conference 12-14.03.2024
    Status:
    Published
    DOI:
    10.4230/LIPIcs.STACS.2024.54 – link to the publication

« New search

Graphic design and implementation: Jakub Piotrowski