Odlyzko, Andrew M. - Digital Technology Center, University of Minnesota

• The Unsolvable Privacy Problem and its Implications for Security Technologies
• COMPUTING p(x)p (x): THE MEISSELLEHMER METHOD J. C. Lagarias
• THE CURRENT STATE AND LIKELY EVOLUTION OF THE INTERNET Andrew Odlyzko
• Too expensive to meter: The influence of transaction costs in transportation and
• On the Complexity of Computing Discrete Logarithms and Factoring Integers A. M. Odlyzko
• [6] Gruber, P.M. and Lekkerkerker, C.G. Geometry of Numbers, Elsevier, NorthHolland, Am sterdam, 1987 (This is an updated version of [10]).
• Privacy, Economics, and Price Discrimination on the Internet
• LaTEX filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties
• Matthijs J. Coster AT&T Bell Laboratories
• Fast algorithms for multiple evaluations of the Riemann zeta function
• An efficient micropayment system based on probabilistic Stanisl/aw Jarecki ? and Andrew Odlyzko ??
• P. Flajolet, P. Sipala and J.M. Steyaert [1987]. ``The Analysis of Tree Compaction in Symbolic Manipulations,'' preprint.
• Balancing Sets of Vectors Department of Mathematics
• A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes
• Internet traffic growth: Sources and implications Andrew M. Odlyzko
• Primes, Quantum Chaos, and Computers A. M. Odlyzko
• Network neutrality, search neutrality, and the neverending conflict between e#ciency and fairness
• On the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences
• RANDOM SHUFFLES AND GROUP REPRESENTATIONS A. M. Odlyzko
• [13] R. A. Wright, B. Richmond, A. Odlyzko and B. D. Mckay, Constant time generation of free trees SIAM. J. Comput. 15 (1986), 540--548.
• Figure Captions Fig. 1. Scatterplot of zeros z = x + iy of polynomials of degrees 16 with constant term 1
• The Case Against Micropayments Andrew Odlyzko
• Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals
• On the Properties of a TreeStructured Server Process Rutgers University
• Social Networks and Mathematical Models: A Research Commentary on ``Critical Mass and
• The Many Paradoxes of Broadband Andrew Odlyzko
• Flat Versus Metered Rates, Bundling, and "Bandwidth Hogs"
• The low utilization and high cost of data networks Andrew Odlyzko
• The Bumpy Road of Electronic Commerce Andrew Odlyzko
• Foreword : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : v Preface : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
• Sidebar 3: Digital signatures There are methods for creating digital signatures using conventional cryptosystems, but
• Primes, Quantum Chaos, and Computers A. M. Odlyzko
• A modest proposal for preventing Internet congestion Andrew Odlyzko
• The Internet and other networks: Utilization rates and their implications Andrew Odlyzko
• Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars
• The Internet and other networks: Utilization rates and their implications Andrew Odlyzko
• An efficient micropayment system based on probabilistic Stanislaw Jarecki
• Internet growth: Myth and reality, use and abuse Andrew Odlyzko
• On the Distribution of Multiplicative Translates of Sets of Residues (mod p) Royal Institute of Technology
• Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko
• Paris Metro Pricing for the Internet Andrew Odlyzko
• On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer
• Contemporary Mathematics 22 nd zero of the Riemann zeta function
• The visible problems of the invisible computer: A skeptical look at information appliances
• The future of scientific communication Andrew Odlyzko
• Fast Cryptanalysis of the MatsumotoImai Public Key Scheme P. Delsarte
• Discriminants, class numbers, regulators, zero of zeta functions 19 13. H. COHEN and H.W. LENSTRA, Jr., Heuristics on class groups of number
• Decreasing energy functions for some cellular automata
• ON THE DISTRIBUTION OF SPACINGS BETWEEN ZEROS OF THE ZETA FUNCTION
• The economics of electronic journals Andrew Odlyzko
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• Smart and stupid networks: Why the Internet is like Microsoft Andrew Odlyzko
• Too expensive to meter: The influence of transaction costs in transportation and
• The economics of the Internet: Utility, utilization, pricing, and Quality of Andrew Odlyzko
• New analytic algorithms in number theory A. M. Odlyzko
• [TR] The legacies of World War II, (a roundtable discussion with H. Brooks, J. W. Forrester, P. Morrison, A. Roland, S. van Evera, E. C. Weaver, H. Woolf),
• Content is not king Andrew Odlyzko
• Disproof of the Mertens Conjecture A. M. Odlyzko
• The Unsolvable Privacy Problem and its Implications for Security Technologies
• On Heights of Monotonically Labelled Binary Trees A. M. Odlyzko
• Review of Network Economics Vol.3, Issue 3 September 2004 The Evolution of Price Discrimination in Transportation and its Implications
• Limit Distributions for Coefficients of Iterates of Polynomials with Applications to Combinatorial Enumerations
• Discrete logarithms: The past and the future Andrew Odlyzko
• Discrete logarithms in finite fields and their cryptographic significance A. M. Odlyzko
• On Heights of Monotonically Labelled Binary Trees A. M. Odlyzko
• 1. J. M. Akinpelu. The overload performance of engineered networks with nonhierar chical and hierarchical routing. AT&T Bell Laboratories Technical Journal, 63:1261--
• [161] M. Willett, ``Trapdoor knapsacks without superincreasing structure,'' Inform. Process. Let ters, vol. 17, July 1983, pp. 711.
• Fine Spectra and Limit Laws II. FirstOrder 0--1 Laws
• Monotonic subsequences in dimensions higher than one
• 10 ANDREW M. ODLYZKO AT&T Bell Laboratories, Murray Hill, New Jersey 07974
• Dynamic Behavior of Differential Pricing and Quality of Service Options for the Peter C. Fishburn and Andrew M. Odlyzko
• Economics, Psychology, and Sociology of Andrew Odlyzko
• Privacy and the Clandestine Evolution of Ecommerce Andrew Odlyzko
• Internet growth: Myth and reality, use and abuse Andrew Odlyzko
• Internet pricing and the history of communications Andrew Odlyzko
• The asymptotic behavior of a family of sequences P. Erdo .. s
• Review of Network Economics Vol.2, Issue 3 September 2003 Data Networks are Lightly Utilized, and will Stay that Way
• THE ZETA FUNCTION ON THE CRITICAL LINE: NUMERICAL EVIDENCE FOR MOMENTS AND RANDOM
• On the number of distinct block sizes in partitions of a set
• The Rise and Fall of Knapsack Cryptosystems A. M. Odlyzko
• [14] J. E. Mazo and A. M. Odlyzko, Lattice points in highdimensional spheres, Monatsh. Math. 110 (1990), 4761.
• A refutation of Metcalfe's Law and a better estimate for the value
• Differences of the partition function A. M. Odlyzko
• Asymptotic expansions for the coefficients of analytic generating functions
• p ht p i hffi 0p n i 1 hffi 0p
• The Case Against Micropayments Andrew Odlyzko
• Digital rights management: Desirable, inevitable, and almost irrelevant
• Data networks are lightly utilized, and will stay that way Andrew Odlyzko
• ENUMERATION OF STRINGS A. M. Odlyzko
• On subspaces spanned by random selections of 1 vectors
• Pricing and Architecture of the Internet: Historical Perspectives from Telecommunications and
• Internet growth: Is there a ``Moore's Law'' for data traffic? K. G. Coffman and A. M. Odlyzko
• Index Calculation Attacks on RSA Signature and Encryption Jean-Sebastien Coron1, Yvo Desmedt2, David Naccache1,
• Smart and stupid networks: Why the Internet is like Microsoft Andrew Odlyzko
• Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte
• The low utilization and high cost of data networks Andrew Odlyzko
• Some New Methods and Results in Tree Enumeration A. M. Odlyzko
• Lattice Points in HighDimensional Spheres A. M. Odlyzko
• Asymptotic Enumeration Methods A. M. Odlyzko
• On the Complexity of Computing Discrete Logarithms and Factoring Integers A. M. Odlyzko
• MINIMALDISTANCE ROUTING FOR KYKLOS II D. Z. Du F. K. Hwang & A. M. Odlyzko Y. J. Zhang
• Attacks on Shamir's 'RSA for paranoids' Henri Gilbert
• The asymptotic number of set partitions with unequal block A. Knopfmacher
• Table 1. Minimal absolute values of discriminants of number fields of degree n with 2r 2 complex conjugate fields.
• Competitive pricing of information goods: Subscription pricing versus payperuse
• The size and growth rate of the Internet K. G. Coffman
• The Many Paradoxes of Broadband Andrew Odlyzko
• [18] C. Pomerance, Analysis and comparison of some integer factoring algorithms, Computational Methods in Number Theory: Part 1, H. W. Lenstra, Jr., and
• [16] A. M. Odlyzko, Extremal and statistical properties of trigonometric polynomials with \Sigma1 and 0; 1 coefficients, manuscript in preparation.
• Internet pricing and the history of communications Andrew Odlyzko
• On the Unimodality of High Convolutions of Discrete Distributions
• L a T E X filename: Algebraic.tex (Paper: 1.2 [2]) 12:08 p.m. October 20, 1993 Algebraic Properties
• Internet TV: Implications for the long distance network A. M. Odlyzko
• Connectedness, classes, and cycle index E. A. Bender, P. J. Cameron, A. M. Odlyzko and B. L. Richmond
• On longest increasing subsequences in random permutations A. M. Odlyzko
• The history of communications and its implications for the Internet Andrew Odlyzko
• RANDOM SHUFFLES AND GROUP REPRESENTATIONS A. M. Odlyzko
• Digital rights management: Desirable, inevitable, and almost irrelevant
• Privacy and the Clandestine Evolution of Ecommerce Andrew Odlyzko
• Differences of the partition function A. M. Odlyzko
• MINIMAL-DISTANCE ROUTING FOR KYKLOS II D. Z. Du F. K. Hwang & A. M. Odlyzko Y. J. Zhang
• Internet pricing in light of the history of communications Andrew Odlyzko
• Growth of the Internet K. G. Coffman and A. M. Odlyzko
• Internet tra#c growth: Sources and implications Andrew M. Odlyzko
• [40] H. S. Wilf, Generatingfunctionology, Academic Press, 1990. [41] M. Wyman, The asymptotic behavior of the Laurent coefficients, Canad. J. Math.,
• Telecom dogmas and spectrum allocations Andrew Odlyzko
• On the Density of Sequences of Integers the Sum of No Two of Which is a Square II. General Sequences
• "!#%$'&()0%$')12345"'$6&78@9#ACBED'F@9!3 "E"'$GEHI!#P$& H9QD9R@4#STUV#TWD'9
• The history of communications and its implications for the Internet Andrew Odlyzko
• Partitions of planar sets into small triangles Andrew M. Odlyzko
• Internet growth: Myth and reality, use and abuse Andrew Odlyzko
• On the Distribution of Multiplicative Translates of Sets of Residues (mod p) Royal Institute of Technology
• It is often said (following Gauss) that number theory is the queen of mathematics. Until comparatively recently, most people tended to view
• ANALYTIC COMPUTATIONS IN NUMBER THEORY 13 Congress Math. 1986, Amer. Math. Soc., Providence, 1987.
• The delusions of net neutrality Andrew Odlyzko
• [43] R. P. Stanley. Enumerative Combinatorics, volume I. Wadsworth & Brooks/Cole, 1986. [44] V. E. Stepanov. Limit distributions of certain characteristics of random mappings.
• Privacy, Economics, and Price Discrimination on the Internet
• Figure 1: Graph of S k for a random walk of 10 6 steps. [14] M. Kolountzakis, message posted to TheoryNet on Jan. 4, 1990.
• Collective hallucinations and inefficient markets: The British Railway Mania of the 1840s
• Pricing and Architecture of the Internet: Historical Perspectives from Telecommunications and
• New analytic algorithms in number theory A. M. Odlyzko
• On the Properties of a Tree-Structured Server Process Rutgers University
• Economics, Psychology, and Sociology of Andrew Odlyzko
• The size and growth rate of the Internet K. G. Coffman
• On the number of distinct block sizes in partitions of a set
• Electronic Transactions on Numerical Analysis. Volume 1, pp. 104111, December 1993.
• An Optimal Acceptance Policy for an Urn Scheme Robert W. Chen
• NONEXISTENCE OF SIEGEL ZEROS IN TOWERS OF RADICAL EXTENSIONS11 1. H. Aramata.
• Providing Security With Insecure Systems Andrew Odlyzko
• Data networks are lightly utilized, and will stay that way Andrew Odlyzko
• Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model
• [33] R. Needham and M. Schroeder, Using encryption for authentication in large networks of computers, Comm. ACM 21 (1978), 993999.
• The rapid evolution of scholarly communication Andrew Odlyzko
• p ht p i hffi 0p n i 1 hffi 0p
• Application of Symbolic Mathematics to Mathematics A. M. Odlyzko
• [16] WINKLER, F., Polynomial Algorithms in Computer Algebra, Springer, 1996 (in press). [17] ZIPPEL, R., Effective Polynomial Computation, Kluwer, 1993.
• An improved bound for the de BruijnNewman constant A. M. Odlyzko
• JUMPING CHAMPIONS ANDREW ODLYZKO, MICHAEL RUBINSTEIN, AND MAREK WOLF
• Explicit Tauberian estimates for functions with positive coefficients
• Dynamic Behavior of Differential Pricing and Quality of Service Options for the Internet
• The asymptotic behavior of a family of sequences Hungarian Academy of Sciences
• ENUMERATION OF STRINGS A. M. Odlyzko
• SUPERCOMPUTERS AND THE RIEMANN ZETA FUNCTION A. M. Odlyzko
• [P 77b] D. Plaisted, New NPhard and NPcomplete polynomial and integer divisibility problems, Proc. 18 FOCS, IEEE, 1977, pp. 241253.
• 10 ANDREW M. ODLYZKO Figure 1. Differences d 1 (n) for 10 4 primes near 10 12 .
• Functional iteration and the Josephus problem Andrew M. Odlyzko
• [16] WINKLER, F., Polynomial Algorithms in Computer Algebra, Springer, 1996 (in press). [17] ZIPPEL, R., Effective Polynomial Computation, Kluwer, 1993.
• Internet growth: Is there a "Moore's Law" for data traffic? K. G. Coffman and A. M. Odlyzko
• Growth of the Internet K. G. Coffman and A. M. Odlyzko
• Silicon dreams and silicon bricks: the continuing evolution of Andrew Odlyzko
• Computing p(x): An Analytic Method J. C. Lagarias
• The Internet and past and future communications revolutions
• Limit Distributions for Coefficients of Iterates of Polynomials with Applications to Combinatorial Enumerations
• Telecom dogmas and spectrum allocations Andrew Odlyzko
• On the periods of some graph transformations A. M. Odlyzko
• On subspaces spanned by random selections of 1 vectors
• Discrete logarithms: The past and the future Andrew Odlyzko
• The Rise and Fall of Knapsack Cryptosystems A. M. Odlyzko
• Paris Metro Pricing: The minimalist differentiated services solution Andrew Odlyzko
• [Story] G. A. Story, L. O'Gorman, D. Fox, L. L. Schaper, and H. V. Jagadish, The RightPages imagebased electronic library for alerting and browsing, IEEE Computer 25 (no. 9, Sept.
• f 1 (k \Gamma 2) f 0 (k \Gamma 1)
• On the Unimodality of High Convolutions of Discrete Distributions
• T. Beth, N. Cot, and I. Ingemarsson, SpringerVerlag Lecture Notes in Computer Science #209, 1985.
• Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals
• SUPERCOMPUTERS AND THE RIEMANN ZETA FUNCTION A. M. Odlyzko
• Some New Methods and Results in Tree Enumeration A. M. Odlyzko
• Review of Network Economics Vol.8, Issue 1 March 2009 Network Neutrality, Search Neutrality, and the Never-ending Conflict
• The Internet and past and future communications revolutions
• Too expensive to meter: The influence of transaction costs in transportation and
• The economics of the Internet: Utility, utilization, pricing, and Quality of Andrew Odlyzko
• NUMERICAL STUDY OF THE DERIVATIVE OF THE RIEMANN ZETA FUNCTION AT ZEROS
• Bubbles, gullibility, and other challenges for economics, psychology, sociology, and information
• The collapse of the Railway Mania, the development of capital markets, and Robert Lucas Nash, a
• This time is different: An example of a giant, wildly speculative, and successful investment mania
• Social Networks and Mathematical Models: A Research Commentary on "Critical Mass and
• The delusions of net neutrality Andrew Odlyzko
• Network neutrality, search neutrality, and the never-ending conflict between efficiency and fairness
• A refutation of Metcalfe's Law and a better estimate for the value
• Andrew Odlyzko 2006 32 Chapter 4: Economic costs of toll access
• Internet TV: Implications for the long distance network A. M. Odlyzko
• Internet growth: Myth and reality, use and abuse Andrew Odlyzko
• The future of scientific communication Andrew Odlyzko
• Content is not king Andrew Odlyzko
• The visible problems of the invisible computer: A skeptical look at information appliances
• Dynamic Behavior of Differential Pricing and Quality of Service Options for the Internet
• Dynamic Behavior of Differential Pricing and Quality of Service Options for the Peter C. Fishburn and Andrew M. Odlyzko
• The slow evolution of electronic publishing Andrew Odlyzko
• !"!#$"%!&(')0#21354670#849&@BA$&049#C14242!ED ')49@B%F)$&$&49#HG2I20P(0Q&0AG2AR#S%!&(')TUAR&
• The Bumpy Road of Electronic Commerce Andrew Odlyzko
• Asymptotic Enumeration Methods A. M. Odlyzko
• Lattice Points in High-Dimensional Spheres A. M. Odlyzko
• Decreasing energy functions for some cellular automata
• Fast algorithms for multiple evaluations of the Riemann zeta function
• On the periods of some graph transformations A. M. Odlyzko
• ON THE DISTRIBUTION OF SPACINGS BETWEEN ZEROS OF THE ZETA FUNCTION
• A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes
• Partitions of planar sets into small triangles Andrew M. Odlyzko
• Asymptotic expansions for the coefficients of analytic generating functions
• Application of Symbolic Mathematics to Mathematics A. M. Odlyzko
• Disproof of the Mertens Conjecture A. M. Odlyzko
• COMPUTING (x)(x): THE MEISSEL-LEHMER METHOD J. C. Lagarias
• Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme
• On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer
• Alan Turing and the Riemann Zeta Function Dennis A. Hejhala,b
• Charles Mackay's own extraordinary popular delusions and the Railway Mania
• Algorithms 63 11.8 Discrete logarithms over finite fields
• The volume and value of information Andrew Odlyzko