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.
On the Security and Performance of Proof of Work Blockchains
2016956 citationsArthur Gervais, Ghassan Karame et al.profile →
Self-organized public-key management for mobile ad hoc networks
2003530 citationsSrđjan Čapkun, Levente Buttyán et al.profile →
GPS-free positioning in mobile ad-hoc networks
2005488 citationsSrđjan Čapkun, Jean‐Pierre Hubaux et al.profile →
GPS-free Positioning in Mobile Ad Hoc Networks
2002369 citationsSrđjan Čapkun, Jean‐Pierre Hubaux et al.profile →
On the requirements for successful GPS spoofing attacks
2011347 citationsKasper Rasmussen, Srđjan Čapkun et al.profile →
Double-spending fast payments in bitcoin
2012319 citationsGhassan Karame, Srđjan Čapkun 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 Srđjan Čapkun'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 Srđjan Čapkun with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Srđjan Čapkun more than expected).
This network shows the impact of papers produced by Srđjan Čapkun. 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 Srđjan Čapkun. The network helps show where Srđjan Čapkun may publish in the future.
Co-authorship network of co-authors of Srđjan Čapkun
This figure shows the co-authorship network connecting the top 25 collaborators of Srđjan Čapkun.
A scholar is included among the top collaborators of Srđjan Čapkun 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 Srđjan Čapkun. Srđjan Čapkun is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Gervais, Arthur, et al.. (2016). On the Security and Performance of Proof of Work Blockchains. 3–16.956 indexed citations breakdown →
6.
Čapkun, Srđjan, et al.. (2014). On the effective prevention of TLS man-in-the-middle attacks in web applications. USENIX Security Symposium. 671–686.20 indexed citations
Danev, Boris, Thomas S. Heydt-Benjamin, & Srđjan Čapkun. (2009). Physical-layer identification of RFID devices. USENIX Security Symposium. 199–214.107 indexed citations
Čapkun, Srđjan, Jean‐Pierre Hubaux, & Markus Jakobsson. (2004). Secure and Privacy-Preserving Communication in Hybrid Ad Hoc Networks. Infoscience (Ecole Polytechnique Fédérale de Lausanne).36 indexed citations
19.
Čapkun, Srđjan & Jean‐Pierre Hubaux. (2004). Secure Positioning in Sensor Networks. Infoscience (Ecole Polytechnique Fédérale de Lausanne).26 indexed citations
20.
Čapkun, Srđjan, Levente Buttyán, & Jean‐Pierre Hubaux. (2002). Small worlds in security systems. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 28–35.44 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.