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.
Countries citing papers authored by Philippe Jacquet
Since
Specialization
Citations
This map shows the geographic impact of Philippe Jacquet'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 Philippe Jacquet with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philippe Jacquet more than expected).
Fields of papers citing papers by Philippe Jacquet
This network shows the impact of papers produced by Philippe Jacquet. 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 Philippe Jacquet. The network helps show where Philippe Jacquet may publish in the future.
Co-authorship network of co-authors of Philippe Jacquet
This figure shows the co-authorship network connecting the top 25 collaborators of Philippe Jacquet.
A scholar is included among the top collaborators of Philippe Jacquet 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 Philippe Jacquet. Philippe Jacquet is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Jacquet, Philippe & Wojciech Szpankowski. (2012). Joint String Complexity for Markov Sources. Discrete Mathematics & Theoretical Computer Science. DMTCS Proceedings vol. AQ,...(Proceedings).4 indexed citations
Jacquet, Philippe, G. Seroussi, & Wojciech Szpankowski. (2008). On the entropy of a hidden Markov process. Theoretical Computer Science. 395(2-3). 203–219.39 indexed citations
Adjih, Cédric, et al.. (2006). Association Discovery Protocol for Hybrid Wireless Mesh Networks. HAL (Le Centre pour la Communication Scientifique Directe). 17.5 indexed citations
8.
Jacquet, Philippe, et al.. (2005). Ad hoc communication between intelligent vehicles. HAL (Le Centre pour la Communication Scientifique Directe).
9.
Adjih, Cédric, et al.. (2005). Performance of Multiple TCP Flows: an Analytical Approach. HAL (Le Centre pour la Communication Scientifique Directe). 24.1 indexed citations
10.
Jacquet, Philippe, et al.. (2004). Compact Suffix Trees Resemble PATRICIA Tries: Limiting Distribution of the Depth. Purdue e-Pubs (Purdue University System). 3(2). 139–148.2 indexed citations
Jacquet, Philippe, Paul Mühlethaler, & Philippe A. Robert. (2001). Performant Implementations of Tree Collision Resolution Algorithms for CATV Networks. OpenGrey (Institut de l'Information Scientifique et Technique).1 indexed citations
Jacquet, Philippe & Paul Mühlethaler. (1990). Marginal throughtput of a stack algorithm for CSMA/CD random length packet communication when the load is over the channel efficiency. HAL (Le Centre pour la Communication Scientifique Directe).1 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.