Topic · graph theory and CDMA systems
Most cited papers in graph theory and CDMA systems
What are the most cited papers in graph theory and CDMA systems?
The most cited paper in graph theory and CDMA systems is "Identity-Based Cryptosystems and Signature Schemes" (Adi Shamir, 2007), with 6,693 citations. Next come "A Method for the Construction of Minimum-Redundancy Codes" (6,391) and "Untraceable electronic mail, return addresses, and digital pseudonyms" (4,322).
Showing 50 of 98 papers. Every paper with more than 488 citations is listed.
| # | Paper | ||
|---|---|---|---|
| 1 | Identity-Based Cryptosystems and Signature Schemes Adi Shamir · Lecture notes in computer science | 12 Aug 2007 | 6,693 |
| 2 | A Method for the Construction of Minimum-Redundancy Codes David A. Huffman · Proceedings of the IRE | Sep 1952 | 6,391 |
| 3 | Untraceable electronic mail, return addresses, and digital pseudonyms David Chaum · Communications of the ACM | Feb 1981 | 4,322 |
| 4 | Factoring polynomials with rational coefficients A. K. Lenstra, Hendrik W. Lenstra, László Lovász · Mathematische Annalen | Dec 1982 | 4,058 |
| 5 | Combinatorial optimization:Algorithms and complexity L. R. Rabiner · IEEE Transactions on Acoustics Speech and Signal Processing | Dec 1984 | 3,595 |
| 6 | Efficient signature generation by smart cards Claus Peter Schnorr · Journal of Cryptology | 1991 | 2,796 |
| 7 | Protocols for secure computations Andrew Chi-Chih Yao · Foundations of Computer Science | 3 Nov 1982 | 2,716 |
| 8 | Reducibility Among Combinatorial Problems Richard M. Karp | 6 Nov 2009 | 2,505 |
| 9 | Algorithm 457: finding all cliques of an undirected graph Coen Bron, Joep Kerbosch · Communications of the ACM | Sep 1973 | 2,492 |
| 10 | Distance-Regular Graphs Andries E. Brouwer, Willem H. Haemers · Universitext | 30 Nov 2011 | 1,998 |
| 11 | Expander graphs and their applications Shlomo Hoory, Nathan Linial, Avi Wigderson · Bulletin of the American Mathematical Society | 7 Aug 2006 | 1,798 |
| 12 | Reducing the peak-to-average power ratio of multicarriermodulation by selected mapping Robert Bäuml, Robert F. H. Fischer, J.B. Huber · Electronics Letters | 24 Oct 1996 | 1,693 |
| 13 | How to Leak a Secret Ronald L. Rivest, Adi Shamir, Yael Tauman · Lecture notes in computer science | 2001 | 1,618 |
| 14 | On the inherent intractability of certain coding problems (Corresp.) Elwyn R. Berlekamp, Robert J. McEliece, Henk van Tilborg · IEEE Transactions on Information Theory | May 1978 | 1,527 |
| 15 | A DISTRIBUTION-FREE k -SAMPLE TEST AGAINST ORDERED ALTERNATIVES A. R. Jonckheere · Biometrika | 1954 | 1,515 |
| 16 | SIMPLE GROUPS OF LIE TYPE Ian G. MacDonald · Bulletin of the London Mathematical Society | Mar 1975 | 1,471 |
| 17 | Closest point search in lattices Erik Agrell, Thomas Eriksson, Alexander Vardy et al. · IEEE Transactions on Information Theory | Aug 2002 | 1,450 |
| 18 | The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes A. Roger Hammons, P. Vijay Kumar, A.R. Calderbank et al. · IEEE Transactions on Information Theory | Mar 1994 | 1,430 |
| 19 | Group signatures David Chaum, Eugène van Heyst · Theory and Application of Cryptographic Techniques | 8 Apr 1991 | 1,400 |
| 20 | Efficient Identification and Signatures for Smart Cards Claus Peter Schnorr · Lecture notes in computer science | 8 Nov 2007 | 1,371 |
| 21 | Code division multiple-access techniques in optical fiber networks. I. Fundamental principles Jawad A. Salehi · IEEE Transactions on Communications | 1989 | 1,369 |
| 22 | Polynomial Reconstruction Based Cryptography Aggelos Kiayias, Moti M. Yung · Lecture notes in computer science | 2001 | 1,360 |
| 23 | INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS Péter L. Erdős, Chao Ko, R. Rado · The Quarterly Journal of Mathematics | 1961 | 1,355 |
| 24 | Eta-Squared and Partial Eta-Squared in Fixed Factor Anova Designs Jacob Cohen · Educational and Psychological Measurement | Apr 1973 | 1,343 |
| 25 | Lower bounds on the maximum cross correlation of signals (Corresp.) Lloyd R. Welch · IEEE Transactions on Information Theory | May 1974 | 1,307 |
| 26 | Graph Minors .XIII. The Disjoint Paths Problem Neil R. Robertson, Paul D. Seymour · Journal of Combinatorial Theory Series B | 1995 | 1,298 |
| 27 | Time bounds for selection Manuel Blum, Robert W. Floyd, Vaughan Pratt et al. · Journal of Computer and System Sciences | Aug 1973 | 1,254 |
| 28 | Parallel Processing with the Perfect Shuffle Harold Samuel Stone · IEEE Transactions on Computers | Feb 1971 | 1,254 |
| 29 | Coloring of commutative rings István Beck · Journal of Algebra | Jul 1988 | 1,234 |
| 30 | On the sphere-decoding algorithm I. Expected complexity Babak Hassibi, Haris Vikalo · IEEE Transactions on Signal Processing | 19 Jul 2005 | 1,212 |
| 31 | A Sparse Matrix Arithmetic Based on $\Cal H$ -Matrices. Part I: Introduction to ${\Cal H}$ -Matrices Wolfgang Hackbusch · Computing | Apr 1999 | 1,199 |
| 32 | Optical orthogonal codes: design, analysis and applications Fan Chung, Jawad A. Salehi, Victor K. Wei · IEEE Transactions on Information Theory | May 1989 | 1,131 |
| 33 | Combinatorial Matrix Theory Richard A. Brualdi · Discrete mathematics and its applications | 2 Nov 2006 | 1,025 |
| 34 | Color-coding Noga Alon, Raphael Yuster, Uri Zwick · Journal of the ACM | Jul 1995 | 1,012 |
| 35 | The asymptotic number of labeled graphs with given degree sequences Edward A. Bender, E. Rodney Canfield · Journal of Combinatorial Theory Series A | May 1978 | 1,002 |
| 36 | Spectral efficiency of CDMA with random spreading Sergio Verdú, Shlomo Shitz Shamai · IEEE Transactions on Information Theory | Mar 1999 | 897 |
| 37 | A class of multiple-error-correcting codes and the decoding scheme I.S. Reed · Transactions of the IRE Professional Group on Information Theory | Sep 1954 | 872 |
| 38 | Boolean Functions for Cryptography and Error-Correcting Codes Claude Carlet · Cambridge University Press eBooks | 28 Jun 2010 | 870 |
| 39 | Code division multiple-access techniques in optical fiber networks. II. Systems performance analysis Jawad A. Salehi, Charles A. Brackett · IEEE Transactions on Communications | 1989 | 870 |
| 40 | Differentially uniform mappings for cryptography Kaisa Nyberg · Lecture notes in computer science | 31 Jul 2007 | 866 |
| 41 | ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation Daniel Demmler, Thomas H. Schneider, Michael Zohner | 2015 | 826 |
| 42 | Trellis-coded modulation with redundant signal sets Part I: Introduction G. Ungerboeck · IEEE Communications Magazine | Feb 1987 | 806 |
| 43 | On generating all maximal independent sets David S. Johnson, Mihalis Yannakakis, Christos H. Papadimitriou · Information Processing Letters | Mar 1988 | 782 |
| 44 | A Threshold Cryptosystem without a Trusted Party Torben Pryds Pedersen · Lecture notes in computer science | 6 Aug 2007 | 775 |
| 45 | Packing Lines, Planes, etc.: Packings in Grassmannian Spaces John H. Conway, Ronald H. Hardin, Neil J.A. Sloane · Experimental Mathematics | 1996 | 774 |
| 46 | Gröbner Bases: A Computational Approach to Commutative Algebra Thomas Becker, Volker Weispfenning, Heinz Kredel · UCLA - Biblioteca de Ciencias y Tecnologia Felix Morales Bueno | 30 Sep 2011 | 766 |
| 47 | Normal hypergraphs and the perfect graph conjecture László Lovász · Discrete Mathematics | Jun 1972 | 763 |
| 48 | Equalities and Inequalities for Ranks of Matrices † George Matsaglia, George P. H. Styan · Linear and Multilinear Algebra | 1974 | 755 |
| 49 | Algebraic coding theory Norman Biggs · Springer undergraduate mathematics series | 2008 | 755 |
| 50 | A characterization of the minimum cycle mean in a digraph Richard M. Karp · Discrete Mathematics | 1978 | 752 |
Citations are OpenAlex's own counts, from its 2026-09-23 snapshot, so the ranking can differ from Google Scholar or Web of Science. A paper is listed for a field when OpenAlex files it under one of the field's topics; retracted papers and papers whose citation count cannot be traced to citing works are left out, and a preprint and the article it became are shown once. Release dates are OpenAlex's: where a source gave only a month or a year, that is what is shown. How the lists are chosen.