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.
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
19939.4k citationsCharles H. Bennett, Gilles Brassard et al.Physical Review Lettersprofile →
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
19962.0k citationsCharles H. Bennett, Gilles Brassard et al.Physical Review Lettersprofile →
Quantum cryptography: Public key distribution and coin tossing
20142.0k citationsCharles H. Bennett, Gilles BrassardTheoretical Computer Scienceprofile →
Quantum cryptography without Bell’s theorem
19921.7k citationsCharles H. Bennett, Gilles Brassard et al.Physical Review Lettersprofile →
Experimental quantum cryptography
19921.1k citationsCharles H. Bennett, Gilles Brassard et al.profile →
Generalized privacy amplification
1995838 citationsC. H. Bennett, Gilles Brassard et al.profile →
Limitations on Practical Quantum Cryptography
2000829 citationsGilles Brassard, Tal Mor et al.Physical Review Lettersprofile →
Strengths and Weaknesses of Quantum Computing
1997679 citationsCharles H. Bennett, Gilles Brassard et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Gilles Brassard
Since
Specialization
Citations
This map shows the geographic impact of Gilles Brassard'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 Gilles Brassard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Gilles Brassard more than expected).
This network shows the impact of papers produced by Gilles Brassard. 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 Gilles Brassard. The network helps show where Gilles Brassard may publish in the future.
Co-authorship network of co-authors of Gilles Brassard
This figure shows the co-authorship network connecting the top 25 collaborators of Gilles Brassard.
A scholar is included among the top collaborators of Gilles Brassard 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 Gilles Brassard. Gilles Brassard 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.
Brassard, Gilles & André Allan Méthot. (2012). Strict hierarchy among Bell Theorems. Theoretical Computer Science. 486. 4–10.1 indexed citations
Bennett, C. H., Gilles Brassard, Claude Crépeau, et al.. (1993). Teleporting an unknown quantum state via dual classical and EPR channels. Physical Review Letters. 1895–1899.137 indexed citations
Brassard, Gilles, et al.. (1990). The design of a linear L-band high power amplifier for mobile communication satellites. NASA Technical Reports Server (NASA). 384–389.1 indexed citations
14.
Brassard, Gilles, et al.. (1990). Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract). 192–195.2 indexed citations
15.
Brassard, Gilles, David Chaum, & Claude Crépeau. (1988). Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences. 37(2). 156–189.366 indexed citations
16.
Brassard, Gilles & Paul Bratley. (1988). Algorithmics: theory & practice.17 indexed citations
17.
Brassard, Gilles, David Chaum, & Claude Crépeau. (1987). Minimum disclosure proofs of knowledge. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 37(2). 1–189.1 indexed citations
18.
Bennett, Charles H., Gilles Brassard, & Jean–Marc Robert. (1986). How to reduce your enemy's information. 468–476.19 indexed citations
19.
Brassard, Gilles, et al.. (1986). Algorithms for very large integer arithmetic. 5(2). 89–102.1 indexed citations
20.
Brassard, Gilles, et al.. (1986). The Design, Evaluation & Modelling of A UHF Power Amplifier for a Mobile Satellite Transponder.. International Conference on Communications. 3. 1396–1401.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.