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.
Bullet
2003453 citationsDejan Kostić, Adolfo Rodriguez et al.profile →
This map shows the geographic impact of Dejan Kostić'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 Dejan Kostić with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dejan Kostić more than expected).
This network shows the impact of papers produced by Dejan Kostić. 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 Dejan Kostić. The network helps show where Dejan Kostić may publish in the future.
Co-authorship network of co-authors of Dejan Kostić
This figure shows the co-authorship network connecting the top 25 collaborators of Dejan Kostić.
A scholar is included among the top collaborators of Dejan Kostić 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 Dejan Kostić. Dejan Kostić is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Maguire, Gerald Q., et al.. (2020). Reexamining Direct Cache Access to Optimize I/O Intensive Applications for Multi-hundred-gigabit Networks. KTH Publication Database DiVA (KTH Royal Institute of Technology). 673–689.14 indexed citations
10.
Barbette, Tom, et al.. (2020). A High-Speed Load-Balancer Design with Guaranteed Per-Connection-Consistency. KTH Publication Database DiVA (KTH Royal Institute of Technology). 667–683.23 indexed citations
Katsikas, Georgios P., Tom Barbette, Dejan Kostić, Rebecca Steinert, & Gerald Q. Maguire. (2018). Metron: NFV Service Chains at the True Speed of the Underlying Hardware. KTH Publication Database DiVA (KTH Royal Institute of Technology). 171–186.88 indexed citations
Kuźniar, Maciej, Peter Perešíni, Marco Canini, Daniele Venzano, & Dejan Kostić. (2012). A SOFT way for openflow switch interoperability testing. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 265–276.72 indexed citations
15.
Canini, Marco, et al.. (2011). Toward online testing of federated and heterogeneous distributed systems. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 20–20.10 indexed citations
16.
Boudec, Jean‐Yves Le, et al.. (2007). Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing. Infoscience (Ecole Polytechnique Fédérale de Lausanne).3 indexed citations
17.
Kostić, Dejan, Ryan Braud, Charles Killian, et al.. (2005). Maintaining high bandwidth under dynamic network conditions. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 14–14.70 indexed citations
18.
Rodriguez, Adolfo, Charles Killian, Sooraj Bhat, Dejan Kostić, & Amin Vahdat. (2004). MACEDON: methodology for automatically creating, evaluating, and designing overlay networks. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 20–20.71 indexed citations
19.
Kostić, Dejan, et al.. (2003). Using random subsets to build scalable network services. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 19–19.79 indexed citations
20.
Kostić, Dejan & Amin Vahdat. (2002). Latency versus Cost Optimizations in Hierarchical Overlay Networks.7 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.