| 2010 | INFOCOM | Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model. | Zhi-Li Zhang, Papak Nabipay, Andrew M. Odlyzko, Roch Gurin |
| 2008 | CISS | Economics and technology in the evolution of networks. | Andrew M. Odlyzko |
| 2003 | ACISP | The Unsolvable Privacy Problem and Its Implications for Security Technologies. | Andrew M. Odlyzko |
| 2003 | FC | The Case Against Micropayments. | Andrew M. Odlyzko |
| 2003 | FC | Economics, Psychology, and Sociology of Security. | Andrew M. Odlyzko |
| 2003 | FC | Does Anyone Really Need MicroPayments? | Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot |
| 2000 | LATIN | Integer Factorization and Discrete Logarithms (Abstract). | Andrew M. Odlyzko |
| 1997 | FC | An Efficient Micropayment System Based on Probabilistic Polling. | Stanislaw Jarecki, Andrew M. Odlyzko |
| 1996 | GI | Computer Algebra and its Applications: Where are we Going? | Andrew M. Odlyzko |
| 1994 | STOC | Search for the maximum of a random walk. | Andrew M. Odlyzko |
| 1992 | EuroCrypt | 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 |
| 1992 | ISSAC | Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. | Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko |
| 1991 | EuroCrypt | An Improved Low-Denisty Subset Sum Algorithm. | Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr |
| 1990 | CRYPTO | Solving Large Sparse Linear Systems over Finite Fields. | Brian A. LaMacchia, Andrew M. Odlyzko |
| 1990 | CRYPTO | Computation of Discrete Logarithms in Prime Fields (Extended Abstract). | Brian A. LaMacchia, Andrew M. Odlyzko |
| 1989 | EuroCrypt | Random Mapping Statistics. | Philippe Flajolet, Andrew M. Odlyzko |
| 1987 | ICPP | Minimal-Distance Routing for Kykios II. | Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang |
| 1985 | CRYPTO | A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. | Yvo Desmedt, Andrew M. Odlyzko |
| 1985 | PODC | Simple, Efficient Asynchronous Parallel Algorithms for Maximization. | Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko |
| 1984 | EuroCrypt | Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. | Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret |
| 1984 | EuroCrypt | Discrete Logarithms in Finite Fields and Their Cryptographic Significance. | Andrew M. Odlyzko |
| 1983 | CRYPTO | Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. | Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko |
| 1983 | FOCS | Solving Low-Density Subset Sum Problems | J. C. Lagarias, Andrew M. Odlyzko |
| 1981 | FOCS | Irreducibility Testing and Factorization of Polynomials (Extended Abstract) | Leonard M. Adleman, Andrew M. Odlyzko |
| 1980 | FOCS | Exploring Binary Trees and Other Simple Trees | Philippe Flajolet, Andrew M. Odlyzko |
| 1979 | ICASSP | Coefficient inaccuracy in FIR filters. | Allen Gersho, B. Gopinath, Andrew M. Odlyzko |
| 1977 | FOCS | A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm | Leonidas J. Guibas, Andrew M. Odlyzko |