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.
This map shows the geographic impact of Pavel Zezula'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 Pavel Zezula with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pavel Zezula more than expected).
This network shows the impact of papers produced by Pavel Zezula. 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 Pavel Zezula. The network helps show where Pavel Zezula may publish in the future.
Co-authorship network of co-authors of Pavel Zezula
This figure shows the co-authorship network connecting the top 25 collaborators of Pavel Zezula.
A scholar is included among the top collaborators of Pavel Zezula 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 Pavel Zezula. Pavel Zezula is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Batko, Michal, et al.. (2014). DISA at ImageCLEF 2014: The search-based solution for scalable image annotation. CLEF (Working Notes). 1–12.3 indexed citations
8.
Brisaboa, Nieves R., Pavel Zezula, & Óscar Pedreira. (2013). Similarity Search and Applications. Lecture notes in computer science.7 indexed citations
Zezula, Pavel, Giuseppe Amato, Vlastislav Dohnal, & Michal Batko. (2005). Similarity Search: The Metric Space Approach (Advances in Database Systems). Springer eBooks.227 indexed citations
14.
Mandreoli, Federica, et al.. (2004). Unordered XML Pattern Matching with Tree Signatures. IRIS UNIMORE (University of Modena and Reggio Emilia). 78–85.
15.
Batko, Michal, Claudio Gennaro, Pasquale Savino, & Pavel Zezula. (2004). Scalable Similarity Search in Metric Spaces.. 213–224.7 indexed citations
16.
Dohnal, Vlastislav, Claudio Gennaro, Pasquale Savino, & Pavel Zezula. (2001). Separable Splits of Metric Data Sets. SEBD. 45–62.1 indexed citations
Ciaccia, Paolo, Marco Patella, Fausto Rabitti, & Pavel Zezula. (1997). Indexing Metric Spaces with M-Tree.. SEBD. 67–86.20 indexed citations
19.
Zezula, Pavel, Paolo Ciaccia, & Paolo Tiberio. (1993). Hamming Filters: A Dynamic Signature File Organization for Parallel Stores. Very Large Data Bases. 314–327.4 indexed citations
20.
Zezula, Pavel, Fausto Rabitti, & Paolo Tiberio. (1991). Dynamic partitioning of signature files. ACM Transactions on Information Systems. 9(4). 336–367.43 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.