**Genome-scale metabolic network validation of Shewanella oneidensis using transposon insertion frequency analysis**, H. Yang, E. W. Krumholz, E. D. Brutinel, N. P. Palani, M. J. Sadowsky, A. M. Odlyzko, J. A. Gralnick, and I. G. L. Libourel,*PLOS Computational Biology*, vol. 10, no. 9, Sept. 2014, e1003848. [online journal version]**The forgotten discovery of gravity models and the inefficiency of early railway networks**, A. Odlyzko.*OEconomia*, to appear. [preprint, PDF]**The early British railway system, the Casson counterfactual, and the effectiveness of central planning**, A. Odlyzko. [preprint, PDF]**The past, evolving present and future of discrete logarithm**, A. Joux, A. Odlyzko, and C. Pierrot,*Open Problems in Mathematical and Computational Sciences*, C. K. Koc, ed., Springer, 2014, pp. 5-36. [preprint, PDF]**Collaborating with the enemy on network management**, C. Hall, D. Yu, Z.-L. Zhang, J. Stout, A. Odlyzko, A. W. Moore, J. Camp, K. Benton, and R. Anderson,*Security Protocols XXII*, B. Christianson, J. Malcolm, V. Matyas, P. Svenda, F. Stajano, and J. Anderson, eds., Lecture Notes in Computer Science No. 8809, Springer, 2014, pp. 154-162. [preprint, PDF]**Economically irrational pricing of 19th century British government bonds**, A. Odlyzko. [preprint, PDF]**Supplementary material for `Economically irrational pricing of 19th century British government bonds'**, A. Odlyzko. [preprint, PDF]**Open Access and the evolution of scholarly communication**, A. Odlyzko.*Newsletter of the European Mathematical Society*, no. 91, March 2014, pp. 41-42. [preprint, text] [entire issue, online]**Are libraries and Open Access becoming irrelevant?**, A. Odlyzko.*Notices of the American Mathematical Society*, vol. 61, no. 4, April 2014, pp. 390-392. [online version]**Will smart pricing finally take off?**, A. Odlyzko. Pages 3-33 in*Smart Data Pricing*, S. Sen, C. Joe-Wong, S. Ha, and M. Chiang, eds., Wiley, 2014. [preprint, PDF]**Turing and computations in pure maths**, A. Odlyzko.*Cybertalk*, no. 3, Sept. 2013, pp. 40-41. [preprint, PDF] [online version of journal issue]**Open Access, library and publisher competition, and the evolution of general commerce**, A. Odlyzko.*Evaluation Review*, vol. 39, no. 1, Feb. 2015, pp. 130-163. [preprint, PDF] [online journal version]**The Railway Mania: Fraud, disappointed expectations, and the modern economy**, A. Odlyzko.*J. Railway & Canal Historical Society*, no. 215, Nov. 2012, pp. 2-12. [preprint, PDF]**Web history and economics**, A. Odlyzko.*Computer Networks*, vol. 56, no. 18, 2012, pp. 3886-3890. [preprint, PDF]**Know Your Limits: Considering the Role of Data Caps and Usage Based Billing in Internet Access Service**, A. Odlyzko, B. St. Arnaud, E. Stallman, and M. Weinberg, Public Knowledge, May 2012. [white paper, PDF]**Crushing national debts, economic revolutions, and extraordinary popular delusions**, A. Odlyzko. [PDF]**The volume and value of information**, A. Odlyzko.*International Journal of Communication*, vol. 6, 2012. [online journal version, PDF]**Discrete logarithms over finite fields**, A. Odlyzko. In*Handbook of Finite Fields*, G. Mullen and D. Panario, eds., CRC Press, 2013, pp. 393-401. [preprint, PDF]**Charles Mackay's own extraordinary popular delusions and the Railway Mania**, A. Odlyzko. [PDF]**The collapse of the Railway Mania, the development of capital markets, and the forgotten role of Robert Lucas Nash**, A. Odlyzko.*Accounting History Review*(formerly*Accounting, Business & Financial History*), vol. 21, no. 3, Nov. 2011, pp. 309-345. An extended preprint, entitled**The collapse of the Railway Mania, the development of capital markets, and Robert Lucas Nash, a forgotten pioneer of accounting and financial analysis**, is available: [preprint, PDF]**Alan Turing and the Riemann zeta function**, D. A. Hejhal and A. M. Odlyzko. In*Alan Turing - His Work and Impact*, S. Barry Cooper and Jan van Leeuwen, eds., Elsevier, 2013, pp. 265-279. [PDF]**Numerical study of the derivative of the Riemann zeta function at zeros**, G. A. Hiary and A. M. Odlyzko,*Commentarii Mathematici Universitatis Sancti Pauli*, vol. 60, no. 1-2, 2011, pp. 47-60. [PDF]**Flat versus metered rates, bundling, and "bandwidth hogs**," P. Nabipay, A. Odlyzko, and Z.-L. Zhang.*Proceedings of NetEcon 11: 6th Workshop on the Economics of Networks, Systems, and Computation*. [NetEcon 11 program, with papers] [preprint, PDF]**Neutrality and non-neutrality, from the past to the future**, A. Odlyzko.*Intermedia*, vol. 39, no. 1, March 2011, pp. 4-6. [text]**The manifold problems of technology forecasting**, A. Odlyzko.*Phi Beta Kappa Key Reporter*, Fall 2010, p. 7. [Key Reporter online version] [preprint, txt]**The zeta function on the critical line: Numerical evidence for moments and random matrix theory models**, G. A. Hiary and A. M. Odlyzko,*Math. Comp.*, vol. 81, no. 279, July 2012, pp. 1723-1752. [preprint, PDF]**Bubbles, gullibility, and other challenges for economics, psychology, sociology, and information sciences**, A. Odlyzko.*First Monday*, vol. 15, no. 9, Sept. 2010. [PDF] [First Monday version]**This time is different: An example of a giant, wildly speculative, and successful investment mania**, A. Odlyzko.*B.E. Journal of Economic Analysis & Policy*, vol. 10, issue 1, 2010, article 60. [BEJEAP version] [preprint, PDF]**Collective hallucinations and inefficient markets: The British Railway Mania of the 1840s**, A. Odlyzko. [PDF] [PRC, for Kindle and related devices]**Providing security with insecure systems**, A. Odlyzko. Extended abstract.*WiSec'10: Proceedings of the Third ACM Conference on Wireless Network Security*, ACM, 2010, pp. 87-88. [PDF]**Interactions, competition and innovation in a service-oriented Internet: An economic model**, Z.-L. Zhang, P. Nabipay, A. Odlyzko, and R. Guerin, INFOCOM 2010 Mini-conference Proceedings, IEEE, 2010. [PDF]**The Internet and past and future communications revolutions**, A. Odlyzko.*IEEE Internet Computing*, vol. 14, no. 1, Jan/Feb 2010, pp. 20-21. [PDF]**Social networks and mathematical models: A research commentary on `Critical mass and willingness to pay for social networks' by J. Christopher Westland**, A. Odlyzko.*Electronic Commerce Research and Applications*, vol. 9, 2010, pp. 26-28. [PDF]**Technology predictions: Intelligence and brute force**, A. Odlyzko.*ON Magazine*, No. 4, 2009, pp. 48-50. [text] [ON Magazine issue]**The delusions of net neutrality**, A. Odlyzko. Telecommunications Policy Research Conference, 2008. [PDF]**The Internet's role in aggravating and alleviating the energy crises**, A. Odlyzko.*Internet Evolution*, April 8, 2008. [extended preprint, text] [Internet Evolution version]**Threats to the Internet: Too much or too little growth?**, A. Odlyzko.*Internet Evolution*, February 25, 2008. [text] [Internet Evolution version]**Network neutrality, search neutrality, and the never-ending conflict between efficiency and fairness in markets**, A. Odlyzko.*Review of Network Economics*, vol. 8, no. 1, March 2009, pp. 40-60. [RNE full paper]Preprint: [PDF]

**Digital rights management: Desirable, inevitable, and almost irrelevant**, A. Odlyzko. Extended abstract.*DRM'07: Proc. 2007 ACM Workshop on Digital Rights Management*, ACM, 2007, pp. 39-40. [PDF]**Privacy and the clandestine evolution of ecommerce**, A. Odlyzko. To appear in*Proceedings ICEC2007: Ninth International Conference on Electronic Commerce*, ACM, 2007. [PDF]**Too expensive to meter: The influence of transaction costs in transportation and communication**, David Levinson and Andrew Odlyzko. In special issue on Networks: Modeling and control,*Phil. Trans. Royal Soc. A*, vol. 366, no. 1872, 2008, pp. 2033-2046. [PDF]A more detailed preprint with the same title: [PDF]

**Metcalfe's Law is Wrong**, B. Briscoe, A. Odlyzko, and B. Tilly,*IEEE Spectrum*, July 2006, pp. 26-31. [online version]An earlier and more detailed preprint:

**A refutation of Metcalfe's Law and a better estimate for the value of networks and network interconnections**, A. Odlyzko and B. Tilly. [PDF]**Economic costs of toll access**, A. M. Odlyzko. Pages 32-35 in*Open Access: Key Strategic, Technical and Economic Aspects*, Neil Jacobs, ed., Chandos, 2006. [Chapter, PDF]**Technobubbles: Ancient, recent, and future**, A. Odlyzko. Om Malik's blog,*Five Years After the Bubble*series. [text] [Om Malik's blog]**Finding a voice: Learning from history**, A. M. Odlyzko. Pages 58-64 in*Connected Homes*, F. Gil de Bernabe y Varela, ed., Cisco, 2004. [text] [online version of Connected Homes book]**Index calculation attacks on RSA signature and encryption**, J.-S. Coron, Y. Desmedt, D. Naccache, A. Odlyzko, and J. P. Stern,*Designs, Codes, and Cryptography*, vol. 38, no. 1, Jan. 2006, pp. 41-53. [PDF]**Telecom dogmas and spectrum allocations**, A. M. Odlyzko. Written for the*Wireless Unleashed*blog. [PDF] [Wireless Unleashed blog]**Layer architectures and regulation in telecommunications**, A. M. Odlyzko. Pages 16-19 in New Millennium Research Council report,*Free Ride: Deficiencies of the MCI 'Layers' Policy Model and the Need for Principles that Encourage Competition in the New IP World*, July 2004. [preprint, text] [full NMRC report, PDF]**Why electronic publishing means people will pay different prices**, A. M. Odlyzko.*Nature*web forum,*Access to the literature: The debate continues*, March 25, 2004. [preprint, text] [Nature version]**The evolution of price discrimination in transportation and its implications for the Internet**, A. M. Odlyzko,*Review of Network Economics*, vol. 3, no. 3, September 2004, pp. 323-346. [RNE full paper]This paper is based on a more extensive manuscript, presented at TPRC 2004,

**Pricing and architecture of the Internet: Historical perspectives from telecommunications and transportation**, A. M. Odlyzko. [PDF]**Privacy, economics, and price discrimination on the Internet**, A. M. Odlyzko.*ICEC2003: Fifth International Conference on Electronic Commerce*, N. Sadeh, ed., ACM, 2003, pp. 355-366. Reprinted on pp. 187-211 of*Economics of Information Security*, L. Jean Camp and S. Lewis, eds., Kluwer, 2004. Also reprinted on pp. 39-61 of*The Icfaian Journal of Management Research*, vol. 3, no. 12, December 2004. [PDF]**Data networks are lightly utilized, and will stay that way**, A. M. Odlyzko,*Review of Network Economics*, 2 (no. 3), September 2003, pp. 210-237. [RNE full paper]Original 1998 preprint: [Abstract] [PDF]

**The many paradoxes of broadband**, A. M. Odlyzko.*First Monday*, 8 (no. 9), September 2003. [PDF] [First Monday version]**Internet traffic growth: Sources and implications**, A. M. Odlyzko.*Optical Transmission Systems and Equipment for WDM Networking II*, B. B. Dingel, W. Weiershausen, A. K. Dutta, and K.-I. Sato, eds., Proc. SPIE, vol. 5247, 2003, pp. 1-15. [PDF]**The unsolvable privacy problem and its implications for security technologies**, A. M. Odlyzko.*Information Security and Privacy: 8th Australasian Conference, ACISP 2003*, R. Safavi-Naini and J. Seberry, eds., Lecture Notes in Computer Science #2727, Springer, 2003, pp. 51-54. [PDF] [text]**The case against micropayments**, A. M. Odlyzko.*Financial Cryptography: 7th International Conference, FC 2003*, R. N. Wright, ed., Lecture Notes in Computer Science #2742, Springer, 2003, pp. 77-83. [PDF] [text]**Economics, psychology, and sociology of security**, A. M. Odlyzko.*Financial Cryptography: 7th International Conference, FC 2003*, R. N. Wright, ed., Lecture Notes in Computer Science #2742, Springer, 2003, pp. 182-189. [PDF] [text]**False hopes**, A. M. Odlyzko.*Red Herring*, no. 123, March 2003, p. 31. [text, with corrigendum]**Peer and non-peer review**, A. M. Odlyzko.*Peer Review in Health Sciences*, 2nd ed., F. Godlee and T. Jefferson, eds., BMJ Books, 2003, pp. 309-311. [text]**Roxane Googin's predictions and the telecom world**, A. M. Odlyzko.*The Cook Report on the Internet*, vol. 11, no. 1-2, April-May 2002, pp. 53-58. [text]**Comments on the Larry Roberts and Caspian Networks study of Internet traffic growth**, A. M. Odlyzko.*The Cook Report on the Internet*, Dec. 2001, pp. 12-15. [text]**Talk, Talk, Talk: So who needs streaming video on a phone? The killer app for 3G may turn out to be--surprise--voice calls**, A. M. Odlyzko.*Forbes*, August 20, 2001, p. 28. [text] [Forbes version]**Internet TV: Implications for the long distance network**, A. M. Odlyzko. In*Internet Television*, E. Noam, J. Groebel, and D. Gerbarg, eds., Lawrence Erlbaum Associates, 2003, pp. 9-18. [PDF] [text]**Growth of the Internet**, K. G. Coffman and A. M. Odlyzko. In*Optical Fiber Telecommunications IV B: Systems and Impairments*, I. P. Kaminow and T. Li, eds. Academic Press, 2002, pp. 17-56. [PDF]**Mathematics, cryptology, and technology**, A. M. Odlyzko. Foreward to*Public-Key Cryptography and Computational Number Theory*, K. Alster, J. Urbanowicz, and H. C. Williams, eds., Walter de Gruyter, 2001, pp. ix-x. [preprint, text]**The Public Library of Science and the ongoing revolution in scholarly communication**, A. M. Odlyzko.*Nature*web forum,*Future e-access to the primary literature*, Sept. 18, 2001. [preprint, text] [Nature version]**The myth of Internet time**, A. M. Odlyzko.*Technology Review*, 104(3) (April 2001), pp. 92-93. [preprint, text] [Technology Review version]**Internet growth: Myth and reality, use and abuse**, A. M. Odlyzko.*iMP: Information Impacts Magazine*, November 2000. [PDF] [iMP version]An updated and slightly revised version has appeared in

*J. Computer Resource Management*, issue 102, Spring 2001, pp. 23-27. [PDF]**The future of scientific communication**, A. M. Odlyzko.*Access to Publicly Financed Research: The Global Research Village III, Amsterdam 2000*, P. Wouters and P. Schroeder, eds., NIWI, 2000, pp. 273-278. [Abstract] [PDF]**The 10^22-nd zero of the Riemann zeta function**, A. M. Odlyzko.*Dynamical, Spectral, and Arithmetic Zeta Functions*, M. van Frankenhuysen and M. L. Lapidus, eds., Amer. Math. Soc., Contemporary Math. series, no. 290, 2001, pp. 139-144. [Abstract] [PDF]**Internet growth: Is there a "Moore's Law" for data traffic?**, K. G. Coffman and A. M. Odlyzko.*Handbook of Massive Data Sets*, J. Abello, P. M. Pardalos, and M. G. C. Resende, eds., Kluwer, 2002, pp. 47-93. [Abstract] [PDF]**Content is not king**, A. M. Odlyzko.*First Monday*6(2) (February 2001), http://firstmonday.org/. [Abstract] [PDF] [First Monday version]**Internet pricing and the history of communications**, A. M. Odlyzko.*Computer Networks*36 (2001), pp. 493-517. Also to be published in*Internet Services*, Lee McKnight and John Wroclawski, eds., MIT Press, 2001. [Abstract] [PDF] An extended abstract, entitled**Internet pricing in light of the history of communication**has appeared in*Scalability and Traffic Control in IP Networks*, S. Fahmy and K. Park, eds., Proc. SPIE, vol. 4526 (2001), pp. 237-243. [Abstract] [PDF] An even more abbreviated version has appeared under the title**Should flat-rate Internet pricing continue?**,*IT Professional*2 (no. 5) (Sept.-Oct. 2000), pp. 48-51. [IT Pro version]Both of the above papers are derived from a larger and more comprehensive work:

**The history of communications and its implications for the Internet**, A. M. Odlyzko. [Abstract] [PDF]**Cryptographic abundance and pervasive computing**, A. M. Odlyzko.*iMP: Information Impacts Magazine*, June 2000. [text] [iMP version]**The rapid evolution of scholarly communication**, A. M. Odlyzko.*Learned Publishing*, 15(1) (Jan. 2002), pp. 7-19. Also in*Economics and usage of digital libraries: byting the bullet*, W. Lougee and J. MacKie-Mason, eds., University of Michigan University Library, 2008. [Abstract] [PDF] [Word] [Learned Publishing version] [version in Lougee and MacKie-Mason book] [entire Lougee and MacKie-Mason book]**The current state and likely evolution of the Internet**, A. M. Odlyzko.*Proc. Globecom'99*, IEEE, 1999, pp. 1869-1875. [Abstract] [PDF]**The stupid network: Essential yet unattainable**, A. M. Odlyzko.*ACM netWorker*, 3(4) (Dec. 1999), pp. 36-37. [text]**An improved bound for the de Bruijn-Newman constant**, A. M. Odlyzko,*Numerical Algorithms*, 25 (2000), pp. 293-303. [Abstract] [PDF]**The visible problems of the invisible computer: A skeptical look at information appliances**, A. M. Odlyzko.*First Monday*4(9) (September 1999), http://firstmonday.org/. [Abstract] [PDF] [text] [First Monday version]**Discrete logarithms: The past and the future**, A. M. Odlyzko,*Designs, Codes, and Cryptography*19 (2000), pp. 129-145. Reprinted in*Towards a Quarter-Century of Public Key Cryptography*, N. Koblitz, ed., Kluwer, 2000, pp. 59-75. [Abstract] [PDF]**Abstracting and reviewing in the digital era**, A. M. Odlyzko,*NFAIS Newsletter*41 (no. 6) (June 1999), pp. 85, 90-92. [text]**Paris Metro Pricing: The minimalist differentiated services solution**, A. M. Odlyzko,*Proc. 1999 Seventh International Workshop on Quality of Service (IWQoS '99)*, IEEE, 1999, pp. 159-161. [PDF] [text]The above position paper is based on a more detailed paper:

**Paris Metro Pricing for the Internet**, A. M. Odlyzko,*Proc. ACM Conference on Electronic Commerce (EC'99)*, ACM, 1999, pp. 140-147. [Abstract] [PDF] [text]Both of the above papers are based on an earlier 1997 unpublished manuscript:

**A modest proposal for preventing Internet congestion**, A. M. Odlyzko. [Abstract] [PDF] [text]**Data networks are mostly empty and for good reason**, A. M. Odlyzko,*IT Professional*1 (no. 2) (March/April 1999), pp. 67-69. [IT Pro version] An early preprint, entitled**The low utilization and high cost of data networks**, is available here. [PDF] [text]**Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals**, A. M. Odlyzko.*Journal of Electronic Publishing*4(4) (June 1999), in the online collection*The Transition from Paper: Where are we Going and how will we get there?*, R. S. Berry and A. S. Moffatt, eds., American Academy of Arts & Sciences, http://www.amacad.org/publications/trans.htm, and in*J. Scholarly Publishing*30(4) (July 1999), pp. 163-185. [Abstract] [PDF] [text] [Word] [JEP version] [AAA&S collection version]**The evolution of electronic scholarly communication**, A. M. Odlyzko, pp. 3-4 in*Science Editing and Information Management (Proc. Second Intern. AESE/CBE/EASE Joint Meeting, Sixth Intern. Conf. Geoscience Information, and Thirty-second Annual Meeting of Assoc. Earth Science Editors)*, C. J. Manson, ed., Geoscience Information Society, 1999. [text]**On longest increasing subsequences in random permutations**, A. M. Odlyzko and E. M. Rains, pp. 439-451 in*Analysis, Geometry, Number Theory: The Mathematics of Leon Ehrenpreis*, E. L. Grinberg, S. Berhanu, M. Knopp, G. Mendoza, and E. T. Quinto, eds., Amer. Math. Soc., Contemporary Math. #251, 2000. [Abstract] [PDF] [comments]**The Internet and other networks: Utilization rates and their implications**, A. M. Odlyzko,*Information Economics & Policy*12 (2000), pp. 341-365. [Abstract] [PDF]**Who should own scientific papers?**, S. Bachrach, R. S. Berry, M. Blume, T. von Foerster, A. Fowler, P. Ginsparg, S. Heller, N. Kestner, A. Odlyzko, A. Okerson, R. Wigington, and A. Moffat,*Science*281 (no. 5382) (Sept. 4, 1998), pp. 1459-1460. [HTML] [Science version]**The future of money**, A. M. Odlyzko. [text]**The economics of the Internet: Utility, utilization, pricing, and Quality of Service**, A. M. Odlyzko. [Abstract] [PDF]**Smart and stupid networks: Why the Internet is like Microsoft**, A. M. Odlyzko,*ACM netWorker*, 2(5) (Dec. 1998), pp. 38-46. [Abstract] [PDF] [text] [netWorker version]**The size and growth rate of the Internet**, K. G. Coffman and A. M. Odlyzko,*First Monday*3(10) (October 1998), http://firstmonday.org/. [Abstract] [PDF] [First Monday version]**Dynamic behavior of differential pricing and Quality of Service options for the Internet**, P. C. Fishburn and A. M. Odlyzko,*Proc. First Intern. Conf. on Information and Computation Economies (ICE-98)*, ACM Press, 1998, pp. 128-139. [Abstract] [PDF] Extended version in*Decision Support Systems*, 28 (2000), pp. 123-136: [PDF]*Emerging Applications of Number Theory*, D. A. Hejhal, J. Friedman, M. C. Gutzwiller, and A. M. Odlyzko, eds., Springer Verlag, 1999. [Preface, PDF] [Table of Contents, PDF]**Connectedness, classes, and cycle index**, E. A. Bender, P. J. Cameron, A. M. Odlyzko, and L. B. Richmond,*Combinatorics, Probability, and Computing*, 8 (1999), pp. 31-43. [PDF]**The asymptotic number of set partitions with unequal block sizes**, A. Knopfmacher, A. M. Odlyzko, B. Pittel, L. B. Richmond, D. Stark, G. Szekeres, and N. C. Wormald,*Electronic J. Combinatorics*6(1) (1999), R2 (37pp.), http://www.combinatorics.org. [PDF] [EJC version]**Attacks on Shamir's 'RSA for paranoids'**, H. Gilbert, D. Gupta, A. M. Odlyzko, and J.-J. Quisquater,*Information Processing Letters*68 (1998), pp. 197-199. [PDF]**Jumping champions**, A. Odlyzko, M. Rubinstein, and M. Wolf,*Experimental Math.*, 8 (no. 2) (1999), pp. 107-118. [PDF, 2 MB] [Exp. Math. version]**Outsourcing of research: Change and stability**, A. M. Odlyzko, in*Trends in Industrial Innovation: Industry Perspectives and Policy Implications, 1997 Forum Proceedings*, Sigma Xi, 1998, pp. 17-22. [text]**The slow evolution of electronic publishing**, A. M. Odlyzko, in*Electronic Publishing '97: New Models and Opportunities*, A. J. Meadows and F. Rowland, eds., ICCC Press, 1997, pp. 4-18. [PDF] [Word] [text]**Competitive pricing of information goods: Subscription pricing versus pay-per-use**, P. C. Fishburn and A. M. Odlyzko,*Economic Theory*13 (1999), pp. 447-470. [PDF]**Silicon dreams and silicon bricks: the continuing evolution of libraries**, A. M. Odlyzko,*Library Trends*46 (no. 1) (Summer 1997), pp. 152-167. [PDF] [text]**Electronics and the future of education**, A. M. Odlyzko.*On the Horizon*5(4) (July/August 1997), pp. 8-9. Extended version in the online collection*The Transition from Paper: Where are we Going and how will we get there?*, R. S. Berry and A. S. Moffatt, eds., American Academy of Arts & Sciences, http://www.amacad.org/publications/trans.htm. [text] [extended version] [extended version in AAA&S collection]**The economics of electronic journals**, A. M. Odlyzko.*First Monday*2(8) (August 1997), http://firstmonday.org/, and*Journal of Electronic Publishing*4(1) (September 1998), Definitive version on pp. 380-393 in*Technology and Scholarly Communication,*R. Ekman and R. E. Quandt, eds., Univ. Calif. Press, 1999. [PDF] [text] [Word] [First Monday version] [JEP version]**An efficient micropayment system based on probabilistic polling**, S. Jarecki and A. M. Odlyzko, in*Financial Cryptography*, R. Hirschfeld, ed., Lecture Notes in Computer Science #1318, Springer, 1997, pp. 173-191. [PDF]**Fine spectra and limit laws II. First-order 0-1 laws**, S. Burris, K. Compton, A. Odlyzko, and B. Richmond,*Canad. J. Math.*49 (1997), pp. 641-652. [PDF]**Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars**, P. C. Fishburn, A. M. Odlyzko, and R. C. Siders,*First Monday*2(7) (July 1997), http://firstmonday.org/. Definitive version on pp. 167-189 in*Internet Publishing and Beyond: The Economics of Digital Information and Intellectual Property*, B. Kahin and H. R. Varian, eds., MIT Press, 2000. [PDF] [Word] [First Monday version]**An optimal acceptance policy for an urn scheme**, R. W. Chen, A. Zame, A. M. Odlyzko, and L. A. Shepp,*SIAM J. Discrete Math.*11 (1997), pp. 183-195. [PDF]**Monotonic subsequences in dimensions higher than one**, A. M. Odlyzko, J. B. Shearer, and R. C. Siders,*Electronic J. Combinatorics*4(2) (1997), R14 (9pp.), http://www.combinatorics.org. [PDF] [EJC version] [comments]**The bumpy road of electronic commerce**, A. M. Odlyzko, in*WebNet 96 - World Conf. Web Soc. Proc.*, H. Maurer, ed., AACE, 1996, pp. 443-456. [PDF] [text] [WebNet online proceedings]**Computer algebra and its applications: Where are we going?**, A. M. Odlyzko, in*Beherrschung von Informationssystemen*, H. C. Mayr, ed., R. Oldenbourg, 1996, pp. 33-41. [PDF]**On the road to electronic publishing**, A. M. Odlyzko,*Euromath Bulletin*, 2 (no. 1) (1996), pp. 49-60. [text]**A nonlinear equation and its application to nearest neighbor spacings for zeros of the zeta function and eigenvalues of random matrices**, P. J. Forrester and A. M. Odlyzko, in*Organic Mathematics*, J. Borwein, P. Borwein, L. Jorgenson, and R. Corless, eds., Amer. Math. Soc. 1997, pp. 239-250. Electronic version available at http://www.cecm.sfu.ca/projects/OMP/. [PDF] A condensed version,**GUE eigenvalues and Riemann zeta function zeros: A non-linear equation for a new statistic**has appeared in*Phys. Rev. E*54 (1996), pp. R4493-R4495. [PDF]**Short proofs for nondivisibility of sparse polynomials under the extended Riemann hypothesis**, D. Yu. Grigoriev, M. Karpinski, and A. M. Odlyzko,*Fund. Inform.*28 (1996), pp. 297-301. Preliminary version on pp. 117-122 in*Proc. Intern. Symp. Symbolic Algebraic Computation: ISSAC '92*, P. S. Wang (ed.), ACM Press, (1992). [PDF]**The future of research: Decline or transformation?**, A. M. Odlyzko, in*Proc. 19th Annual Meeting*, C. H. McGruder, III, and W. E. Collins, eds., Nat. Soc. Black Physicists, 1996, pp. 89-93. [text]**We still need unfettered research**, A. M. Odlyzko,*Research*Technology Management*, 39 (no. 1) (Jan.-Feb. 1996), pp. 9-11. [text]**The decline of unfettered research**, A. M. Odlyzko, version of October 4, 1995. [PDF] [text] [Pantaneto Forum, issue 56, October 2014]**Analytic methods in asymptotic enumeration**, A. M. Odlyzko,*Discrete Math.*153 (1996), pp. 229-238. [PDF]**Tragic loss or good riddance? The impending demise of traditional scholarly journals**, A. M. Odlyzko, full version in*Intern. J. Human-Computer Studies*(formerly*Intern. J. Man-Machine Studies*) 42 (1995), pp. 71-122, and in the electronic*J. Univ. Comp. Sci.*, pilot issue, vol. 0, 1994. Condensed version in*Notices Amer. Math. Soc.*, vol. 42 (Jan. 1995), pp. 49-53, and reprinted in*Deutsche Math. Ver. Mitteilungen*, 1995 (no. 1), pp. 19-24, and, in a French traslation by D. Foata,**Perte tragique ou bon debarras? La disparition imminente des revues savantes traditionnelles,**in*Gazette des mathematiciens*, no. 63 (1995), pp. 41-52. It has also been reprinted, as part of an electronic discussion presentation, on pp. 63-73 of*Scholarly Journals at the Crosroads: A Subversive Proposal for Electronic Publishing,*A. S. Okerson and J. J. O'Donnell, eds., Assoc. Res. Lib. 1995 and on pp. 91-101 in*Scholarly Publishing: The Electronic Frontier,*Robin P. Peek and Gregory B. Newby, eds., MIT Press, 1996. [text of full and condensed versions] [PDF of full version] [PDF of condensed version] [JUCS online version] [condensed AMS Notices version]**Nonabelian sets with distinct k-sums**, A. M. Odlyzko and W. D. Smith,*Discrete Math.*146 (1995), pp. 169-177. [PDF]**The future of integer factorization**, A. M. Odlyzko,*CryptoBytes (The technical newsletter of RSA Laboratories)*1 (no. 2) (1995), pp. 5-12. [PDF] [CryptoBytes issue]**Pebbling a chessboard**, F. R. K. Chung, R. L. Graham, J. A. Morrison, and A. M. Odlyzko,*Amer. Math. Monthly*102 (1995), pp. 113-123. [PDF]**Search for the maximum of a random walk**, A. M. Odlyzko,*Random Struct. Alg.*6 (1995), pp. 275-295. (Short abstract in*Adv. Appl. Prob.*24 (1992) p. 768. Extended abstract in*Proc. 26-th ACM Symp. Theory Comp.*(1994), pp. 336-345.) [PDF]**Asymptotic enumeration methods**, A. M. Odlyzko, in*Handbook of Combinatorics*, vol. 2, R. L. Graham, M. Groetschel, and L. Lovasz, eds., Elsevier, 1995, pp. 1063-1229. [PDF, 1.1 MB]**Discrete logarithms and smooth polynomials**, A. M. Odlyzko, pp. 269-278 in*Finite Fields: Theory, Applications and Algorithms*, G. L. Mullen and P. Shiue, eds., Amer. Math. Soc., Contemporary Math. #168 (1994). [PDF]**Analytic computations in number theory**, A. M. Odlyzko,*Mathematics of Computation 1943-1993: A Half-Century of Computational Mathematics*, W. Gautschi (ed.), Amer. Math. Soc., Proc. Symp. Appl. Math. #48 (1994), pp. 451-463. [PDF]**Public key cryptography**, A. M. Odlyzko,*AT&T Tech. J.*, 73:5 (Sept.-Oct. 1994), pp. 17-23. [PDF]**Construction of invertible sequences for multipath estimation**, A. M. Odlyzko, pp. 323-331 in*Communications and Cryptography: Two sides of One Tapestry*, R. E. Blahut, D. J. Costello, Jr., U. Maurer, and T. Mittelholzer (eds.), Kluwer, (1994). [PDF]**Minimal-distance routing for KYKLOS II**, D. Z. Du, F. K. Hwang, A. M. Odlyzko, and Y. J. Zhang,*Networks*, 24 (1994), pp. 103-108, (Preliminary version in Proc. 1987 Intern. Conf. Parallel Processing, S. K. Sahni, ed., Pennsylvania State University Press, 1987, pp. 546-549.) [PDF]**On the distribution of multiplicative translates of sets of residues (mod p)**, J. Hastad, J. C. Lagarias, and A. M. Odlyzko,*J. Number Theory*, 46 (1994), pp. 108-122. [PDF]**A New Lehmer pair of zeros and a new lower bound for the de Bruijn-Newman constant LAMBDA**, G. Csordas, A. M. Odlyzko, W. Smith, and R. S. Varga,*Electr. Trans. Num. Anal.*, 1 (1993), pp. 104-111. [PDF] [comments]**The distribution of heights of binary trees and other simple trees**, Ph. Flajolet, Z. Gao, A. Odlyzko, and B. Richmond,*Combinatorics, Probability, and Computing*, 2 (1993), pp. 145-156. [PDF]**Zeros of polynomials with 0,1 coefficients**, A. M. Odlyzko and B. Poonen,*L'Enseign. Math.*, 39 (1993), pp. 317-348. [online journal version] [PDF]**Fast parallel solution of fixed point equations for the performance evaluation of circuit-switched networks**, A. G. Greenberg, A. M. Odlyzko, J. Rexford, and D. Espinosa, pp.59-74 in*Performance '93: Proc. 16-th IFIP W.G.7.3 Intern. Symp. Computer Perf. Modeling, Measurement, and Evaluation*, G. Iazeolla and S. S. Lavenberg (eds.), Elsevier, (1993). [PDF]**Iterated absolute values of differences of consecutive primes**, A. M. Odlyzko,*Math. Comp.*, 61 (1993), pp. 373-380. [online journal version]**Nonexistence of Siegel zeros in towers of radical extensions**, A. M. Odlyzko, and C. M. Skinner, pp. 499-511 in*A Tribute to Emil Grosswald: Number Theory and Related Analysis*, M. Knopp and M. Sheingorn (eds.), American Math. Soc., Contemporary Math. #143 (1993). [PDF]**Explicit Tauberian estimates for functions with positive coefficients**, A. M. Odlyzko,*J. Computational Appl. Math.*, 41 (1992), pp. 187-197. [PDF] [comments]**Improved low-density subset sum algorithms**, M. J. Coster, A. Joux, B. A. LaMacchia, A. M. Odlyzko, C. P. Schnorr, and J. Stern,*Computational Complexity*, 2 (1992), pp. 111-128. [PDF]**An improved low-density subset sum algorithm**, M. J. Coster, B. A. LaMacchia, A. M. Odlyzko, and C. P. Schnorr, pp. 54-67 in*Advances in Cryptology - EUROCRYPT '91*, D. W. Davies (ed.), Springer Verlag, Lecture Notes in Computer Science #547 (1991). [PDF]**On the packing densities of superballs and other bodies**, N. D. Elkies, A. M. Odlyzko, and J. A. Rush,*Inventiones math.*, 105 (1991), pp. 613-639. [online journal version]**On the properties of a tree-structured server process**, J. Komlos, A. M. Odlyzko, L. H. Ozarow, and L. A. Shepp,*Ann. Appl. Prob.*, 1 (1991), pp. 118-125. [PDF]**Computation of discrete logarithms in prime fields**, B. A. LaMacchia and A. M. Odlyzko,*Designs, Codes, and Cryptography*, 1 (1991), pp. 46-62, Extended abstract in*Advances in Cryptology - CRYPTO '90*, A. J. Menezes, and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537, 1991, pp. 616-618. [PDF]**Solving large sparse linear systems over finite fields**, B. A. LaMacchia and A. M. Odlyzko, pp. 109-133 in*Advances in Cryptology - CRYPTO '90*, A. J. Menezes and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537 (1991). [PDF]**Functional iteration and the Josephus problem**, A. M. Odlyzko and H. S. Wilf,*Glasgow Math. J.*, 33 (1991), pp. 235-240. [PDF]**Cryptanalysis: A survey of recent results**, E. F. Brickell and A. M. Odlyzko, pp. 501-540 in*Contemporary Cryptology*, G. J. Simmons (ed.), IEEE Press (1991). Preliminary version in*Proc. IEEE 76*, 1988, pp. 578-593. [PDF]**Lattice points in high-dimensional spheres**, J. E. Mazo and A. M. Odlyzko,*Monatsh. Math.*, 110 (1990), pp. 47-61. [online journal version]**Primes, quantum chaos, and computers**, A. M. Odlyzko, pp. 35-46 in*Number Theory*, National Research Council (1990). [PDF]**The rise and fall of knapsack cryptosystems**, A. M. Odlyzko, pp. 75-88 in*Cryptology and Computational Number Theory*, C. Pomerance (ed.), Am. Math. Soc., Proc. Symp. Appl. Math. #42 (1990). [PDF]**Bounds for discriminants and related estimates for class numbers, regulators, and zeros of zeta functions: A survey of recent results**, A. M. Odlyzko,*Sem. Theorie des Nombres, Bordeaux*, 2 (1990), pp. 119-141. [PDF] [PDF of updated tables and references] [comments]**Random mapping statistics**, P. Flajolet and A. M. Odlyzko, pp. 329-354 in*Advances in Cryptology - EUROCRYPT '89*, J.-J. Quisquater and J. Vandewalle (eds.), Springer Verlag, Lecture Notes in Computer Science #434 (1990). [PDF]**On the number of alignments of k sequences**, J. R. Griggs, P. Hanlon, A. M. Odlyzko, and M. S. Waterman,*Graphs and Combinatorics*, 6 (1990), pp. 133-146.**Singularity analysis of generating functions**, P. Flajolet and A. M. Odlyzko,*SIAM J. Discrete Math.*, 3 (1990) pp. 216-240. [PDF]**Supercomputers and the Riemann zeta function**, A. M. Odlyzko, pp. 348-352 in*Supercomputing '89: Supercomputing Structures & Computations, Proc. 4-th Intern. Conf. on Supercomputing*, L. P. Kartashev and S. I. Kartashev (eds.), Intern. Supercomputing Inst. (1989). [PDF]**Unique subjective probability on finite sets**, P. C. Fishburn and A. M. Odlyzko,*J. Ramanujan Math. Soc.*, 4 (1989), pp. 1-23.**Two-sided generalized Fibonacci sequences**, P. C. Fishburn, A. M. Odlyzko, and F. S. Roberts,*Fibonacci Quart.*, 27 (1989), pp. 352-361.**Decreasing energy functions and lengths of transients for some cellular automata**, E. Goles and A. M. Odlyzko,*Complex Systems*, 2 (1988), pp. 501-507. [PDF]**The editor's corner: n coins in a fountain**, A. M. Odlyzko and H. S. Wilf,*Amer. Math. Monthly*, 95 (1988), pp. 840-843.**Fast algorithms for multiple evaluations of the Riemann zeta function**, A. M. Odlyzko and A. Schoenhage,*Trans. Am. Math. Soc.*, 309 (1988), pp. 797-809. [online journal version]**Large deviations of sums of independent random variables**, H. L. Montgomery and A. M. Odlyzko,*Acta Arith.*, 49 (1988), pp. 427-434. [online journal version]**Balancing sets of vectors**, N. Alon, E. E. Bergmann, D. Coppersmith, and A. M. Odlyzko,*IEEE Trans. Information Theory*, IT-34 (1988), pp. 128-130. [PDF]**On subspaces spanned by random selections of +-1 vectors**, A. M. Odlyzko,*J. Combinatorial Theory A*, 47 (1988), pp. 124-133. [PDF]**Simple, efficient asynchronous parallel algorithms for maximization**, A. G. Greenberg, B. D. Lubachevsky, and A. M. Odlyzko,*ACM Trans. Programming Languages and Systems*, 1988, pp. 313-337. Preliminary version in*Proc. 4th ACM Symp. Principles Distrib. Computing,*1985, pp. 300-308.**Differences of the partition function**, A. M. Odlyzko,*Acta Arith.*, 49 (1988), pp. 237-254. [online journal version]*Advances in cryptology - CRYPTO '86*, A. M. Odlyzko, ed., Springer Verlag, Lecture Notes in Computer Science #263, 1987.**On the periods of some graph transformations**, A. M. Odlyzko and D. J. Randall,*Complex Systems*, 1 (1987), pp. 203-210. [PDF]**New analytic algorithms in number theory**, A. M. Odlyzko, pp. 466-475 in*Proceedings 1986 International Congress of Mathematicians*, Amer. Math. Soc., 1987, [PDF]**On the distribution of spacings between zeros of the zeta function**, A. M. Odlyzko,*Math. Comp.*, 48 (1987), pp. 273-308. [online journal version]**Ramsey-Sperner theory**, Z. Furedi, J. R. Griggs, A. M. Odlyzko, and J. B. Shearer,*Discrete Math.*, 63 (1987), pp. 143-152.**On the residues of products of prime numbers**, P. Erdos, A. M. Odlyzko, and A. Sarkozy,*Period. Math. Hungar.*, 18 (1987), pp. 229-239.**Bandwidths and profiles of trees**, A. M. Odlyzko and H. S. Wilf,*J. Combinatorial Theory B*, 42 (1987), pp. 348-370. Condensed summary of results in*Graph Theory and its Applications to Algorithms and Computer Science,*Y. Alavi et al., eds., Wiley, 1985, pp. 605-622. [comments]**The asymptotic behavior of a family of sequences**, P. Erdos, A. Hildebrand, A. Odlyzko, P. Pudaite, and B. Reznick,*Pacific J. Math.*, 126 (1987), pp. 227-241. [PDF]**Computing pi(x): An analytic method**, J. C. Lagarias and A. M. Odlyzko,*J. Algorithms*, 8 (1987), pp. 173-191. [PDF]**On the complexity of computing discrete logarithms and factoring integers**, A. M. Odlyzko, pp. 113-116 in*Open Problems in Communication and Computation*, T. M. Cover and B. Gopinath (eds.), Springer, 1987. [PDF]**Half weight block codes for optical comunication**, E. E. Bergmann, A. M. Odlyzko, and S. H. Sangani,*AT&T Technical J.*, 65 (3) (May-June 1986), pp. 85-93.**On the existence of optimum cyclic burst-correcting codes**, K. A. S. Abdel-Ghaffar, R. J. McEliece, A. M. Odlyzko, and H. C. A. van Tilborg,*IEEE Trans. Information Theory*, IT-32 (1986), pp. 768-775.**Probabilistic analysis of optimum partitioning**, N. Karmarkar, R. M. Karp, G. S. Lueker, and A. M. Odlyzko,*J. Appl. Prob.*, 23 (1986), pp. 626-645. [comments]**A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes**, Y. Desmedt and A. M. Odlyzko, pp. 516-522 in*Advances in Cryptology - CRYPTO '85*, H. C. Williams (ed.), Springer Verlag, Lecture Notes in Computer Science #218, 1986. [PDF]**Discrete logarithms in GF(p)**, D. Coppersmith, A. M. Odlyzko, and R. Schroeppel,*Algorithmica*, 1 (1986), pp. 1-15.**k-Color Sperner theorems**, J. R. Griggs, A. M. Odlyzko, and J. B. Shearer,*J. Combinatorial Theory A*, 42 (1986), pp. 31-54.**Balloting labelling and personnel assignment**, W. D. Wei, Y. Z. Cai, C. L. Liu, and A. M. Odlyzko,*SIAM J. Alg. Discr. Methods*, 7 (1986), pp. 150-158.**Constant time generation of free trees**, R. A. Wright, B. Richmond, A. M. Odlyzko, and B. D. McKay,*SIAM J. Comp.*, 15 (1986), pp. 540-548.**Probabilities for intersecting systems and random subsets of finite sets**, P. C. Fishburn, P. Frankl, D. Freed, J. C. Lagarias, and A. M. Odlyzko,*SIAM J. Alg. Discr. Methods*, 7 (1986), pp. 73-79.**Partitions of planar sets into small triangles**, A. M. Odlyzko, J. Pintz, and K. B. Stolarsky,*Discrete Math.*, 57 (1985), pp. 89-97. [PDF]**Enumeration of strings**, A. M. Odlyzko, pp. 205-228 in*Combinatorial Algorithms on Words*, A. Apostolico and Z. Galil (eds.), Springer, 1985. [PDF]**On heights of monotonically labelled binary trees**, A. M. Odlyzko,*Congressus Numerantium*, 44 (1985), pp. 305-314. [PDF]**Asymptotic expansions for the coefficients of analytic generating functions**, A. M. Odlyzko and L. B. Richmond,*Aequationes Math.*, 28 (1985), pp. 50-63. [online journal version]**On the number of distinct block sizes in partitions of a set**, A. M. Odlyzko and L. B. Richmond,*J. Combinatorial Theory A*, 38 (1985), pp. 170-181. [PDF]**Applications of symbolic mathematics to mathematics**, A. M. Odlyzko, pp. 95-111 in*Applications of Computer Algebra*, R. Pavelle (ed.), Kluwer-Nijhoff Publishing, 1985. [PDF]**On the capacity of disjointly shared networks**, J. C. Lagarias, A. M. Odlyzko, and D. B. Zagier,*Computer Networks and ISDN Systems*, 10 (1985), pp. 275-285.**Fast cryptanalysis of the Matsumoto-Imai public key scheme**, P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, pp. 142-149 in*Advances in Cryptology: Proceedings of EUROCRYPT 84*, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985. [PDF]**Discrete logarithms in finite fields and their cryptographic significance**, A. M. Odlyzko, pp. 224-314 in*Advances in Cryptology: Proceedings of EUROCRYPT 84*, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985. [PDF]**Disproof of the Mertens conjecture**, A. M. Odlyzko and H. J. J. te Riele,*J. reine angew. Math.*, 357 (1985), pp. 138-160. [PDF]**On the unimodality of high convolutions of discrete distributions**, A. M. Odlyzko and L. B. Richmond,*Ann. Prob.*, 13 (1985), pp. 299-306. [PDF]**Computing pi(x): The Meissel-Lehmer method**, J. C. Lagarias, V. S. Miller, and A. M. Odlyzko,*Math. Comp.*, 44 (1985), pp. 537-560. [online journal version]**The asymptotic number of irreducible partitions**, E. A. Bender, A. M. Odlyzko, and L. B. Richmond,*European J. Combinatorics*, 6 (1985), pp. 1-6.**Random shuffles and group representations**, L. Flatto, A. M. Odlyzko, and D. B. Wales,*Ann. Prob.*, 13 (1985), pp. 154-178. [PDF]**Solving low-density subset sum problems**, J. C. Lagarias and A. M. Odlyzko,*J. ACM*, 32 (1985), pp. 229-246. Preliminary version in*Proc. 24th IEEE Foundations Computer Science Symp.*, pp. 1-10, 1983.**Limit distributions for coefficients of iterates of polynomials with applications to combinatorial enumeration**, P. Flajolet and A. M. Odlyzko,*Math. Proc. Cambridge Phil. Soc.*, 96 (1984), pp. 237-253. [PDF]**Some new methods and results in tree enumeration**, A. M. Odlyzko,*Congressus Numerantium*, 42 (1984), pp. 27-52. [PDF]**Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's signature scheme**, A. M. Odlyzko,*IEEE Trans. Information Theory*, IT-30 (1984), pp. 594-601. [PDF]**Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems**, E. F. Brickell, J. C. Lagarias, and A. M. Odlyzko, pp. 39-42 in*Advances in Cryptology: Proceedings of Crypto 83*, D. Chaum (ed.), Plenum Press, 1984.**Algebraic properties of cellular automata**, O. Martin, A. M. Odlyzko, and S. Wolfram,*Comm. Math. Physics*, 93 (1984), pp. 219-258, Reprinted in*Theory and Applications of Cellular Automata*, S. Wolfram, Ed., World Scientific, 1986, pp. 51-90, and in*Cellular Automata and Complexity: Collected Papers of Stephen Wolfram*, Addison-Wesley, 1994, pp. 71-113. [PDF] [higher quality Project Euclid copy]**Optimal sequential selection of N random variables under a constraint,**R. W. Chen, V. N. Nair, A. M. Odlyzko, L. A. Shepp, and Y. Vardi,*J. Appl. Prob.*, 21 (1984), pp. 537-547.**New algorithms for computing pi(x)**, J. C. Lagarias and A. M. Odlyzko, pp. 176-193 in*Number Theory: New York 1982*, D. V. Chudnovsky, G. V. Chudnovsky, H. Cohn and M. B. Nathanson (eds.), Springer-Verlag, Lecture Notes in Mathematics #1052, 1984.**Gaps between zeros of the zeta function**, H. L. Montgomery and A. M. Odlyzko, pp. 1079-1106 in*Topics in Classical Number Theory: Coll. Math. Soc. Janos Bolyai 34.*, G. Halasz (ed.), North-Holland, 1984.**On subsets with cardinalities of intersections divisible by a fixed integer**, P. Frankl and A. M. Odlyzko,*European J. Combinatorics*, 4 (1983), pp. 215-220. [PDF]**A differential equation arising in chromatic sum theory**, A. M. Odlyzko and L. B. Richmond,*Congressus Numerantium*, 40 (1983), pp. 263-275.**On the average product of Gauss-Markov variables**, B. F. Logan, J. E. Mazo, A. M. Odlyzko, and L. A. Shepp,*Bell System Tech. J.*, 62 (1983), pp. 2993-3006. [online journal version]**On the tightest packing of sums of vectors**, J. R. Griggs, J. C. Lagarias, A. M. Odlyzko, and J. B. Shearer,*European J. Combinatorics*, 4 (1983), pp. 231-236.**Irreducibility testing and factorization of polynomials**, L. M. Adleman and A. M. Odlyzko,*Math. Comp.*, 41 (1983), pp. 699-709. Preliminary version in*Proc. 22nd IEEE Foundations Computer Science Symp.*, pp. 409-418, 1981. [online Math. Comp. version]**On the density of sequences of integers the sum of no two of which is a square. II. General sequences**, J. C. Lagarias, A. M. Odlyzko, and J. B. Shearer,*J. Comb. Theory A*, 34 (1982), pp. 123-139. [PDF]**On the density of sequences of integers the sum of no two of which is a square. I. Arithmetic progressions**, J. C. Lagarias, A. M. Odlyzko, and J. B. Shearer,*J. Comb. Theory A*, 33 (1982), pp. 167-185.**The average height of binary trees and other simple trees**, P. Flajolet and A. M. Odlyzko,*J. Computer System Sci.*, 25 (1982), pp. 171-213.**On the unimodality of some partition polynominals**, A. M. Odlyzko and B. Richmond,*European J. Combinatorics*, 3 (1982), pp. 69-84.**Minima of cosine sums and maxima of polynomials on the unit circle**, A. M. Odlyzko,*J. London Math. Soc. (2)*, 26 (1982), pp. 412-420.**Periodic oscillations of coefficients of power series that satisfy functional equations**, A. M. Odlyzko,*Advances in Math.*, 44 (1982), pp. 180-205.**On the ranks of some (0,1)-matrices with constant row sums**, A. M. Odlyzko,*J. Australian Math. Soc. A*, 31 (1981), pp. 193-201.**Bounds for eigenvalues of certain stochastic matrices**, H. J. Landau and A. M. Odlyzko,*Linear Algebra Appl.*, 38 (1981), pp. 5-15.**Values of cyclotomic polynomials at roots of unity**, R. P. Kurshan and A. M. Odlyzko,*Math. Scand.*, 49 (1981), pp. 15-35.**On an irreducibility theorem of A. Cohn**, J. Brillhart, M. Filaseta, and A. M. Odlyzko,*Canad. J. Math.*, 33 (1981), pp. 1055-1059.**On exceptions of integral quadratic forms**, A. M. Odlyzko and N. J. A. Sloane,*J. reine angew. Math.*, 321 (1981), pp. 212-216. [online journal version]**Periods in strings**, L. J. Guibas and A. M. Odlyzko,*J. Comb. Theory A*, 30 (1981), pp. 19-42.**String overlaps, pattern matching, and nontransitive games**, L. J. Guibas and A. M. Odlyzko,*J. Comb. Theory A*, 30 (1981), pp. 183-208.**The numerical verification of Thompson's identity**, A. M. Odlyzko,*Inventiones math.*, 58 (1980), pp. 97-98. Appendix 1 to the paper*Thompson's Problem (sigma^2 = 3)*by E. Bombieri,*Inventiones math. 58*(1980), 77-100. [online journal version]**A theta-function identity for nonlattice packings**, A. M. Odlyzko and N. J. A. Sloane,*Studia Sci. Math. Hungar.*, 15 (1980), pp. 461-465. Reprinted in*Development of the Mathematical Ideas of Mykhailo Kravchuk (Krawtchouk)*, N. Virchenko, I. Katchanovski, V. Haidey, R. Andrushkiw, and R. Voronka, eds., National Technical University of Ukraine "KPI," 2004, pp. 453-457.**On the compositions of an integer**, A. M. Odlyzko and B. Richmond, pp. 199-210 in*Combinatorial Mathematics VII*, R. W. Robinson, G. W. Southern and W. D. Wallis (eds.), Springer-Verlag, Lecture Notes in Mathematics #829, 1980.**Divisibility properties of some cyclotomic sequences**, J. C. Lagarias and A. M. Odlyzko,*Amer. Math. Monthly*, 87 (1980), pp. 561-564.**Recursive linear digital filters with a uniform power distribution**, R. P. Kurshan and A. M. Odlyzko,*Electronics Letters*, 16 (1980), pp. 672-673.**Long repetitive patterns in random sequences**, L. J. Guibas and A. M. Odlyzko,*Z. Wahrscheinlichkeitstheorie verw. Geb.*, 53 (1980), pp. 241-262.**Exploring binary trees and other simple trees**, P. Flajolet and A. M. Odlyzko, pp. 207-216 in*Proc. 21st IEEE Foundations Computer Science Symp.*, 1980.**A new proof of the linearity of the Boyer-Moore string searching algorithm**, L. J. Guibas and A. M. Odlyzko,*SIAM J. Computing*, 9 (1980), pp. 672-682. Preliminary version in*Proc. 18th IEEE Foundations Computer Science Symp.*, pp. 189-195, 1977.**New bounds on the number of unit spheres that can touch a unit sphere in n dimensions**, A. M. Odlyzko and N. J. A. Sloane,*J. Comb. Theory A*, 26 (1979), pp. 210-214. Reprinted in modified form as Chapter 13, Bounds on kissing numbers, pp. 337-339 in J. H. Conway and N. J. A. Sloane,*Sphere Packings, Lattices and Codes*, Springer 1988.**On computing Artin L-functions in the critical strip**, J. C. Lagarias and A. M. Odlyzko,*Math. Comp.*, 33 (1979), pp. 1081-1095. [online journal version]**A bound for the least prime ideal in the Chebotarev density theorem**, J. C. Lagarias, H. L. Montgomery, and A. M. Odlyzko,*Inventiones math.*, 54 (1979), pp. 271-296. [online journal version]**Coefficient inaccuracy in FIR filters**, A. Gersho, B. Gopinath, and A. Odlyzko, pp. 375-377 in*Proc. IEEE Int. Symp. Acoustics, Speech, Signal Processing*, Washington D.C., April 1979.**Coefficient inaccuracy in transversal filtering**, A. Gersho, B. Gopinath, and A. M. Odlyzko,*Bell System Tech. J.*, 58 (1979), pp. 2301-2316. [online journal version]**On the density of odd integers of the form (p-1)/2^k and related questions**, P. Erdos and A. M. Odlyzko,*J. Number Theory*, 11 (1979), pp. 257-263.**Enumeration of power sums modulo a prime**, A. M. Odlyzko and R. P. Stanley,*J. Number Theory*, 10 (1978), pp. 263-272.**Nonnegative digit sets in positional number systems**, A. M. Odlyzko,*Proc. London Math. Soc. (3)*, 37 (1978), pp. 213-229.**Self-dual codes over GF(4)**, F. J. MacWilliams, A. M. Odlyzko, N. J. A. Sloane, and H. N. Ward,*J. Comb. Theory A*, 25 (1978), pp. 288-318.**Maximal prefix-synchronized codes**, L. J. Guibas and A. M. Odlyzko,*SIAM J. Appl. Math.*, 35 (1978), pp. 401-418.**Extremal self-dual lattices exist only in dimensions 1-8, 12, 14, 15, 23, and 24**, J. H. Conway, A. M. Odlyzko, and N. J. A. Sloane,*Mathematika*, 25 (1978), pp. 36-43. Reprinted in modified form as Chapter 19, Enumeration of extremal self-dual lattices, pp. 439-442 in J. H. Conway and N. J. A. Sloane,*Sphere Packings, Lattices and Codes*, Springer 1988.**Bounds for binary codes of length less than 25**, M. R. Best, A. E. Brouwer, F. J. MacWilliams, A. M. Odlyzko, and N. J. A. Sloane,*IEEE Trans. Information Theory*, IT-24 (1978), pp. 81-93.**On conductors and discriminants**, A. M. Odlyzko, pp. 377-407 in*Algebraic Number Fields*, A. Frohlich (ed.), Academic Press, 1977.**Lower bounds for discriminants of number fields II**, A. M. Odlyzko,*Tohoku Math. J.*, 29 (1977), pp. 209-216.**Pelikan's conjecture and cyclotomic cosets**, F. J. MacWilliams and A. M. Odlyzko,*J. Combinatorial Theory A*, 22 (1977), pp. 110-114.**Effective versions of the Chebotarev density theorem**, J. C. Lagarias and A. M. Odlyzko, pp. 409-464 in*Algebraic Number Fields*, A. Frohlich (ed.), Academic Press, 1977.**A probability inequality and its application to switching networks**, F. K. Hwang and A. M. Odlyzko,*Bell System Tech. J.*, 56 (1977), pp. 821-826. [online journal version]**Lower bounds for discriminants of number fields**, A. M. Odlyzko,*Acta Arith.*, 29 (1976), pp. 275-297. [online journal version]**Some analytic estimates of class numbers and discriminants**, A. M. Odlyzko,*Inventiones math.*, 29 (1975), pp. 275-286. [online journal version]**Upper bounds for modular forms, lattices, and codes**, C. L. Mallows, A. M. Odlyzko, and N. J. A. Sloane,*J. Algebra*, 36 (1975), pp. 68-76.**A new theorem about the Mattson-Solomon polynomial and some applications**, A. M. Kerdock, F. J. MacWilliams, and A. M. Odlyzko,*IEEE Trans. Information Theory*, IT-20 (1974), pp. 85-89.**On DSN antenna scheduling**, L. H. Harper, R. J. McEliece, and A. M. Odlyzko,*JPL Deep Space Network Progress Reports*, 42-20 (1974), pp. 53-56.**On the foundations of combinatorial theory. VIII. Finite operator calculus**, G. C. Rota, D. Kahaner, and A. M. Odlyzko,*J. Math. Anal. and Appl.*, 42 (1973), pp. 684-760. Reprinted in*Finite Operator Calculus*, Academic Press, 1975.**Lattice points and the volume/area ratio of convex bodies**, J. Bokowski and A. M. Odlyzko,*Geometriae Dedicata*, 2 (1973), pp. 249-254.**What are the Latin square groups?**, J. J. Carroll, G. A. Fisher, A. M. Odlyzko, and N. J. A. Sloane,*Amer. Math. Monthly*, 80 (1973), pp. 1045-1046.**On covering a product of sets with products of their subsets**, A. M. Odlyzko,*Discrete Math.*, 5 (1973), pp. 373-380.**On lattice points inside convex bodies**, A. M. Odlyzko,*Amer. Math. Monthly*, 80 (1973), pp. 915-918.**Sieve methods**, A. M. Odlyzko, California Inst. Tech., 1971. (Lecture notes.) [online version]**Preparation of 3'-dinucleotides from homoribopolymers by digestion with micrococcal nuclease**, E. Sulkowski, A. M. Odlyzko, and M. Laskowski, Sr.,*Anal. Biochemistry*, 38 (1970), pp. 393-400.