Regular Temporal Cost Functions. - Thomas Colcombet; Denis Kuperberg; Sylvain Lombardy (ICALP (2), 2010)

Quasi-Weak Cost Automata: A New Variant of Weakness. - Denis Kuperberg; Michael Vanden Boom (FSTTCS, 2011)

Linear temporal logic for regular cost functions. - Denis Kuperberg (STACS, 2011)

On the Expressive Power of Cost Logics over Infinite Words. - Denis Kuperberg; Michael Vanden Boom (ICALP (2), 2012)

Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. - Peter Dybjer; Denis Kuperberg (Ann. Pure Appl. Log., 2012)

Deciding the weak definability of Büchi definable tree languages. - Thomas Colcombet; Denis Kuperberg; Christof Löding; Michael Vanden Boom (CSL, 2013)

Nondeterminism in the Presence of a Diverse or Unknown Future. - Udi Boker; Denis Kuperberg; Orna Kupferman; Michal Skrzypczak (ICALP (2), 2013)

ACME: Automata with Counters, Monoids and Equivalence. - Nathanaël Fijalkow; Denis Kuperberg (ATVA, 2014)

Two-way cost automata and cost logics over infinite trees. - Achim Blumensath; Thomas Colcombet; Denis Kuperberg; Pawel Parys; Michael Vanden Boom (CSL-LICS, 2014)

Regular Sensing. - Shaull Almagor; Denis Kuperberg; Orna Kupferman (FSTTCS, 2014)

The Sensing Cost of Monitoring and Synthesis. - Shaull Almagor; Denis Kuperberg; Orna Kupferman (FSTTCS, 2015)

Trading Bounds for Memory in Games with Counters. - Nathanaël Fijalkow; Florian Horn 001; Denis Kuperberg; Michal Skrzypczak (ICALP (2), 2015)

On Determinisation of Good-for-Games Automata. - Denis Kuperberg; Michal Skrzypczak (ICALP (2), 2015)

On Finite Domains in First-Order Linear Temporal Logic. - Denis Kuperberg; Julien Brunel; David Chemouil (ATVA, 2016)

Soundness in Negotiations. - Javier Esparza; Denis Kuperberg; Anca Muscholl; Igor Walukiewicz (CONCUR, 2016)

Lightweight specification and analysis of dynamic systems with rich configurations. - Nuno Macedo 001; Julien Brunel; David Chemouil; Alcino Cunha; Denis Kuperberg (SIGSOFT FSE, 2016)

Cost Functions Definable by Min/Max Automata. - Thomas Colcombet; Denis Kuperberg; Amaldev Manuel; Szymon Torunczyk (STACS, 2016)

Varieties of Cost Functions. - Laure Daviaud; Denis Kuperberg; Jean-Éric Pin (STACS, 2016)

Sensing as a Complexity Measure. - Shaull Almagor; Denis Kuperberg; Orna Kupferman (DCFS, 2017)

Stamina: Stabilisation Monoids in Automata Theory. - Nathanaël Fijalkow; Hugo Gimbert; Edon Kelmendi; Denis Kuperberg (CIAA, 2017)

Büchi Good-for-Games Automata Are Efficiently Recognizable. - Marc Bagnol; Denis Kuperberg (FSTTCS, 2018)

Width of Non-deterministic Automata. - Denis Kuperberg; Anirban Majumdar 002 (STACS, 2018)

Eventually Safe Languages. - Simon Iosti; Denis Kuperberg (DLT, 2019)

Coinductive Algorithms for Büchi Automata. - Denis Kuperberg; Laureline Pinault; Damien Pous (DLT, 2019)

Kleene Algebra with Hypotheses. - Amina Doumane; Denis Kuperberg; Damien Pous; Cécilia Pradic (FoSSaCS, 2019)

Cyclic Proofs and Jumping Automata. - Denis Kuperberg; Laureline Pinault; Damien Pous (FSTTCS, 2019)

Computing the Width of Non-deterministic Automata. - Denis Kuperberg; Anirban Majumdar 002 (Log. Methods Comput. Sci., 2019)

On the Succinctness of Alternating Parity Good-For-Games Automata. - Udi Boker; Denis Kuperberg; Karoliina Lehtinen; Michal Skrzypczak (FSTTCS, 2020)

Regular Resynchronizability of Origin Transducers Is Undecidable. - Denis Kuperberg; Jan Martens 001 (MFCS, 2020)

On Succinctness and Recognisability of Alternating Good-for-Games Automata. - Udi Boker; Denis Kuperberg; Karoliina Lehtinen; Michal Skrzypczak (CoRR, 2020)

Bouncing threads for infinitary and circular proofs. - David Baelde; Amina Doumane; Denis Kuperberg; Alexis Saurin (CoRR, 2020)

Positive First-order Logic on Words. - Denis Kuperberg (LICS, 2021)

Cyclic proofs, system t, and the power of contraction. - Denis Kuperberg; Laureline Pinault; Damien Pous (Proc. ACM Program. Lang., 2021)

Cyclic Proofs for Transfinite Expressions. - Emile Hazard; Denis Kuperberg (CSL, 2022)

Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. - David Baelde; Amina Doumane; Denis Kuperberg; Alexis Saurin (LICS, 2022)

Explorable Automata. - Emile Hazard; Denis Kuperberg (CSL, 2023)

Positive First-order Logic on Words and Graphs. - Denis Kuperberg (Log. Methods Comput. Sci., 2023)

Positive and monotone fragments of FO and LTL. - Denis Kuperberg; Quentin Moreau (CoRR, 2024)

Explorable Parity Automata. - Emile Hazard; Olivier Idir; Denis Kuperberg (CoRR, 2024)

On the Minimisation of Deterministic and History-Deterministic Generalised (Co)Büchi Automata. - Antonio Casares; Olivier Idir; Denis Kuperberg; Corto Mascle; Aditya Prakash 002 (CSL, 2025)

Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs. - Thomas Colcombet; Amina Doumane; Denis Kuperberg (ICALP, 2025)

Positive and Monotone Fragments of FO and LTL. - Simon Iosti; Denis Kuperberg; Quentin Moreau (ICALP, 2025)