Ranko Lazic

Cited by

	All	Since 2018
Citations	2207	884
h-index	24	16
i10-index	37	24

180

135

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202312 23 28 13 40 47 30 34 46 65 78 111 99 107 76 103 82 143 131 127 171 143 164 136 142

Public access

View all

17 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Bill Roscoe (A.W. Roscoe)Professor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Marcin JurdzińskiUniversity of Warwick, Department of Computer ScienceVerified email at warwick.ac.uk
Filip MazowieckiUniversity of WarsawVerified email at mimuw.edu.pl
Sylvain SchmitzUniversité Paris CitéVerified email at irif.fr
Slawomir LasotaUniversity of Warsaw, prof. of computer scienceVerified email at mimuw.edu.pl
James WorrellProfessor of Computer Science, Oxford UniversityVerified email at cs.ox.ac.uk
Aleksandar S. DimovskiMother Teresa University, SkopjeVerified email at unt.edu.mk
Jerome LerouxCNRS researcher, LaBRI, FranceVerified email at labri.fr
Patrick TotzkeUniversity of LiverpoolVerified email at liverpool.ac.uk
Joel OuaknineDirector, Max Planck Institute for Software Systems (MPI-SWS), Saarland Informatics CampusVerified email at mpi-sws.org
Wojciech CzerwinskiUniversity of WarsawVerified email at mimuw.edu.pl
Laure DaviaudUniversity of East AngliaVerified email at uea.ac.uk
Matthias EnglertUniversity of WarwickVerified email at warwick.ac.uk
Dan R. GhicaProfessor of Semantics of Programming Languages, University of BirminghamVerified email at cs.bham.ac.uk
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Arnaud SangnierMaître de conférences (Assistant Professor), IRIF, Université Paris CitéVerified email at irif.fr
Piotrek HofmanUniversity of WarsawVerified email at mimuw.edu.pl
Christoph HaaseUniversity of OxfordVerified email at cs.ox.ac.uk
Paweł ParysUniwersytet WarszawskiVerified email at mimuw.edu.pl
Guillermo A. PérezAssociate Professor, University of AntwerpVerified email at uantwerp.be

Ranko Lazic

Department of Computer Science, University of Warwick

Verified email at warwick.ac.uk - Homepage

theoretical computer science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
LTL with the freeze quantifier and register automata S Demri, R Lazić ACM Transactions on Computational Logic (TOCL) 10 (3), 1-30, 2009	365	2009
A semantic study of data independence with applications to model checking. RS Lazic University of Oxford, 1999	187*	1999
The reachability problem for Petri nets is not elementary W Czerwiński, S Lasota, R Lazić, J Leroux, F Mazowiecki Journal of the ACM (JACM) 68 (1), 1-28, 2020	154	2020
Nets with tokens which carry data R Lazić, T Newcomb, J Ouaknine, AW Roscoe, J Worrell Fundamenta Informaticae 88 (3), 251-274, 2008	143	2008
Alternating automata on data trees and XPath satisfiability M Jurdziński, R Lazić ACM Transactions on Computational Logic (TOCL) 12 (3), 19, 2011	116*	2011
Succinct progress measures for solving parity games M Jurdziński, R Lazić 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-9, 2017	107	2017
On the freeze quantifier in constraint LTL: decidability and complexity S Demri, R Lazić, D Nowak Information and Computation 205 (1), 2-24, 2007	103	2007
The covering and boundedness problems for branching vector addition systems S Demri, M Jurdziński, O Lachish, R Lazić Journal of Computer and System Sciences 79 (1), 23-38, 2013	75*	2013
Model checking freeze LTL over one-counter automata S Demri, R Lazić, A Sangnier International Conference on Foundations of Software Science and …, 2008	71*	2008
A unifying approach to data-independence R Lazić, D Nowak International Conference on Concurrency Theory, 581-596, 2000	69	2000
Fixed-dimensional energy games are in pseudo-polynomial time M Jurdziński, R Lazić, S Schmitz International Colloquium on Automata, Languages, and Programming, 260-272, 2015	60	2015
Nonelementary complexities for branching VASS, MELL, and extensions R Lazić, S Schmitz ACM Transactions on Computational Logic (TOCL) 16 (3), 1-30, 2015	55	2015
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	51	2019
The reachability problem for two-dimensional vector addition systems with states M Blondin, M Englert, A Finkel, S Göller, C Haase, R Lazić, P McKenzie, ... Journal of the ACM (JACM) 68 (5), 1-43, 2021	49*	2021
Safety alternating automata on data words R Lazić ACM Transactions on Computational Logic (TOCL) 12 (2), 10, 2011	48*	2011
Data-abstraction refinement: A game semantic approach A Dimovski, DR Ghica, R Lazić International Static Analysis Symposium, 102-117, 2005	45*	2005
What makes Petri nets harder to verify: stack or data? R Lazić, P Totzke Concurrency, Security, and Puzzles: Essays Dedicated to Andrew William …, 2017	34*	2017
The ideal view on Rackoff’s coverability technique R Lazić, S Schmitz International Workshop on Reachability Problems, 76-88, 2015	34*	2015
On model checking data-independent systems with arrays without reset RS Lazić, TC Newcomb, AW Roscoe Theory and Practice of Logic Programming 4 (5-6), 659-693, 2004	30	2004
Data Independence with Generalised Predicate Symbols. R Lazic, B Roscoe PDPTA 99, 319-325, 1999	30*	1999

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