Science Explorer Back to mapMap

Most cited papers from CCI Reprographics (United States)

What are the most cited papers from CCI Reprographics (United States)?

The most cited paper from CCI Reprographics (United States) is "Compressed sensing with coherent and redundant dictionaries" (Emmanuel J. Candès, Yonina C. Eldar, Deanna Needell et al., 2010), with 935 citations. Next come "The Weil Pairing, and Its Efficient Calculation" (587) and "A Survey of Fast Exponentiation Methods" (536).

Showing 50 of 57 papers. Every paper with more than 25 citations is listed.

Most cited papers, sortable by citations and release date
#Paper
1 Compressed sensing with coherent and redundant dictionaries Emmanuel J. Candès, Yonina C. Eldar, Deanna Needell et al. · Applied and Computational Harmonic Analysis Open access 23 Oct 2010 935
2 The Weil Pairing, and Its Efficient Calculation Victor S. Miller · Journal of Cryptology Open access 12 Aug 2004 587
3 A Survey of Fast Exponentiation Methods Daniel M. Gordon · Journal of Algorithms Apr 1998 536
4 Radar Signal Processing for Elderly Fall Detection: The future for in-home monitoring Moeness G. Amin, Yimin Daniel Zhang, Fauzia Ahmad et al. · IEEE Signal Processing Magazine Mar 2016 428
5 On Classification of Modular Tensor Categories Eric C. Rowell, Richard Stong, Zhenghan Wang · Communications in Mathematical Physics Open access 24 Aug 2009 313
6 Networks, Matroids, and Non-Shannon Information Inequalities Randall L. Dougherty, Chris Freiling, K. Zeger · IEEE Transactions on Information Theory Jun 2007 245
7 Articulation rate and the duration of syllables and stress groups in connected speech Thomas H. Crystal, Arthur S. House · The Journal of the Acoustical Society of America Jul 1990 235
8 Rankin-Selberg L-functions in the level aspect Emmanuel Kowalski, Philippe Michel, Jeffrey M. VanderKam · Duke Mathematical Journal Open access 15 Jul 2002 222
9 Efficient distributed quantum computing Robert Beals, STEPHEN D. BRIERLEY, Oliver Gray et al. · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences Open access 20 Feb 2013 218
10 Induction of Finite-State Languages Using Second-Order Recurrent Networks Raymond L. Watrous, Gary M. Kuhn · Neural Computation May 1992 145
11 A logarithmic-depth quantum carry-lookahead adder Thomas G. Draper, Samuel Kutin, Eric M. Rains et al. · CaltechAUTHORS (California Institute of Technology) Jul 2006 143
12 Six New Non-Shannon Information Inequalities Randall L. Dougherty, C. Freiling, K. Zeger Conference paper Jul 2006 129
13 Large torsion subgroups of split Jacobians of curves of genus two or three Everett W. Howe, Franck Leprévost, Bjorn Poonen · Forum Mathematicum 21 Feb 2000 123
14 Symmetrical multilevel diversity coding J.R. Roche, Raymond W. Yeung, Ka Pun Hau · IEEE Transactions on Information Theory May 1997 118
15 Generalizations of Polya's urn Problem Fan Chung, Shirin J. Handjani, Doug Jungreis · Annals of Combinatorics Jul 2003 109
16 Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks Randall L. Dougherty, K. Zeger · IEEE Transactions on Information Theory 30 Oct 2006 90
17 Unachievability of network coding capacity Randall L. Dougherty, C. Freiling, K. Zeger · IEEE Transactions on Information Theory Jun 2006 83
18 Network routing capacity Jillian Cannons, Randall L. Dougherty, C. Freiling et al. · IEEE Transactions on Information Theory Mar 2006 79
19 Abelian Surfaces over Finite Fields as Jacobians Daniel Maisner, Enric Nart, Everett W. Howe · Experimental Mathematics 2002 79
20 New constructions for covering designs Daniel M. Gordon, Oren Patashnik, Greg Kuperberg · Journal of Combinatorial Designs Open access 1995 78
21 Intersections of polynomial orbits, and a dynamical Mordell-Lang conjecture Dragos Ghioca, Thomas J. Tucker, Michael E. Zieve 2007 70
22 Linearity and Solvability in Multicast Networks Randall L. Dougherty, C. Freiling, K. Zeger · IEEE Transactions on Information Theory 28 Sep 2004 66
23 Irregular primes to one million Joe Buhler, Richard E. Crandall, R. W. Sompolski · Mathematics of Computation 1992 59
24 On the Existence of Absolutely Simple Abelian Varieties of a Given Dimension over an Arbitrary Field Everett W. Howe, Hui June Zhu · Journal of Number Theory Open access 2002 59
25 Non-vanishing of high derivatives of automorphic L-functions at the center of the critical strip Emmanuel Kowalski, Philippe Michel, Jeffrey M. VanderKam · Journal für die reine und angewandte Mathematik (Crelles Journal) Open access 18 Jan 2000 58
26 SOME FAMILIES OF PERMUTATION POLYNOMIALS OVER FINITE FIELDS Michael E. Zieve · International Journal of Number Theory Oct 2008 56
27 Primes generated by elliptic curves Graham Everest, Victor S. Miller, Nelson M. Stephens · Proceedings of the American Mathematical Society Open access 7 Nov 2003 55
28 Polynomials with two values Joachim von zur Gathen, J.R. Roche · COMBINATORICA Sep 1997 55
29 Permutation binomials over finite fields Ariane M. Masuda, Michael E. Zieve · Transactions of the American Mathematical Society Open access 17 Mar 2009 55
30 Locally Recoverable Codes from Algebraic Curves and Surfaces Alexander Barg, Kathryn Haymaker, Everett W. Howe et al. · Association for Women in Mathematics series Book chapterOpen access 2017 50
31 A characterization of bent functions in terms of strongly regular graphs Anna Bernasconi, B. Codenottl, Jeffrey M. VanderKam · IEEE Transactions on Computers 2001 49
32 Standing Mute at Arrest as Evidence of Guilt: The 'Right to Silence' Under Attack Frank Herrmann, Brownlow M. Speer · bepress Legal Repository Open access 24 Jun 2008 45
33 Real Polynomials with All Roots on the Unit Circle and Abelian Varieties over Finite Fields Stephen A. DiPippo, Everett W. Howe · Journal of Number Theory Open access Dec 1998 43
34 Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers Harold Fredricksen, Melvin M. Sweet · The Electronic Journal of Combinatorics Open access 18 May 2000 40
35 Sinkhorn Solves Sudoku Todd K. Moon, Jacob H. Gunther, Joseph J. Kupin · IEEE Transactions on Information Theory 24 Mar 2009 40
36 Network Coding and Matroid Theory Randall L. Dougherty, C. Freiling, K. Zeger · Proceedings of the IEEE 31 Jan 2011 39
37 Insufficiency of linear coding in network information flow Randall L. Dougherty, C. Freiling, K. Zeger Conference paper 2005 36
38 New permanental upper bounds for nonnegative matrices George W. Soules · Linear and Multilinear Algebra 11 Nov 2003 36
39 On the expected value of the minimum assignment Marshall W. Buck, Clara S. Chan, David P. Robbins · Random Structures and Algorithms 27 Jun 2002 35
40 Exceptional Covers and Bijections on Rational Points Robert M. Guralnick, Thomas J. Tucker, Michael et al. 2007 34
41 Computing the Mordell-Weil rank of Jacobians of curves of genus two Daniel M. Gordon, David Grant · Transactions of the American Mathematical Society 1993 34
42 Edge-disjoint paths in digraphs with bounded independence number Alexandra Ovetsky Fradkin, Paul D. Seymour · Journal of Combinatorial Theory Series B Open access 21 Jul 2014 33
43 Curves of every genus with many points. II. Asymptotically good families Noam D. Elkies, Everett W. Howe, Andrew Kresch et al. · Zurich Open Repository and Archive (University of Zurich) Open access 2004 31
44 Two-dimensional perfect quaternary arrays K. T. Arasu, Warwick de Launey · IEEE Transactions on Information Theory May 2001 30
45 Optimally pebbling hypercubes and powers David Moews · Discrete Mathematics Open access Aug 1998 30
46 Unimodal sequences and “strange” functions: a family of quantum modular forms Kathrin Bringmann, Amanda Folsom, Robert C. Rhoades · Pacific Journal of Mathematics Open access 2 Mar 2015 30
47 Hypergeometric Series, Truncated Hypergeometric Series, and Gaussian Hypergeometric Functions Alyson Deines, Jenny G. Fuselier, Линг Лонг et al. · Association for Women in Mathematics series Book chapter 2016 29
48 Integer partitions, probabilities and quantum modular forms Hieu T. Ngo, Robert C. Rhoades · Research in the Mathematical Sciences Open access 26 Apr 2017 29
49 Minimizing Setup and Beam-On Times in Radiation Therapy Nikhil Bansal, Don Coppersmith, Baruch Schieber · Lecture notes in computer science Conference paper 2006 29
50 Almost all complete binary prefix codes have a self-synchronizing string C. Freiling, Douglas S. Jungreis, François Théberge et al. · IEEE Transactions on Information Theory Sep 2003 28

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 an institution when any of its authors gave it as an affiliation; 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.