Andrew Odlyzko | Academic Influence

Andrew Odlyzko's AcademicInfluence.com Rankings

Andrew Odlyzko

Mathematics

#507

World Rank

#988

Historical Rank

#231

USA Rank

Measure Theory

#522

World Rank

#736

Historical Rank

#213

USA Rank

mathematics Degrees

Download Badge

Mathematics

Andrew Odlyzko's Degrees

Bachelors Mathematics California Institute of Technology

Similar Degrees You Can Earn

Best Online Bachelor's in Math 2025

Why Is Andrew Odlyzko Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Andrew Michael Odlyzko is a Polish-American mathematician and a former head of the University of Minnesota's Digital Technology Center and of the Minnesota Supercomputing Institute. He began his career in 1975 at Bell Telephone Laboratories, where he stayed for 26 years before joining the University of Minnesota in 2001.

(See a Problem?)

Andrew Odlyzko's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Singularity Analysis of Generating Functions (1990) (900)
Solving low density subset sum problems (1983) (501)
String Overlaps, Pattern Matching, and Nontransitive Games (1981) (412)
Discrete Logarithms in Finite Fields and Their Cryptographic Significance (1985) (395)
Paris metro pricing for the internet (1999) (391)
On the distribution of spacings between zeros of the zeta function (1987) (388)
Advances in Cryptology — CRYPTO’ 86 (2000) (378)
Asymptotic enumeration methods (1996) (354)
Privacy, economics, and price discrimination on the Internet (2003) (331)
Random Mapping Statistics (1990) (322)
Tragic loss or good riddance? The impending demise of traditional scholarly journals (1996) (315)
On the foundations of combinatorial theory. VIII. Finite operator calculus (1973) (298)
Internet Pricing and the History of Communications (2001) (292)
The Average Height of Binary Trees and Other Simple Trees (1982) (286)
Internet traffic growth: sources and implications (2003) (251)
Internet growth: is there a Moore's law for data traffic? (2000) (250)
Disproof of the Mertens conjecture. (1984) (249)
Metcalfe's law is wrong - communications networks increase in value as they add members-but by how much? (2006) (238)
Solving Large Sparse Linear Systems over Finite Fields (1990) (229)
Improved low-density subset sum algorithms (1992) (211)
The Economics of Electronic Journals (1997) (204)
The Rise and Fall of Knapsack Cryptosystems (1998) (203)
Periods in Strings (1981) (197)
New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions (1979) (197)
The rapid evolution of scholarly communication (2002) (184)
A bound for the least prime ideal in the Chebotarev Density Theorem (1979) (178)
The Size and Growth Rate of the Internet (1999) (166)
Discrete Logarithms: The Past and the Future (2000) (163)
Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions : a survey of recent results (1990) (163)
Self-Dual Codes over GF(4) (1978) (162)
Cryptanalysis: a survey of recent results (1988) (154)
Fast algorithms for multiple evaluations of the riemann zeta function (1988) (145)
Bounds for binary codes of length less than 25 (1978) (142)
Dynamic behavior of differential pricing and quality of service options for the Internet (1998) (136)
Data Networks are Lightly Utilized, and will Stay that Way (2003) (136)
Paris Metro pricing: the minimalist differentiated services solution (1999) (125)
Growth of the Internet (2002) (124)
Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars (1997) (124)
A Modest Proposal for Preventing Internet Congestion (1997) (117)
Long repetitive patterns in random sequences (1980) (113)
Network Neutrality, Search Neutrality, and the Never-ending Conflict between Efficiency and Fairness in Markets (2008) (111)
Computation of discrete logarithms in prime fields (1991) (109)
The History of Communications and its Implications for the Internet (2000) (108)
An Improved Low-Denisty Subset Sum Algorithm (1991) (108)
Discrete logarithms inGF(p) (2005) (106)
Constant Time Generation of Free Trees (1986) (104)
Content is Not King (2001) (103)
Some analytic estimates of class numbers and discriminants (1975) (103)
Random Shuffles and Group Representations (1985) (103)
Bounds for eigenvalues of certain stochastic matrices (1981) (98)
A refutation of Metcalfe ’ s Law and a better estimate for the value of networks and network interconnections (2005) (95)
Upper bounds for modular forms, lattices, and codes (1975) (89)
A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes (1986) (88)
Emerging applications of number theory (1999) (88)
Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals (1999) (87)
The Internet and Other Networks: Utilization Rates and Their Implications (1998) (86)
Balancing sets of vectors (1988) (86)
Internet Predictions (2010) (85)
Competitive pricing of information goods: Subscription pricing versus pay-per-use (1999) (74)
Probabilistic analysis of optimum partitioning (1986) (74)
The Case Against Micropayments (2003) (73)
Periodic oscillations of coefficients of power series that satisfy functional equations (1982) (71)
The Evolution of Price Discrimination in Transportation and its Implications for the Internet (2004) (70)
Computing n(X) the meissel-lehmer method (1985) (70)
A new proof of the linearity of the Boyer-Moore string searching algorithm (1977) (62)
Non-Negative Digit Sets in Positional Number Systems (1978) (61)
An Efficient Micropayment System Based on Probabilistic Polling (1997) (61)
Large deviations of sums of independent random variables (1988) (60)
Lower bounds for discriminants of number fields (1976) (59)
Internet growth: Myth and reality, use and abuse (2001) (59)
Collective Hallucinations and Inefficient Markets: The British Railway Mania of the 1840s (2010) (57)
Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme (1984) (55)
Too expensive to meter: the influence of transaction costs in transportation and communication (2008) (53)
The Distribution of Heights of Binary Trees and Other Simple Trees (1993) (49)
Economics, Psychology, and Sociology of Security (2003) (48)
On the packing densities of superballs and other bodies (1991) (48)
Open Access, Library and Publisher Competition, and the Evolution of General Commerce (2013) (43)
On Longest Increasing Subsequences in Random Permutations (1998) (43)
The slow evolution of electronic publishing (1997) (43)
Lower bounds for discriminants of number fields, II (1977) (41)
Internet growth: Is there a \Moore''s Law" for data tra?c?," Handbook of Massive Data Sets (2002) (40)
The Past, Evolving Present, and Future of the Discrete Logarithm (2014) (40)
The bumpy road of Electronic Commerce (1996) (40)
Cryptology and Computational Number Theory (1997) (40)
On computing artin l-functions in the critical strip (1979) (38)
Irreducibility testing and factorization of polynomials (1981) (37)
Pricing and architecture of the Internet: Historical perspectives from telecommunications and transportation (2004) (37)
Functional iteration and the Josephus problem (1991) (36)
On subspaces spanned by random selections of plus/minus 1 vectors (1988) (36)
Minima of Cosine Sums and Maxima of Polynomials on the Unit Circle (1982) (34)
Silicon Dreams and Silicon Bricks: The Continuing Evolution of Libraries (1997) (34)
Coefficient inaccuracy in transversal filtering (1979) (34)
Should flat-rate Internet pricing continue (2000) (34)
Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model (2010) (33)
On the Analogue of the Division Polynomials for Hyperelliptic Curves (2012) (33)
The many paradoxes of broadband (2003) (32)
On the Unimodality of High Convolutions of Discrete Distributions (1985) (32)
On the existence of optimum cyclic burst-correcting codes (1986) (32)
Jumping Champions (1999) (31)
On the Unimodality of some Partition Polynomials (1982) (31)
Advances in cryptology -- CRYPTO '86 : proceedings (1987) (30)
Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumerations (1984) (30)
Discrete Logarithms and Smooth Polynomials (1993) (29)
Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholary Journals (1994) (28)
An improved bound for the de Bruijn–Newman constant (2000) (28)
The Editor's Corner: n Coins in a Fountain (1988) (27)
Flat Versus Metered Rates, Bundling, and ‘Bandwidth Hogs’ (2011) (27)
Data networks are mostly empty and for good reason (1999) (26)
Genome-Scale Metabolic Network Validation of Shewanella oneidensis Using Transposon Insertion Frequency Analysis (2014) (26)
The Visible Problems of the Invisible Computer: A Skeptical Look at Information Appliances (1999) (26)
On the compositions of an integer (1980) (26)
Differences of the partition function (1988) (25)
Pebbling a Chessboard (1995) (25)
Attacks on Shamir's 'RSA for Paranoids' (1998) (24)
SOME CURIOUS SEQUENCES CONSTRUCTED WITH THE GREEDYALGORITHMA (1978) (24)
On the number of alignments ofk sequences (1990) (24)
Exploring binary trees and other simple trees (1980) (23)
Iterated absolute values of differences of consecutive primes (1993) (23)
A NEW LEHMER PAIR OF ZEROS AND A NEW LOWER BOUND FOR THE DE BRUIJN-NEWMAN CONSTANT (1993) (23)
On the density of odd integers of the form (p − 1)2−n and related questions (1979) (23)
On the residues of products of prime numbers (1987) (23)
Half weight block codes for optical communications (1986) (22)
SUPERCOMPUTERS AND THE RIEMANN ZETA FUNCTION (1989) (22)
Tragic lass or good riddance? The impending demise of traditional scholarly journals (1995) (22)
Extremal self-dual lattices exist only in dimensions 1 to 8 (1978) (22)
On an Irreducibility Theorem of A. Cohn (1981) (21)
'Smart' and 'Stupid' networks: why the Internet is like Microsoft (1998) (21)
Economic costs of toll access (2006) (21)
Charles Mackay's Own Extraordinary Popular Delusions and the Railway Mania (2011) (21)
On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions (1982) (20)
The Volume and Value of Information (2012) (20)
Does Anyone Really Need MicroPayments? (2003) (19)
The zeta function on the critical line: Numerical evidence for moments and random matrix theory models (2010) (19)
On the ranks of some (0, 1)-matrices with constant row sums (1981) (19)
Newton's financial misadventures in the South Sea Bubble (2018) (19)
On the Capacity of Disjointly Shared Networks (1985) (18)
Enumeration of Strings (1985) (18)
On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences (1983) (18)
The delusions of net neutrality (2008) (17)
Analytic computations in number theory (1994) (17)
Proceedings of the ACM Conference on Electronic Commerce (2003) (17)
Explicit Tauberian estimates for functions with positive coefficients (1992) (16)
The collapse of the Railway Mania, the development of capital markets, and the forgotten role of Robert Lucas Nash (2011) (16)
Primes , Quantum Chaos , and Computers (1990) (16)
Bandwidths and profiles of trees (1985) (16)
Probabilities for intersecting systems and random subsets of finite sets (1986) (15)
The Forgotten Discovery of Gravity Models and the Inefficiency of Early Railway Networks (2014) (15)
On the Number of Distinct Block Sizes in Partitions of a Set (1985) (15)
Decreasing Energy Functions and Lengths of Transients for Some Cellular Automata (1988) (15)
Search for the maximum of a random walk (1992) (14)
The asymptotic behavior of a family of sequences (1987) (14)
Will smart pricing finally take off (2014) (14)
The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel) (1992) (14)
Search for ultraflat polynomials with plus and minus one coefficients (2015) (13)
Enumeration of power sums modulo a prime (1978) (13)
Fine Spectra and Limit Laws, II First-Order 0–1 Laws (1997) (13)
Internet TV: Implications for the long distance network (2001) (12)
Cybersecurity is not very important (2019) (12)
Ramsey-Sperner theory (1987) (12)
This Time Is Different: An Example of a Giant, Wildly Speculative, and Successful Investment Mania (2010) (12)
Existence of short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis (1992) (11)
The Asymptotic Number of Irreducible Partitions (1985) (11)
On the Tightest Packing of Sums of Vectors (1983) (11)
Reprint: The Economics of Electronic Journals (1998) (11)
Proceedings on Advances in cryptology---CRYPTO '86 (1987) (11)
The Asymptotic Number of Set Partitions with Unequal Block Sizes (1998) (11)
Bubbles, Gullibility, and Other Challenges for Economics, Psychology, Sociology, and Information Sciences (2010) (11)
Economically irrational pricing of nineteenth-century British government bonds (2016) (11)
Analytic methods in asymptotic enumeration (1996) (11)
The Railway Mania: Fraud, disappointed expectations, and the modern economy (2012) (10)
Providing security with insecure systems (2010) (10)
On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer (1983) (10)
Optimal Sequential selection of n random variables under a constraint (1984) (10)
Collaborating with the Enemy on Network Management (2014) (10)
Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems (1983) (9)
Internet pricing in light of the history of communications (2001) (9)
Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme (1985) (9)
Lattice points and the volume/area ratio of convex bodies (1973) (9)
New algorithms for computing π(x) (1984) (9)
Numerical study of the derivative of the Riemann zeta function at zeros (2011) (9)
Monotonic subsequences in dimensions higher than one (1996) (9)
Metro Pricing : The minimalist di erentiated services solution (1999) (8)
Alan Turing and the Riemann Zeta Function (2011) (8)
The Unsolvable Privacy Problem and Its Implications for Security Technologies (2003) (8)
k-Color Sperner theorems (1986) (8)
Privacy and the clandestine evolution of e-commerce (2007) (8)
An Optimal Acceptance Policy for an Urn Scheme (1998) (8)
The Public Library of Science and the ongoing revolution in scholarly communication (2001) (7)
Index Calculation Attacks on RSA Signature and Encryption (2006) (7)
The Decline of Unfettered Research (1995) (7)
Connectedness, Classes and Cycle Index (1999) (7)
When a “Law” isn’t a Law at all (2009) (7)
A new theorem about the Mattson-Solomon polynomial, and some applications (1974) (7)
Construction of Invertible Sequences for Multipath Estimation (1994) (7)
Supplementary Material for 'Economically Irrational Pricing of 19th Century British Government Bonds' (2014) (7)
The Complexity of Computing Discrete Logarithms and Factoring Integers (1987) (7)
Bounds on Kissing Numbers (1993) (6)
Partitions of planar sets into small triangles (1985) (6)
Some New Methods and Results in Tree Enumeration (1998) (6)
Discrete logarithms over finite fields (2013) (6)
Public key cryptography (1994) (5)
On covering a product of sets with products of their subsets (1973) (5)
The Early British Railway System, the Casson Counterfactual, and the Effectiveness of Central Planning (2014) (5)
Implications for the long distance network (2003) (5)
On expections of integral quadratic forms. (1981) (5)
Preparation of 3'-dinucleotides from homoribopolymers by digestion with micrococcal nuclease. (1970) (5)
What are the Latin Square Groups (1973) (4)
The stupid network: essential yet unattainable? (1999) (4)
Nonabelian sets with distinct k-sums (1995) (4)
On the Periods of Some Graph Transformations (1987) (4)
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann (1996) (4)
Financialization of the Early Victorian Economy and the London Stock Exchange (2016) (4)
Computation of Discrete Logarithms in Prime Fields (Extended Abstract) (1990) (3)
Computer Algebra and its Applications: Where are we Going? (1996) (3)
The internet and past and future communications revolutions (2010) (3)
Simple, efficient, asynchronous parallel algorithms for maximization (1988) (3)
Why electronic publishing means people will pay different prices (3)
Digital rights management: desirable, inevitable, and almost irrelevant (2007) (3)
Novel market inefficiencies from early Victorian times (2017) (3)
The Collapse of the Railway Mania, the Development of Capital Markets, and Robert Lucas Nash, a Forgotten Pioneer of Accounting and Financial Analysis (2011) (3)
The glorious promise of the post-truth world (2017) (2)
Recursive filters with uniform power distribution (1980) (2)
We Still Need Unfettered Research (1996) (2)
Applications of Symbolic Mathematics to Mathematics (1985) (2)
Fast Parallel Solution of Fixed Point Equations for the Performance Evaluation of Circuit-Switched Networks (1994) (2)
Guest Editorial Price-Based Access Control and Economics of Networking (2006) (2)
Economically Irrational Pricing of 19th Century British Government Bonds (2014) (2)
On the Properties of a Tree-Structured Server Process (1991) (2)
New Analytic Algorithms in Number Theory (1986) (2)
An interview with Andrew Odlyzko on cyber security (2019) (2)
Elementary Problems: E2611-E2616 (1976) (2)
On Lattice Points Inside Convex Bodies (1973) (2)
On Longest Increasing Subsequences in Random Permutations on Longest Increasing Subsequences in Random Permutations (1998) (2)
Balloting labelling and personnel assignment (1986) (2)
The visible problems of the invisible computer (1999) (2)
Info Capacity| The Volume and Value of Information (2012) (2)
Isaac Newton and the perils of the financial South Sea (2020) (2)
Coefficient inaccuracy in FIR filters (1979) (1)
Optimal resource allocation for multicast sessions in multi-hop wireless networks - Discussion (2008) (1)
One Point of View: We Still Need Unfettered Research (1996) (1)
DIVISIBILITY PROPERTIES OF SOME CYCLOTOMIC SEQUENCES (1980) (1)
On Heights of Monotonically Labelled Binary Trees (1998) (1)
Irreducibility Testing and Factorization of Polynomials (Extended Abstract) (1981) (1)
An upper bound for self-dual codes (Corresp.) (1975) (1)
A Probabilistic Inequality (1978) (1)
Web history and economics (2012) (1)
Pelikán's Conjecture Cyclotomic Cosets (1977) (1)
The London Stock Exchange and the British shadow banking system (2017) (1)
Elementary Problems: E2873-E2877 (1981) (1)
Simple, Efficient Asynchronous Parallel Algorithms for Maximization (1985) (1)
The Rise and Fall of Knapsack (1990) (1)
Guest editorial: The economics of communication networks and systems (2012) (1)
Robert E. Gallamore and John R. Meyer, American railroads: Decline and renaissance in the twentieth century (Cambridge, MA: Harvard University Press, 2014. Pp. xiii + 506. ISBN 9780674725645 Hbk. £40.95) (2015) (0)
Ronald Lewis Graham (1935–2020) (2021) (0)
Cryptography (Dagstuhl Seminar 02391) (2021) (0)
Algorithms and Number Theory (Dagstuhl Seminar 98431) (2021) (0)
The Australian National Broadband Network: New Opportunities, New Challenges (2008) (0)
Visual Cryptography with Polarization (2006) (0)
Demand forecasting: lessons from early railways (2009) (0)
Workings of science: Trust in science and mathematics (2022) (0)
Larry Haeg, Harriman vs. Hill: Wall Street's great railroad war ( Minneapolis: University of Minnesota Press, 2013. Pp. xvi+375. ISBN 9780816683642 Hbk. £22.50) (2015) (0)
Minimal-distance routing for KYKLOS II (1987) (0)
Bagehot's Giant Bubble Failure (2019) (0)
Artin L-Functions in the Critical Strip (2010) (0)
Economics and technology in the evolution of networks (2008) (0)
What would surprise early Victorian market players if they came alive today (2016) (0)
TR 13-031 On Outbound Strategies and the Pareto Efficiency of Multipath Interdomain (2013) (0)
Information and Human Society (2011) (0)
Review: Experimental Mathematics in Action. A K Peters, Wellesley, MA, 2007. xii + 322 pp., ISBN 978-1-56881-271-7. $65. by D. H. Bailey, J. M. Borwein, N. J. Calkin, R. Girgensohn, D. R. Luke, and V. H. Moll (2011) (0)
Mathematics, cryptology, and technology (2001) (0)
Thanks to Wheeler Ruml for Introducing Me to Number Partitioning, and the 9 0/1 Knapsack Problem 7.4 Complete Karmarkar-karp Algorithm 7 Multi-way Partitioning 7.1 Greedy Algorithm 7.2 Standard Complete Algorithm 4 Experimental Results: Optimal Solutions 2.4 Dynamic Programming Algorithm (1995) (0)
Enumeration of Extremal Self-Dual Lattices (1988) (0)
The work of the encyclopedia in the age of electronic reproduction (1998) (0)
An undertaking of great advantage, but nobody to know what it is: Bubbles and gullibility (2020) (0)
OPTIMUM BINARY CYCLIC BURST CORRECTING CODES. (1986) (0)
The Future of Money (1998) (0)
Workings of science (2022) (0)
Dionysius Lardner, the Denigrated Sage of Early Railways (2019) (0)
In Memoriam: Freeman Dyson (1923–2020) (2021) (0)
Equilibria of Prices and Investments in Two-sided Internet Content Delivery Market Technical Report (2013) (0)
Life, Law, and New Privacy in a World of Illusions and Manipulations (2019) (0)
Open Research Online Workings of science: Trust in science and mathematics (2022) (0)
N Average of g(n) (2005) (0)
Letters to the Editor … (1980) (0)
Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by J. Christopher Westland (2010) (0)
Crushing national debts , economic revolutions , and extraordinary popular delusions (2012) (0)
Asymptotic Behavior of an n-Fold Integral (1982) (0)
Brownian bridge asymptotics for random mappings Independent process approximations for random combinatorial structures Refined approximations for the Ewens sampling formula The height of a random partial order : concentration of measure Comparison techniques for card shuffling (0)
Financial Cryptography (1999) (0)
Computer science, biotech, space science, genomics (2001) (0)
Economics, QoS, and Charging in the Next Great Telecom Revolution (2011) (0)
Advanced Problems: 6542-6544 (1987) (0)
Keynote Talk: Internet Charging (2000) (0)
Keynotes C Network Dogmas and Network Evolution (2008) (0)
Stuart Banner, Speculation: a history of the fine line between gambling and investment (Oxford: Oxford University Press, 2017. Pp. xii+335. ISBN 9780190623043 Hbk. £19.99/$29.95) (2018) (0)
Integer Factorization and Discrete Logarithms (Abstract) (2000) (0)
Competition and cooperation (1999) (0)
On the distribution of multiplicative translates of sets of residues (mod p) (1994) (0)
Mathematicians discuss the Snowden revelations (2014) (0)
Scripta manent: are libraries and open access becoming irrelevant? (2014) (0)
Anonymity and privacy in public key cryptography (2012) (0)

This paper list is powered by the following services:

Other Resources About Andrew Odlyzko

en.wikipedia.org

What Schools Are Affiliated With Andrew Odlyzko?

Andrew Odlyzko is affiliated with the following schools:

Image Attributions

Image Source for Andrew Odlyzko