default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDenis Kuperberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c32]Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash:
On the Minimisation of Deterministic and History-Deterministic Generalised (Co)Büchi Automata. CSL 2025: 22:1-22:18- 2024
- [i13]Denis Kuperberg, Quentin Moreau:
Positive and monotone fragments of FO and LTL. CoRR abs/2406.17693 (2024) - [i12]Thomas Colcombet, Amina Doumane, Denis Kuperberg:
Tree algebras and bisimulation-invariant MSO on finite graphs. CoRR abs/2407.12677 (2024) - [i11]Antonio Casares, Olivier Idir, Denis Kuperberg, Corto Mascle, Aditya Prakash:
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata. CoRR abs/2407.18090 (2024) - [i10]Emile Hazard, Olivier Idir, Denis Kuperberg:
Explorable Parity Automata. CoRR abs/2410.23187 (2024) - 2023
- [j8]Denis Kuperberg:
Positive First-order Logic on Words and Graphs. Log. Methods Comput. Sci. 19(3) (2023) - [c31]Emile Hazard, Denis Kuperberg:
Explorable Automata. CSL 2023: 24:1-24:18 - 2022
- [c30]Emile Hazard, Denis Kuperberg:
Cyclic Proofs for Transfinite Expressions. CSL 2022: 23:1-23:18 - [c29]David Baelde
, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs. LICS 2022: 63:1-63:13 - [i9]Denis Kuperberg:
Positive First-order Logic on Words and Graphs. CoRR abs/2201.11619 (2022) - 2021
- [j7]Denis Kuperberg, Laureline Pinault, Damien Pous:
Coinductive Algorithms for Büchi Automata. Fundam. Informaticae 180(4): 351-373 (2021) - [j6]Denis Kuperberg, Laureline Pinault, Damien Pous:
Cyclic proofs, system t, and the power of contraction. Proc. ACM Program. Lang. 5(POPL): 1-28 (2021) - [c28]Denis Kuperberg:
Positive First-order Logic on Words. LICS 2021: 1-13 - [i8]Denis Kuperberg:
Positive first-order logic on words. CoRR abs/2101.01968 (2021) - 2020
- [c27]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-For-Games Automata. FSTTCS 2020: 41:1-41:13 - [c26]Denis Kuperberg, Jan Martens:
Regular Resynchronizability of Origin Transducers Is Undecidable. MFCS 2020: 58:1-58:14 - [i7]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On Succinctness and Recognisability of Alternating Good-for-Games Automata. CoRR abs/2002.07278 (2020) - [i6]Denis Kuperberg, Jan Martens:
Regular resynchronizability of origin transducers is undecidable. CoRR abs/2002.07558 (2020) - [i5]David Baelde, Amina Doumane, Denis Kuperberg, Alexis Saurin:
Bouncing threads for infinitary and circular proofs. CoRR abs/2005.08257 (2020) - [i4]Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-for-Games Automata. CoRR abs/2009.14437 (2020)
2010 – 2019
- 2019
- [j5]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. Int. J. Found. Comput. Sci. 30(6-7): 831-873 (2019) - [j4]Denis Kuperberg, Anirban Majumdar:
Computing the Width of Non-deterministic Automata. Log. Methods Comput. Sci. 15(4) (2019) - [c25]Simon Iosti, Denis Kuperberg:
Eventually Safe Languages. DLT 2019: 192-205 - [c24]Denis Kuperberg, Laureline Pinault, Damien Pous:
Coinductive Algorithms for Büchi Automata. DLT 2019: 206-220 - [c23]Amina Doumane, Denis Kuperberg, Damien Pous, Cécilia Pradic:
Kleene Algebra with Hypotheses. FoSSaCS 2019: 207-223 - [c22]Denis Kuperberg, Laureline Pinault, Damien Pous:
Cyclic Proofs and Jumping Automata. FSTTCS 2019: 45:1-45:14 - 2018
- [j3]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. Log. Methods Comput. Sci. 14(1) (2018) - [c21]Marc Bagnol, Denis Kuperberg:
Büchi Good-for-Games Automata Are Efficiently Recognizable. FSTTCS 2018: 16:1-16:14 - [c20]Denis Kuperberg, Anirban Majumdar:
Width of Non-deterministic Automata. STACS 2018: 47:1-47:14 - [i3]Denis Kuperberg, Anirban Majumdar:
Computing the Width of Non-deterministic Automata. CoRR abs/1811.00483 (2018) - 2017
- [c19]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Sensing as a Complexity Measure. DCFS 2017: 3-15 - [c18]Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg:
Stamina: Stabilisation Monoids in Automata Theory. CIAA 2017: 101-112 - [i2]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in negotiations. CoRR abs/1703.05137 (2017) - [i1]Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. CoRR abs/1709.03121 (2017) - 2016
- [c17]Denis Kuperberg, Julien Brunel, David Chemouil:
On Finite Domains in First-Order Linear Temporal Logic. ATVA 2016: 211-226 - [c16]Javier Esparza, Denis Kuperberg, Anca Muscholl, Igor Walukiewicz:
Soundness in Negotiations. CONCUR 2016: 12:1-12:13 - [c15]Nuno Macedo, Julien Brunel, David Chemouil, Alcino Cunha, Denis Kuperberg:
Lightweight specification and analysis of dynamic systems with rich configurations. SIGSOFT FSE 2016: 373-383 - [c14]Thomas Colcombet, Denis Kuperberg, Amaldev Manuel, Szymon Torunczyk:
Cost Functions Definable by Min/Max Automata. STACS 2016: 29:1-29:13 - [c13]Laure Daviaud, Denis Kuperberg, Jean-Éric Pin:
Varieties of Cost Functions. STACS 2016: 30:1-30:14 - 2015
- [c12]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
The Sensing Cost of Monitoring and Synthesis. FSTTCS 2015: 380-393 - [c11]Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. ICALP (2) 2015: 197-208 - [c10]Denis Kuperberg, Michal Skrzypczak:
On Determinisation of Good-for-Games Automata. ICALP (2) 2015: 299-310 - 2014
- [j2]Denis Kuperberg:
Linear Temporal Logic for Regular Cost Functions. Log. Methods Comput. Sci. 10(1) (2014) - [c9]Nathanaël Fijalkow, Denis Kuperberg:
ACME: Automata with Counters, Monoids and Equivalence. ATVA 2014: 163-167 - [c8]Achim Blumensath, Thomas Colcombet, Denis Kuperberg, Pawel Parys, Michael Vanden Boom:
Two-way cost automata and cost logics over infinite trees. CSL-LICS 2014: 16:1-16:9 - [c7]Shaull Almagor, Denis Kuperberg, Orna Kupferman:
Regular Sensing. FSTTCS 2014: 161-173 - 2013
- [c6]Thomas Colcombet, Denis Kuperberg, Christof Löding, Michael Vanden Boom:
Deciding the weak definability of Büchi definable tree languages. CSL 2013: 215-230 - [c5]Udi Boker, Denis Kuperberg, Orna Kupferman, Michal Skrzypczak:
Nondeterminism in the Presence of a Diverse or Unknown Future. ICALP (2) 2013: 89-100 - 2012
- [j1]Peter Dybjer, Denis Kuperberg:
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation. Ann. Pure Appl. Log. 163(2): 122-131 (2012) - [c4]Denis Kuperberg, Michael Vanden Boom:
On the Expressive Power of Cost Logics over Infinite Words. ICALP (2) 2012: 287-298 - 2011
- [c3]Denis Kuperberg, Michael Vanden Boom:
Quasi-Weak Cost Automata: A New Variant of Weakness. FSTTCS 2011: 66-77 - [c2]Denis Kuperberg:
Linear temporal logic for regular cost functions. STACS 2011: 627-636 - 2010
- [c1]Thomas Colcombet, Denis Kuperberg, Sylvain Lombardy:
Regular Temporal Cost Functions. ICALP (2) 2010: 563-574
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-05 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
