Lukáš Holík

1.4k total citations
26 papers, 136 citations indexed

About

Lukáš Holík is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence. According to data from OpenAlex, Lukáš Holík has authored 26 papers receiving a total of 136 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 13 papers in Software and 11 papers in Artificial Intelligence. Recurrent topics in Lukáš Holík's work include Software Testing and Debugging Techniques (12 papers), Formal Methods in Verification (11 papers) and Web Application Security Vulnerabilities (6 papers). Lukáš Holík is often cited by papers focused on Software Testing and Debugging Techniques (12 papers), Formal Methods in Verification (11 papers) and Web Application Security Vulnerabilities (6 papers). Lukáš Holík collaborates with scholars based in Czechia, Sweden and Taiwan. Lukáš Holík's co-authors include Tomáš Vojnar, Parosh Aziz Abdulla, Philipp Rümmer, Petr Janků, Anthony W. Lin, Ondřej Lengál, Yu‐Fang Chen, Frédéric Haziza, Ahmed Rezine and Mohamed Faouzi Atig and has published in prestigious journals such as IEEE Transactions on Smart Grid, Theoretical Computer Science and ACM SIGPLAN Notices.

In The Last Decade

Lukáš Holík

22 papers receiving 132 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Lukáš Holík Czechia 9 80 65 58 41 36 26 136
В. В. Кулямин Russia 8 34 0.4× 42 0.6× 116 2.0× 41 1.0× 45 1.3× 33 173
Lydie du Bousquet France 8 46 0.6× 72 1.1× 153 2.6× 54 1.3× 28 0.8× 32 190
Markus N. Rabe United States 6 100 1.3× 27 0.4× 36 0.6× 62 1.5× 22 0.6× 18 151
Giles Reger United Kingdom 7 79 1.0× 40 0.6× 70 1.2× 52 1.3× 39 1.1× 32 151
Christof J. Budnik United States 8 61 0.8× 88 1.4× 202 3.5× 18 0.4× 75 2.1× 29 235
Mamoun Filali France 8 49 0.6× 34 0.5× 54 0.9× 43 1.0× 23 0.6× 29 118
Ken McMillan United States 5 85 1.1× 28 0.4× 65 1.1× 85 2.1× 47 1.3× 8 160
Grigory Fedyukovich United States 7 75 0.9× 39 0.6× 93 1.6× 72 1.8× 28 0.8× 22 139
Marc Pantel France 7 37 0.5× 29 0.4× 40 0.7× 35 0.9× 21 0.6× 27 103
Zhichang Qi China 7 71 0.9× 73 1.1× 82 1.4× 28 0.7× 55 1.5× 37 151

Countries citing papers authored by Lukáš Holík

Since Specialization
Citations

This map shows the geographic impact of Lukáš Holík'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 Lukáš Holík with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Lukáš Holík more than expected).

Fields of papers citing papers by Lukáš Holík

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Lukáš Holík. 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 Lukáš Holík. The network helps show where Lukáš Holík may publish in the future.

Co-authorship network of co-authors of Lukáš Holík

This figure shows the co-authorship network connecting the top 25 collaborators of Lukáš Holík. A scholar is included among the top collaborators of Lukáš Holík 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 Lukáš Holík. Lukáš Holík is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Abdulla, Parosh Aziz, et al.. (2025). Verifying Quantum Circuits with Level-Synchronized Tree Automata. Proceedings of the ACM on Programming Languages. 9(POPL). 923–953. 1 indexed citations
2.
Bouajjani, Ahmed, Lukáš Holík, & Zhilin Wu. (2022). Automated Technology for Verification and Analysis. Lecture notes in computer science. 2 indexed citations
3.
Holík, Lukáš, et al.. (2021). Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. Integrated Network Management. 81–89. 11 indexed citations
4.
Holík, Lukáš, et al.. (2021). Automata Terms in a Lazy WSkS Decision Procedure. Journal of Automated Reasoning. 65(7). 971–999.
5.
Holík, Lukáš, et al.. (2020). Regex matching with counting-set automata. Proceedings of the ACM on Programming Languages. 4(OOPSLA). 1–30. 9 indexed citations
6.
Češka, Milan, et al.. (2019). Approximate reduction of finite automata for high-speed network intrusion detection. International Journal on Software Tools for Technology Transfer. 22(5). 523–539. 11 indexed citations
7.
Holík, Lukáš, et al.. (2019). Nested antichains for WS1S. Acta Informatica. 56(3). 205–228.
8.
Abdulla, Parosh Aziz, Mohamed Faouzi Atig, Yu‐Fang Chen, et al.. (2018). Trau: SMT solver for string constraints. 1–5. 9 indexed citations
9.
Abdulla, Parosh Aziz, Mohamed Faouzi Atig, Yu‐Fang Chen, et al.. (2017). Flatten and conquer: a framework for efficient analysis of string constraints. 602–617. 15 indexed citations
10.
Abdulla, Parosh Aziz, Mohamed Faouzi Atig, Yu‐Fang Chen, et al.. (2017). Flatten and conquer: a framework for efficient analysis of string constraints. ACM SIGPLAN Notices. 52(6). 602–617.
11.
Holík, Lukáš, Petr Janků, Anthony W. Lin, Philipp Rümmer, & Tomáš Vojnar. (2017). String constraints with concatenation and transducers solved efficiently. Proceedings of the ACM on Programming Languages. 2(POPL). 1–32. 24 indexed citations
12.
Holík, Lukáš, et al.. (2016). Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Electronic Proceedings in Theoretical Computer Science. 233. 1 indexed citations
13.
Abdulla, Parosh Aziz, Frédéric Haziza, & Lukáš Holík. (2015). Parameterized verification through view abstraction. International Journal on Software Tools for Technology Transfer. 18(5). 495–516. 13 indexed citations
14.
Abdulla, Parosh Aziz, Yu‐Fang Chen, Lukáš Holík, & Tomáš Vojnar. (2014). Mediating for reduction (on minimizing alternating Büchi automata). Theoretical Computer Science. 552. 26–43.
15.
Holík, Lukáš & Lorenzo Clemente. (2014). Proceedings 15th International Workshop on Verification of Infinite-State Systems. Electronic Proceedings in Theoretical Computer Science. 140. 1 indexed citations
16.
Holík, Lukáš, et al.. (2012). Optimizing an LTS-Simulation Algorithm. Computing and Informatics / Computers and Artificial Intelligence. 29. 1337–1348. 2 indexed citations
17.
Habermehl, Peter, et al.. (2012). Forest automata for verification of heap manipulation. Formal Methods in System Design. 41(1). 83–106. 4 indexed citations
18.
Abdulla, Parosh Aziz, Yu‐Fang Chen, Lukáš Holík, & Tomáš Vojnar. (2009). Mediating for Reduction (on Minimizing Alternating Büchi Automata). HAL (Le Centre pour la Communication Scientifique Directe). 4. 1–12. 1 indexed citations
19.
Abdulla, Parosh Aziz, Ahmed Bouajjani, Lukáš Holík, Lisa Kaati, & Tomáš Vojnar. (2009). COMPOSED BISIMULATION FOR TREE AUTOMATA. International Journal of Foundations of Computer Science. 20(4). 685–700. 3 indexed citations
20.
Abdulla, Parosh Aziz, Lukáš Holík, Lisa Kaati, & Tomáš Vojnar. (2009). A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Electronic Notes in Theoretical Computer Science. 251. 27–48. 3 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

Rankless by CCL
2026