Denis Kuperberg

57 papers A* 4A 5B 9C 3Journal 22Unranked 14

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Generalised Quantifiers Based on Rabin-Mostowski Index. STACS Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak
2026	J	`jnl`	Generalised Quantifiers Based on Rabin-Mostowski Index. CoRR Denis Kuperberg, Damian Niwinski, Pawel Parys, Michal Skrzypczak
2025	B	`conf`	On the Minimisation of Deterministic and History-Deterministic Generalised (Co)Büchi Automata. CSL Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash
2025	A*	`conf`	Positive and Monotone Fragments of FO and LTL. ICALP Simon Iosti, Denis Kuperberg, Quentin Moreau
2025	A*	`conf`	Tree Algebras and Bisimulation-Invariant MSO on Finite Graphs. ICALP Thomas Colcombet, Amina Doumane, Denis Kuperberg
2024	J	`jnl`	Explorable Parity Automata. CoRR Emile Hazard, Olivier Idir, Denis Kuperberg
2024	J	`jnl`	On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata. CoRR Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash
2024	J	`jnl`	Positive and monotone fragments of FO and LTL. CoRR Denis Kuperberg, Quentin Moreau
2024	J	`jnl`	Tree algebras and bisimulation-invariant MSO on finite graphs. CoRR Thomas Colcombet, Amina Doumane, Denis Kuperberg
2023	B	`conf`	Explorable Automata. CSL Emile Hazard, Denis Kuperberg
2023	J	`jnl`	Positive First-order Logic on Words and Graphs. Log. Methods Comput. Sci. Denis Kuperberg
2022	A*	`conf`	Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
2022	B	`conf`	Cyclic Proofs for Transfinite Expressions. CSL Emile Hazard, Denis Kuperberg
2022	J	`jnl`	Positive First-order Logic on Words and Graphs. CoRR Denis Kuperberg
2021	J	`jnl`	Coinductive Algorithms for Büchi Automata. Fundam. Informaticae Denis Kuperberg, Laureline Pinault, Damien Pous
2021	J	`jnl`	Cyclic proofs, system t, and the power of contraction. Proc. ACM Program. Lang. Denis Kuperberg, Laureline Pinault, Damien Pous
2021	A*	`conf`	Positive First-order Logic on Words. LICS Denis Kuperberg
2021	J	`jnl`	Positive first-order logic on words. CoRR Denis Kuperberg
2020	J	`jnl`	Bouncing threads for infinitary and circular proofs. CoRR David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin
2020	J	`jnl`	On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
2020	—	`conf`	On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
2020	J	`jnl`	On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak
2020	B	`conf`	Regular Resynchronizability of Origin Transducers Is Undecidable. MFCS Denis Kuperberg, Jan Martens
2020	J	`jnl`	Regular resynchronizability of origin transducers is undecidable. CoRR Denis Kuperberg, Jan Martens
2019	C	`conf`	Coinductive Algorithms for Büchi Automata. DLT Denis Kuperberg, Laureline Pinault, Damien Pous
2019	J	`jnl`	Computing the Width of Non-deterministic Automata. Log. Methods Comput. Sci. Denis Kuperberg, Anirban Majumdar
2019	—	`conf`	Cyclic Proofs and Jumping Automata. FSTTCS Denis Kuperberg, Laureline Pinault, Damien Pous
2019	C	`conf`	Eventually Safe Languages. DLT Simon Iosti, Denis Kuperberg
2019	B	`conf`	Kleene Algebra with Hypotheses. FoSSaCS Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic
2019	J	`jnl`	Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. Shaull Almagor, Denis Kuperberg, Orna Kupferman
2018	—	`conf`	Büchi Good-for-Games Automata Are Efficiently Recognizable. FSTTCS Marc Bagnol, Denis Kuperberg
2018	J	`jnl`	Computing the Width of Non-deterministic Automata. CoRR Denis Kuperberg, Anirban Majumdar
2018	J	`jnl`	Soundness in negotiations. Log. Methods Comput. Sci. Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
2018	A	`conf`	Width of Non-deterministic Automata. STACS Denis Kuperberg, Anirban Majumdar
2017	—	`conf`	Sensing as a Complexity Measure. DCFS Shaull Almagor, Denis Kuperberg, Orna Kupferman
2017	J	`jnl`	Soundness in negotiations. CoRR Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
2017	C	`conf`	Stamina: Stabilisation Monoids in Automata Theory. CIAA Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
2017	J	`jnl`	Trading Bounds for Memory in Games with Counters. CoRR Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
2016	A	`conf`	Cost Functions Definable by Min/Max Automata. STACS Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk
2016	—	`conf`	Lightweight specification and analysis of dynamic systems with rich configurations. SIGSOFT FSE Nuno Macedo, Julien Brunel, David Chemouil, Alcino Cunha, Denis Kuperberg
2016	B	`conf`	On Finite Domains in First-Order Linear Temporal Logic. ATVA Denis Kuperberg, Julien Brunel, David Chemouil
2016	B	`conf`	Soundness in Negotiations. CONCUR Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz
2016	A	`conf`	Varieties of Cost Functions. STACS Laure Daviaud, Denis Kuperberg, Jean-Éric Pin
2015	—	`conf`	On Determinisation of Good-for-Games Automata. ICALP (2) Denis Kuperberg, Michal Skrzypczak
2015	—	`conf`	The Sensing Cost of Monitoring and Synthesis. FSTTCS Shaull Almagor, Denis Kuperberg, Orna Kupferman
2015	—	`conf`	Trading Bounds for Memory in Games with Counters. ICALP (2) Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
2014	B	`conf`	ACME: Automata with Counters, Monoids and Equivalence. ATVA Nathanaël Fijalkow, Denis Kuperberg
2014	J	`jnl`	Linear Temporal Logic for Regular Cost Functions. Log. Methods Comput. Sci. Denis Kuperberg
2014	—	`conf`	Regular Sensing. FSTTCS Shaull Almagor, Denis Kuperberg, Orna Kupferman
2014	—	`conf`	Two-way cost automata and cost logics over infinite trees. CSL-LICS Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom
2013	B	`conf`	Deciding the weak definability of Büchi definable tree languages. CSL Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom
2013	—	`conf`	Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak
2012	J	`jnl`	Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. Ann. Pure Appl. Log. Peter Dybjer, Denis Kuperberg
2012	—	`conf`	On the Expressive Power of Cost Logics over Infinite Words. ICALP (2) Denis Kuperberg, Michael Vanden Boom
2011	A	`conf`	Linear temporal logic for regular cost functions. STACS Denis Kuperberg
2011	—	`conf`	Quasi-Weak Cost Automata: A New Variant of Weakness. FSTTCS Denis Kuperberg, Michael Vanden Boom
2010	—	`conf`	Regular Temporal Cost Functions. ICALP (2) Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy