Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
DeepStack: Expert-level artificial intelligence in heads-up no-limit poker
2017409 citationsViliam Lisý, Michael Bowling et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Viliam Lisý'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 Viliam Lisý with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Viliam Lisý more than expected).
This network shows the impact of papers produced by Viliam Lisý. 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 Viliam Lisý. The network helps show where Viliam Lisý may publish in the future.
Co-authorship network of co-authors of Viliam Lisý
This figure shows the co-authorship network connecting the top 25 collaborators of Viliam Lisý.
A scholar is included among the top collaborators of Viliam Lisý 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 Viliam Lisý. Viliam Lisý is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Yee, Timothy J., Viliam Lisý, & Michael Bowling. (2016). Monte Carlo tree search in continuous action spaces with execution uncertainty. International Joint Conference on Artificial Intelligence. 690–696.30 indexed citations
6.
Lisý, Viliam & Michael Bowling. (2016). Eqilibrium Approximation Quality of Current No-Limit Poker Bots.. arXiv (Cornell University).4 indexed citations
Bošanský, Branislav, et al.. (2013). Using double-oracle method and serialized alpha-beta search for pruning in simultaneous move games. International Joint Conference on Artificial Intelligence. 48–54.5 indexed citations
Vaněk, Ondřej, Branislav Bošanský, Michal Jakob, Viliam Lisý, & Michal Pěchouček. (2012). Extending Security Games to Defenders with Constrained Mobility.. National Conference on Artificial Intelligence.3 indexed citations
Lisý, Viliam, Roie Zivan, Katia Sycara, & Michal Pěchouček. (2010). Deception in networks of mobile sensing agents. Adaptive Agents and Multi-Agents Systems. 1031–1038.7 indexed citations
Broek, Egon L. van den, et al.. (2009). Biosignals as an Advanced Man-Machine Interface. University of Twente Research Information.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.