Denis Kuperberg

Cited by

	All	Since 2019
Citations	644	441
h-index	14	11
i10-index	19	11

120

201120122013201420152016201720182019202020212022202320243 17 16 15 25 42 43 36 55 57 49 93 102 85

Public access

View all

11 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Michał SkrzypczakUniwersytet WarszawskiVerified email at mimuw.edu.pl
Orna KupfermanProfessor of Computer Science, The Hebrew UniversityVerified email at cs.huji.ac.il
Damien PousCNRSVerified email at ens-lyon.fr
David ChemouilONERA DTIS & Université fédérale de ToulouseVerified email at onera.fr
Julien BrunelONERAVerified email at onera.fr
Udi BokerComputer Science, Reichman University, Herzliya, IsraelVerified email at idc.ac.il
Nuno MacedoDEI @ FEUP & HASLab @ INESC TECVerified email at inesctec.pt
Alcino CunhaHASLab, INESC TEC and Universidade do MinhoVerified email at di.uminho.pt
Shaull AlmagorAssistant Professor, TechnionVerified email at cs.technion.ac.il
Nathanaël FijalkowCNRS, LaBRI, Bordeaux, and University of WarsawVerified email at labri.fr
Karoliina LehtinenCNRS, Aix-Marseille Université, LISVerified email at lis-lab.fr
Paweł ParysUniwersytet WarszawskiVerified email at mimuw.edu.pl
Achim BlumensathMasaryk University BrnoVerified email at mail.muni.cz
Szymon ToruńczykUniversity of WarsawVerified email at mimuw.edu.pl
Amaldev ManuelIndian Institute of Technology GoaVerified email at iitgoa.ac.in
Jean-Eric PinCNRSVerified email at liafa.univ-paris-diderot.fr
Laure DaviaudUniversity of East AngliaVerified email at uea.ac.uk
Florian HornChargé de Recherches, IRIF, CNRS & Université Paris CitéVerified email at irif.fr
Jan MartensEindhoven University of TechnologyVerified email at tue.nl
Javier EsparzaProfessor of Computer Science, Technical University of MunichVerified email at in.tum.de

Denis Kuperberg

CNRS, ENS Lyon, Plume Team

Verified email at ens-lyon.fr - Homepage


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Lightweight specification and analysis of dynamic systems with rich configurations N Macedo, J Brunel, D Chemouil, A Cunha, D Kuperberg Proceedings of the 2016 24th ACM SIGSOFT International Symposium on …, 2016	97	2016
On determinisation of good-for-games automata D Kuperberg, M Skrzypczak International Colloquium on Automata, Languages, and Programming, 299-310, 2015	68	2015
Nondeterminism in the Presence of a Diverse or Unknown Future U Boker, D Kuperberg, O Kupferman, M Skrzypczak Icalp, 2013	43	2013
Büchi good-for-games automata are efficiently recognizable M Bagnol, D Kuperberg 38th IARCS Annual Conference on Foundations of Software Technology and …, 2018	35	2018
Deciding the weak definability of Büchi definable tree languages T Colcombet, D Kuperberg, C Löding, MV Boom CSL, 2013	35	2013
Linear temporal logic for regular cost functions D Kuperberg Logical Methods in Computer Science 10, 2014	31	2014
Bouncing threads for circular and non-wellfounded proofs--Towards compositionality with circular proofs (Extended version) D Baelde, A Doumane, D Kuperberg, A Saurin CNRS, 2022	30*	2022
Cyclic proofs, system T, and the power of contraction D Kuperberg, L Pinault, D Pous Proceedings of the ACM on Programming Languages 5 (POPL), 1-28, 2021	25	2021
Kleene algebra with hypotheses A Doumane, D Kuperberg, D Pous, P Pradic International Conference on Foundations of Software Science and Computation …, 2019	25	2019
Quasi-weak cost automata: A new variant of weakness D Kuperberg, M Vanden Boom IARCS Annual Conference on Foundations of Software Technology and …, 2011	25	2011
On the expressive power of cost logics over infinite words D Kuperberg, M Vanden Boom International Colloquium on Automata, Languages, and Programming, 287-298, 2012	23	2012
Computing the width of non-deterministic automata D Kuperberg, A Majumdar Logical Methods in Computer Science 15, 2019	20*	2019
Two-way cost automata and cost logics over infinite trees A Blumensath, T Colcombet, D Kuperberg, P Parys, MV Boom Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference …, 2014	18	2014
Regular temporal cost functions T Colcombet, D Kuperberg, S Lombardy International Colloquium on Automata, Languages, and Programming, 563-574, 2010	15	2010
Coinductive algorithms for Büchi automata D Kuperberg, L Pinault, D Pous Fundamenta Informaticae 180 (4), 351-373, 2021	12	2021
On the succinctness of alternating parity good-for-games automata U Boker, D Kuperberg, K Lehtinen, M Skrzypczak arXiv preprint arXiv:2009.14437, 2020	12	2020
Cyclic proofs for transfinite expressions E Hazard, D Kuperberg 30th EACSL Annual Conference on Computer Science Logic (CSL 2022), 23, 2022	11	2022
On finite domains in first-order linear temporal logic D Kuperberg, J Brunel, D Chemouil International Symposium on Automated Technology for Verification and …, 2016	11	2016
Cost functions definable by min/max automata T Colcombet, D Kuperberg, A Manuel, S Toruńczyk 33rd International Symposium on Theoretical Aspects of Computer Science …, 2016	10	2016
Cyclic Proofs and jumping automata D Kuperberg, L Pinault, D Pous FSTTCS, 2019	9	2019

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors