Andrew M. Odlyzko

According to our database, Andrew M. Odlyzko authored at least 118 papers between 1973 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

Workings of science: Trust in science and mathematics.

Jeffrey Johnson, Andrew M. Odlyzko

Ubiquity, 2022

2019

Cybersecurity is not very important.

Andrew M. Odlyzko

Ubiquity, 2019

An interview with Andrew Odlyzko on cyber security.

Peter J. Denning, Andrew M. Odlyzko

Commun. ACM, 2019

2017

The glorious promise of the post-truth world.

Andrew M. Odlyzko

Ubiquity, 2017

2014

Genome-Scale Metabolic Network Validation of <i>Shewanella oneidensis</i> Using Transposon Insertion Frequency Analysis.

Hong Yang, Elias W. Krumholz, Evan D. Brutinel, Nagendra P. Palani, Michael J. Sadowsky, Andrew M. Odlyzko, Jeffrey A. Gralnick, Igor G. L. Libourel

PLoS Comput. Biol., 2014

Collaborating with the Enemy on Network Management.

Chris Hall, Dongting Yu, Zhi-Li Zhang, Jonathan Stout, Andrew M. Odlyzko, Andrew W. Moore, L. Jean Camp, Kevin Benton, Ross J. Anderson

Proceedings of the Security Protocols XXII, 2014

The Past, Evolving Present, and Future of the Discrete Logarithm.

Antoine Joux, Andrew M. Odlyzko, Cécile Pierrot

Proceedings of the Open Problems in Mathematics and Computational Science, 2014

2013

Open Access, library and publisher competition, and the evolution of general commerce

Andrew M. Odlyzko

CoRR, 2013

Discrete logarithms over finite fields.

Andrew M. Odlyzko

Proceedings of the Handbook of Finite Fields., 2013

2012

The zeta function on the critical line: Numerical evidence for moments and random matrix theory models.

Ghaith A. Hiary, Andrew M. Odlyzko

Math. Comput., 2012

Web history and economics.

Andrew M. Odlyzko

Comput. Networks, 2012

2011

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.

Andrew M. Odlyzko

Am. Math. Mon., 2011

Economics, QoS, and Charging in the Next Great Telecom Revolution.

Andrew M. Odlyzko

Proceedings of the Economics of Converged, Internet-Based Networks, 2011

2010

Internet Predictions.

Deborah Estrin, K. Mani Chandy, Robert Michael Young, Larry Smarr, Andrew M. Odlyzko, David D. Clark, Viviane Reding, Toru Ishida, Sharad Sharma, Vinton G. Cerf, Urs Hölzle, Luiz André Barroso, Geoff Mulligan, Adrian Hooke, Chip Elliott

IEEE Internet Comput., 2010

Bubbles, gullibility, and other challenges for economics, psychology, sociology, and information sciences.

Andrew M. Odlyzko

First Monday, 2010

Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by J. Christopher Westland.

Andrew M. Odlyzko

Electron. Commer. Res. Appl., 2010

Providing security with insecure systems.

Andrew M. Odlyzko

Proceedings of the Third ACM Conference on Wireless Network Security, 2010

Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model.

Zhi-Li Zhang, Papak Nabipay, Andrew M. Odlyzko, Roch Guérin

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2008

Economics and technology in the evolution of networks.

Andrew M. Odlyzko

Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

2007

Digital rights management: desirable, inevitable, and almost irrelevant.

Andrew M. Odlyzko

Proceedings of the Seventh ACM Workshop on Digital Rights Management, 2007

Privacy and the clandestine evolution of e-commerce.

Andrew M. Odlyzko

Proceedings of the 9th International Conference on Electronic Commerce: The Wireless World of Electronic Commerce, 2007

2006

Index Calculation Attacks on RSA Signature and Encryption.

Jean-Sébastien Coron, David Naccache, Yvo Desmedt, Andrew M. Odlyzko, Julien P. Stern

Des. Codes Cryptogr., 2006

2004

Privacy, Economics, and Price Discrimination on the Internet.

Andrew M. Odlyzko

Proceedings of the Economics of Information Security, 2004

2003

The many paradoxes of broadband.

Andrew M. Odlyzko

First Monday, 2003

Does Anyone Really Need MicroPayments?

Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot

Proceedings of the Financial Cryptography, 2003

Economics, Psychology, and Sociology of Security.

Andrew M. Odlyzko

Proceedings of the Financial Cryptography, 2003

The Case Against Micropayments.

Andrew M. Odlyzko

Proceedings of the Financial Cryptography, 2003

The Unsolvable Privacy Problem and Its Implications for Security Technologies.

Andrew M. Odlyzko

Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

Privacy, economics, and price discrimination on the Internet.

Andrew M. Odlyzko

Proceedings of the 5th International Conference on Electronic Commerce, 2003

2002

The rapid evolution of scholarly communication.

Andrew M. Odlyzko

Learn. Publ., 2002

2001

Content is Not King.

Andrew M. Odlyzko

First Monday, 2001

Internet pricing and the history of communications.

Andrew M. Odlyzko

Comput. Networks, 2001

2000

An improved bound for the de Bruijn-Newman constant.

Andrew M. Odlyzko

Numer. Algorithms, 2000

The Internet and other networks: utilization rates and their implications.

Andrew M. Odlyzko

Inf. Econ. Policy, 2000

Dynamic behavior of differential pricing and quality of service options for the internet.

Peter C. Fishburn, Andrew M. Odlyzko

Decis. Support Syst., 2000

Discrete Logarithms: The Past and the Future.

Andrew M. Odlyzko

Des. Codes Cryptogr., 2000

Keynote Talk: Internet Charging.

Andrew M. Odlyzko

Proceedings of the Quality of Future Internet Services, 2000

Integer Factorization and Discrete Logarithms (Abstract).

Andrew M. Odlyzko

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

Letters to the Editor.

Cliff Barney, Andrew M. Odlyzko

First Monday, 1999

The Visible Problems of the Invisible Computer: A Skeptical Look at Information Appliances.

Andrew M. Odlyzko

First Monday, 1999

Jumping Champions.

Andrew M. Odlyzko, Michael Rubinstein, Marek Wolf

Exp. Math., 1999

Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals

Andrew M. Odlyzko

CoRR, 1999

The Asymptotic Number of Set Partitions with Unequal Block Sizes.

Arnold Knopfmacher, Andrew M. Odlyzko, Boris G. Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald

Electron. J. Comb., 1999

Paris metro pricing for the internet.

Andrew M. Odlyzko

Proceedings of the First ACM Conference on Electronic Commerce (EC-99), 1999

1998

An Optimal Acceptance Policy for an Urn Scheme.

Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp

SIAM J. Discret. Math., 1998

Attacks on Shamir's 'RSA for Paranoids'.

Henri Gilbert, Dipankar Gupta, Andrew M. Odlyzko, Jean-Jacques Quisquater

Inf. Process. Lett., 1998

The Size and Growth Rate of the Internet.

Kerry Coffman, Andrew M. Odlyzko

First Monday, 1998

1997

Silicon Dreams and Silicon Bricks: The Continuing Evolution of Libraries.

Andrew M. Odlyzko

Libr. Trends, 1997

The Economics of Electronic Journals.

Andrew M. Odlyzko

First Monday, 1997

Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars.

Peter C. Fishburn, Andrew M. Odlyzko, Ryan C. Siders

First Monday, 1997

Monotonic subsequences in dimensions higher than one.

Andrew M. Odlyzko, James B. Shearer, Ryan C. Siders

Electron. J. Comb., 1997

An Efficient Micropayment System Based on Probabilistic Polling.

Stanislaw Jarecki, Andrew M. Odlyzko

Proceedings of the Financial Cryptography, 1997

The slow evolution of electronic publishing.

Andrew M. Odlyzko

Proceedings of the 1st ICCC/IFIP conference held at the University of Kent, 1997

1996

Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann.

Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko

Fundam. Informaticae, 1996

Analytic methods in asymptotic enumeration.

Andrew M. Odlyzko

Discret. Math., 1996

The bumpy road of Electronic Commerce.

Andrew M. Odlyzko

Proceedings of WebNet 96, 1996

Computer Algebra and its Applications: Where are we Going?

Andrew M. Odlyzko

Proceedings of the Beherrschung von Informationssystemen, 1996

1995

Search for the Maximum of a Random Walk.

Andrew M. Odlyzko

Random Struct. Algorithms, 1995

Tragic loss or good riddance? The impending demise of traditional scholarly journals.

Andrew M. Odlyzko

Int. J. Hum. Comput. Stud., 1995

Nonabelian sets with distinct k-sums.

Andrew M. Odlyzko, Warren D. Smith

Discret. Math., 1995

1994

Fast Parallel Solution of Fixed Point Equations for the Performance Evaluation of Circuit-Switched Networks.

Albert G. Greenberg, Andrew M. Odlyzko, Jennifer Rexford, David Espinosa

Perform. Evaluation, 1994

Minimal-distance routing for KYKLOS II.

Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang

Networks, 1994

Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholary Journals.

Andrew M. Odlyzko

J. Univers. Comput. Sci., 1994

1993

The Distribution of Heights of Binary Trees and Other Simple Trees.

Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond

Comb. Probab. Comput., 1993

1992

Improved Low-Density Subset Sum Algorithms.

Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern

Comput. Complex., 1992

Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis.

Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel).

Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid

Proceedings of the Advances in Cryptology, 1992

1991

Computation of Discrete Logarithms in Prime Fields.

Brian A. LaMacchia, Andrew M. Odlyzko

Des. Codes Cryptogr., 1991

An Improved Low-Denisty Subset Sum Algorithm.

Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr

Proceedings of the Advances in Cryptology, 1991

1990

Singularity Analysis of Generating Functions.

Philippe Flajolet, Andrew M. Odlyzko

SIAM J. Discret. Math., 1990

On the number of alignments of <i>k</i> sequences.

Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman

Graphs Comb., 1990

Computation of Discrete Logarithms in Prime Fields (Extended Abstract).

Brian A. LaMacchia, Andrew M. Odlyzko

Proceedings of the Advances in Cryptology, 1990

Solving Large Sparse Linear Systems over Finite Fields.

Brian A. LaMacchia, Andrew M. Odlyzko

Proceedings of the Advances in Cryptology, 1990

1989

Random Mapping Statistics.

Philippe Flajolet, Andrew M. Odlyzko

Proceedings of the Advances in Cryptology, 1989

1988

Simple, Efficient Asynchronous Parallel Algorithms for Maximization.

Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko

ACM Trans. Program. Lang. Syst., 1988

Balancing sets of vectors.

Noga Alon, Ernest E. Bergmann, Don Coppersmith, Andrew M. Odlyzko

IEEE Trans. Inf. Theory, 1988

Cryptanalysis: a survey of recent results.

Ernest F. Brickell, Andrew M. Odlyzko

Proc. IEEE, 1988

On subspaces spanned by random selections of plus/minus 1 vectors.

Andrew M. Odlyzko

J. Comb. Theory A, 1988

Decreasing Energy Functions and Lengths of Transients for Some Cellular Automata.

Eric Goles, Andrew M. Odlyzko

Complex Syst., 1988

1987

Bandwidths and profiles of trees.

Andrew M. Odlyzko, Herbert S. Wilf

J. Comb. Theory B, 1987

Computing pi(x): An Analytic Method.

J. C. Lagarias, Andrew M. Odlyzko

J. Algorithms, 1987

Ramsey-Sperner theory.

Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer

Discret. Math., 1987

On the Periods of Some Graph Transformations.

Andrew M. Odlyzko, Dana Randall

Complex Syst., 1987

Minimal-Distance Routing for Kykios II.

Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang

Proceedings of the International Conference on Parallel Processing, 1987

1986

On the existence of optimum cyclic burst-correcting codes.

Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C. A. van Tilborg

IEEE Trans. Inf. Theory, 1986

Constant Time Generation of Free Trees.

Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay

SIAM J. Comput., 1986

<i>k</i>-Color Sperner theorems.

Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer

J. Comb. Theory A, 1986

On the Capacity of Disjointly Shared Networks.

J. C. Lagarias, Andrew M. Odlyzko, Don Zagier

Comput. Networks, 1986

Discrete Logarithms in GF(p).

Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel

Algorithmica, 1986

1985

Solving Low-Density Subset Sum Problems

J. C. Lagarias, Andrew M. Odlyzko

J. ACM, January, 1985

On the Number of Distinct Block Sizes in Partitions of a Set.

Andrew M. Odlyzko, L. Bruce Richmond

J. Comb. Theory A, 1985

The Asymptotic Number of Irreducible Partitions.

Edward A. Bender, Andrew M. Odlyzko, L. Bruce Richmond

Eur. J. Comb., 1985

Partitions of planar sets into small triangles.

Andrew M. Odlyzko, Janos Pintz, Kenneth B. Stolarsky

Discret. Math., 1985

A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes.

Yvo Desmedt, Andrew M. Odlyzko

Proceedings of the Advances in Cryptology, 1985

1984

Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme.

Andrew M. Odlyzko

IEEE Trans. Inf. Theory, 1984

Discrete Logarithms in Finite Fields and Their Cryptographic Significance.

Andrew M. Odlyzko

Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme.

Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret

Proceedings of the Advances in Cryptology: Proceedings of EUROCRYPT 84, 1984

1983

On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences.

J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer

J. Comb. Theory A, 1983

On the Tightest Packing of Sums of Vectors.

Jerrold R. Griggs, Jeffrey C. Lagarias, Andrew M. Odlyzko, James B. Shearer

Eur. J. Comb., 1983

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer.

Peter Frankl, Andrew M. Odlyzko

Eur. J. Comb., 1983

On the average product of Gauss-Markov variables.

Benjamin F. Logan, James E. Mazo, Andrew M. Odlyzko, Larry A. Shepp

Bell Syst. Tech. J., 1983

Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems.

Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko

Proceedings of the Advances in Cryptology, 1983

1982

On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions.

J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer

J. Comb. Theory A, 1982

The Average Height of Binary Trees and Other Simple Trees.

Philippe Flajolet, Andrew M. Odlyzko

J. Comput. Syst. Sci., 1982

On the Unimodality of some Partition Polynomials.

Andrew M. Odlyzko, L. Bruce Richmond

Eur. J. Comb., 1982

1981

String Overlaps, Pattern Matching, and Nontransitive Games.

Leonidas J. Guibas, Andrew M. Odlyzko

J. Comb. Theory A, 1981

Periods in Strings.

Leonidas J. Guibas, Andrew M. Odlyzko

J. Comb. Theory A, 1981

Irreducibility Testing and Factorization of Polynomials (Extended Abstract)

Leonard M. Adleman, Andrew M. Odlyzko

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm.

Leonidas J. Guibas, Andrew M. Odlyzko

SIAM J. Comput., 1980

Exploring Binary Trees and Other Simple Trees

Philippe Flajolet, Andrew M. Odlyzko

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions.

Andrew M. Odlyzko, Neil J. A. Sloane

J. Comb. Theory A, 1979

Coefficient inaccuracy in FIR filters.

Allen Gersho, B. Gopinath, Andrew M. Odlyzko

Proceedings of the IEEE International Conference on Acoustics, 1979

1978

Bounds for binary codes of length less than 25.

Marc R. Best, Andries E. Brouwer, F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane

IEEE Trans. Inf. Theory, 1978

Self-Dual Codes over GF(4).

F. Jessie MacWilliams, Andrew M. Odlyzko, Neil J. A. Sloane, Harold N. Ward

J. Comb. Theory A, 1978

1977

Pelikán's Conjecture Cyclotomic Cosets.

F. Jessie MacWilliams, Andrew M. Odlyzko

J. Comb. Theory A, 1977

1975

An upper bound for self-dual codes (Corresp.).

Colin L. Mallows, Andrew M. Odlyzko, Neil J. A. Sloane

IEEE Trans. Inf. Theory, 1975

1974

A new theorem about the Mattson-Solomon polynomial, and some applications.

Anthony M. Kerdock, F. Jessie MacWilliams, Andrew M. Odlyzko

IEEE Trans. Inf. Theory, 1974

1973

On covering a product of sets with products of their subsets.

Andrew M. Odlyzko

Discret. Math., 1973