Ranko Lazić

1.4k total citations
32 papers, 275 citations indexed

About

Ranko Lazić is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software. According to data from OpenAlex, Ranko Lazić has authored 32 papers receiving a total of 275 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 21 papers in Artificial Intelligence and 5 papers in Software. Recurrent topics in Ranko Lazić's work include Formal Methods in Verification (26 papers), Logic, programming, and type systems (17 papers) and semigroups and automata theory (11 papers). Ranko Lazić is often cited by papers focused on Formal Methods in Verification (26 papers), Logic, programming, and type systems (17 papers) and semigroups and automata theory (11 papers). Ranko Lazić collaborates with scholars based in United Kingdom, France and Poland. Ranko Lazić's co-authors include Stéphane Demri, Marcin Jurdziński, David Nowak, Dubravka Pokrajac, Bill Roscoe, Aleksandar S. Dimovski, Sylvain Schmitz, Ilka Müller, Steven Russell and Arnaud Sangnier and has published in prestigious journals such as Journal of the ACM, BMC Genomics and Advances in Water Resources.

In The Last Decade

Ranko Lazić

24 papers receiving 263 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Ranko Lazić United Kingdom	9	192	192	48	35	27	32	275
Madhavan Mukund India	10	88 0.5×	166 0.9×	35 0.7×	35 1.0×	31 1.1×	28	223
Simone Tini Italy	10	162 0.8×	193 1.0×	32 0.7×	45 1.3×	68 2.5×	54	275
Prasanna Thati United States	5	118 0.6×	118 0.6×	46 1.0×	40 1.1×	6 0.2×	6	174
Mandayam Srivas United States	7	116 0.6×	199 1.0×	94 2.0×	38 1.1×	9 0.3×	32	312
Nai-Wei Lin Taiwan	8	132 0.7×	91 0.5×	41 0.9×	43 1.2×	8 0.3×	16	211
Bas Luttik Netherlands	9	151 0.8×	209 1.1×	50 1.0×	35 1.0×	10 0.4×	44	244
Dorel Lucanu Romania	7	124 0.6×	83 0.4×	66 1.4×	38 1.1×	39 1.4×	47	203
Diego Cazorla Spain	9	68 0.4×	47 0.2×	9 0.2×	76 2.2×	15 0.6×	30	199
António Morgado Portugal	9	190 1.0×	152 0.8×	88 1.8×	92 2.6×	6 0.2×	20	293
Thomas Hune Denmark	8	93 0.5×	189 1.0×	82 1.7×	16 0.5×	5 0.2×	15	229

Countries citing papers authored by Ranko Lazić

Since Specialization

Citations

This map shows the geographic impact of Ranko Lazić's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ranko Lazić with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ranko Lazić more than expected).

Fields of papers citing papers by Ranko Lazić

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ranko Lazić. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ranko Lazić. The network helps show where Ranko Lazić may publish in the future.

Co-authorship network of co-authors of Ranko Lazić

This figure shows the co-authorship network connecting the top 25 collaborators of Ranko Lazić. A scholar is included among the top collaborators of Ranko Lazić based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ranko Lazić. Ranko Lazić is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lazić, Ranko & Sylvain Schmitz. (2020). The ideal view on Rackoff's coverability technique. Information and Computation. 277. 104582–104582.

Englert, Matthias, et al.. (2020). A lower bound for the coverability problem in acyclic pushdown VAS. Information Processing Letters. 167. 106079–106079. 3 indexed citations

Clemente, Lorenzo, et al.. (2019). Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems. ACM Transactions on Computational Logic. 20(3). 1–31.

Lazić, Ranko. (2019). Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk). DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

Jurdziński, Marcin, et al.. (2018). When is containment decidable for probabilistic automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 107. 14. 3 indexed citations

Jurdziński, Marcin & Ranko Lazić. (2017). Succinct progress measures for solving parity games. arXiv (Cornell University). 1–9. 5 indexed citations

Göller, Stefan, et al.. (2016). A Polynomial-Time Algorithm for Reachability in Branching VASS in Dimension One. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Lazić, Ranko, Joël Ouaknine, & James Worrell. (2016). Zeno, Hercules, and the Hydra. ACM Transactions on Computational Logic. 17(3). 1–27. 1 indexed citations

Englert, Matthias, et al.. (2016). Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. Edinburgh Research Explorer. 477–484. 7 indexed citations

10.

Lazić, Ranko & Sylvain Schmitz. (2015). Nonelementary Complexities for Branching VASS, MELL, and Extensions. ACM Transactions on Computational Logic. 16(3). 1–30. 8 indexed citations

11.

Demri, Stéphane, Marcin Jurdziński, Oded Lachish, & Ranko Lazić. (2012). The covering and boundedness problems for branching vector addition systems. Journal of Computer and System Sciences. 79(1). 23–38. 1 indexed citations

12.

Aleksić, J., Ranko Lazić, Ilka Müller, Steven Russell, & Boris Adryan. (2009). Biases in Drosophila melanogaster protein trap screens. BMC Genomics. 10(1). 249–249. 13 indexed citations

13.

Demri, Stéphane & Ranko Lazić. (2009). LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic. 10(3). 1–30. 105 indexed citations

14.

Pokrajac, Dubravka, et al.. (2006). UGROW: A Software Tool for Integrated Urban Water Management. 485. 2 indexed citations

15.

Demri, Stéphane, Ranko Lazić, & David Nowak. (2006). On the freeze quantifier in Constraint LTL: Decidability and complexity. Information and Computation. 205(1). 2–24. 20 indexed citations

16.

Lazić, Ranko. (2005). Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. Electronic Notes in Theoretical Computer Science. 138(3). 3–19. 1 indexed citations

17.

Dimovski, Aleksandar S. & Ranko Lazić. (2005). Software Model Checking Based on Game Semantics and CSP. Electronic Notes in Theoretical Computer Science. 128(6). 105–125.

18.

Lazić, Ranko, et al.. (2004). Polymorphic systems with arrays : decidability and undecidability. Warwick Research Archive Portal (University of Warwick).

19.

Lazić, Ranko, et al.. (2004). On model checking data-independent systems with arrays without reset. Theory and Practice of Logic Programming. 4(5-6). 659–693. 8 indexed citations

20.

Lazić, Ranko & Bill Roscoe. (1999). Data Independence with Generalised Predicate Symbols.. Parallel and Distributed Processing Techniques and Applications. 319–326. 8 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact