Denis Kuperberg

From MaRDI portal
Person:651315

Available identifiers

zbMath Open kuperberg.denisMaRDI QIDQ651315

List of research outcomes





PublicationDate of PublicationType
Bouncing threads for circular and non-wellfounded proofs. Towards compositionality with circular proofs2024-12-06Paper
Explorable automata2024-09-25Paper
Cyclic proofs for transfinite expressions2024-04-10Paper
Positive First-order Logic on Words and Graphs2023-08-26Paper
Cyclic Proofs and Jumping Automata2023-02-03Paper
Büchi Good-for-Games Automata Are Efficiently Recognizable2022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50892282022-07-18Paper
Coinductive algorithms for Büchi automata2021-10-25Paper
Positive first-order logic on words2021-01-06Paper
Width of non-deterministic automata2020-08-05Paper
Kleene algebra with hypotheses2020-01-28Paper
Computing the width of non-deterministic automata2020-01-03Paper
Sensing as a complexity measure2019-12-10Paper
Eventually safe languages2019-10-15Paper
Coinductive algorithms for Büchi automata2019-10-15Paper
On finite domains in first-order linear temporal logic2018-10-25Paper
Two-way cost automata and cost logics over infinite trees2018-04-23Paper
Soundness in negotiations2018-03-21Paper
Varieties of Cost Functions2018-01-24Paper
Cost functions definable by min/max automata2018-01-24Paper
Soundness in negotiations2018-01-23Paper
Sensing as a complexity measure2017-08-31Paper
Stamina: stabilisation monoids in automata theory2017-08-22Paper
The sensing cost of monitoring and synthesis2017-07-13Paper
Regular sensing2017-04-25Paper
Deciding the weak definability of Büchi definable tree languages2017-02-02Paper
ACME: automata with counters, monoids and equivalence2015-12-17Paper
On Determinisation of Good-for-Games Automata2015-11-04Paper
Trading bounds for memory in games with counters2015-11-04Paper
Linear temporal logic for regular cost functions2014-03-24Paper
Nondeterminism in the presence of a diverse or unknown future2013-08-07Paper
On the Expressive Power of Cost Logics over Infinite Words2012-11-01Paper
Quasi-weak cost automata: a new variant of weakness2012-08-31Paper
Linear temporal logic for regular cost functions2012-01-23Paper
Formal neighbourhoods, combinatory Böhm trees, and untyped normalization by evaluation2011-12-12Paper
Regular temporal cost functions2010-09-07Paper

Research outcomes over time

This page was built for person: Denis Kuperberg