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.
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
20011.2k citationsJean‐Yves Le Boudec, Patrick Thiranprofile →
Performance analysis of the CONFIDANT protocol
20021.1k citationsSonja Buchegger, Jean‐Yves Le BoudecInfoscience (Ecole Polytechnique Fédérale de Lausanne)profile →
Countries citing papers authored by Jean‐Yves Le Boudec
Since
Specialization
Citations
This map shows the geographic impact of Jean‐Yves Le Boudec'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 Jean‐Yves Le Boudec with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jean‐Yves Le Boudec more than expected).
Fields of papers citing papers by Jean‐Yves Le Boudec
This network shows the impact of papers produced by Jean‐Yves Le Boudec. 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 Jean‐Yves Le Boudec. The network helps show where Jean‐Yves Le Boudec may publish in the future.
Co-authorship network of co-authors of Jean‐Yves Le Boudec
This figure shows the co-authorship network connecting the top 25 collaborators of Jean‐Yves Le Boudec.
A scholar is included among the top collaborators of Jean‐Yves Le Boudec 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 Jean‐Yves Le Boudec. Jean‐Yves Le Boudec is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Boudec, Jean‐Yves Le & Dan-Cristian Tomozei. (2011). Satisfiability of Elastic Demand in the Smart Grid. Infoscience (Ecole Polytechnique Fédérale de Lausanne).17 indexed citations
6.
Boudec, Jean‐Yves Le, et al.. (2008). Resolving FP-TP Conflict in Digest-Based Collaborative Spam Detection by Use of Negative Selection Algorithm. Infoscience (Ecole Polytechnique Fédérale de Lausanne).3 indexed citations
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
Farserotu, John, et al.. (2007). High-Resolution Impulse Radio Ultra Wideband. Infoscience (Ecole Polytechnique Fédérale de Lausanne).1 indexed citations
11.
Boudec, Jean‐Yves Le, et al.. (2007). AntispamLab - A Tool for Realistic Evaluation of Email Spam Filters. Infoscience (Ecole Polytechnique Fédérale de Lausanne).3 indexed citations
12.
Merz, Ruben, Joerg Widmer, Jean‐Yves Le Boudec, & Božidar Radunović. (2005). A joint PHY/MAC architecture for low-radiated power TH-UWB wireless ad hoc networks: Research Articles. 5(5). 567–580.3 indexed citations
13.
Mundinger, Jochen, Sonja Buchegger, & Jean‐Yves Le Boudec. (2005). Distributed Reputation Systems for Internet-based Peer-to-Peer Systems and Mobile Ad-Hoc Networks. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 63(63). 19–20.6 indexed citations
14.
Buchegger, Sonja & Jean‐Yves Le Boudec. (2003). The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks. Infoscience (Ecole Polytechnique Fédérale de Lausanne).156 indexed citations
Cholvi, Vicent, et al.. (2002). Worst Case Burstiness Increase due to FIFO Multiplexing. Infoscience (Ecole Polytechnique Fédérale de Lausanne).10 indexed citations
Boudec, Jean‐Yves Le, et al.. (1997). A comparison of ABR and UBR to support TCP traffic. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2. 763–793.4 indexed citations
20.
Robert, Stephan & Jean‐Yves Le Boudec. (1996). On a Markov Modulated Chain with Pseudo-Long Range Dependences. Performance Evaluation. 159–173.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.