Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Andrew M. Odlyzko
2010 – today
- 2013
[i2]Andrew M. Odlyzko: Open Access, library and publisher competition, and the evolution of general commerce. CoRR abs/1302.1105 (2013)- 2012
- [j59]
- [j58]Ghaith A. Hiary, Andrew M. Odlyzko: The zeta function on the critical line: Numerical evidence for moments and random matrix theory models. Math. Comput. 81(279) (2012)
- 2011
- [c35]
- 2010
- [j57]Andrew M. Odlyzko: Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by J. Christopher Westland. Electronic Commerce Research and Applications 9(1): 26-28 (2010)
- [j56]Andrew M. Odlyzko: Bubbles, gullibility, and other challenges for economics, psychology, sociology, and information sciences. First Monday 15(9) (2010)
- [j55]Deborah Estrin, K. Mani Chandy, R. 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: Internet Predictions. IEEE Internet Computing 14(1): 12-42 (2010)
- [c34]Zhi-Li Zhang, Papak Nabipay, Andrew M. Odlyzko, Roch Guérin: Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model. INFOCOM 2010: 46-50
- [c33]
2000 – 2009
- 2008
- [c32]
- 2007
- [c31]
- [c30]Andrew M. Odlyzko: Digital rights management: desirable, inevitable, and almost irrelevant. Digital Rights Management Workshop 2007: 39-40
- 2006
- [j54]Jean-Sébastien Coron, David Naccache, Yvo Desmedt, Andrew M. Odlyzko, Julien P. Stern: Index Calculation Attacks on RSA Signature and Encryption. Des. Codes Cryptography 38(1): 41-53 (2006)
- 2004
- [p1]Andrew M. Odlyzko: Privacy, Economics, and Price Discrimination on the Internet. Economics of Information Security 2004: 187-211
- 2003
- [j53]
- [c29]
- [c28]Andrew M. Odlyzko: The Unsolvable Privacy Problem and Its Implications for Security Technologies. ACISP 2003: 51-54
- [c27]Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot: Does Anyone Really Need MicroPayments? Financial Cryptography 2003: 69-76
- [c26]
- [c25]Andrew M. Odlyzko: Economics, Psychology, and Sociology of Security. Financial Cryptography 2003: 182-189
- 2001
- [j52]Andrew M. Odlyzko: Internet pricing and the history of communications. Computer Networks 36(5/6): 493-517 (2001)
- [j51]
- 2000
- [j50]Andrew M. Odlyzko: Discrete Logarithms: The Past and the Future. Des. Codes Cryptography 19(2/3): 129-145 (2000)
- [j49]Peter C. Fishburn, Andrew M. Odlyzko: Dynamic behavior of differential pricing and quality of service options for the internet. Decision Support Systems 28(1-2): 123-136 (2000)
- [j48]Andrew M. Odlyzko: The Internet and other networks: utilization rates and their implications. Information Economics and Policy 12(4): 341-365 (2000)
- [j47]Andrew M. Odlyzko: An improved bound for the de Bruijn-Newman constant. Numerical Algorithms 25(1-4): 293-303 (2000)
- [c24]
- [c23]
1990 – 1999
- 1999
- [j46]Arnold Knopfmacher, Andrew M. Odlyzko, Boris Pittel, L. Bruce Richmond, Dudley Stark, George Szekeres, Nicholas C. Wormald: The Asymptotic Number of Set Partitions with Unequal Block Sizes. Electr. J. Comb. 6 (1999)
- [j45]Andrew M. Odlyzko: The Visible Problems of the Invisible Computer: A Skeptical Look at Information Appliances. First Monday 4(9) (1999)
- [c22]Andrew M. Odlyzko: Paris metro pricing for the internet. ACM Conference on Electronic Commerce 1999: 140-147
- [i1]Andrew M. Odlyzko: Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals. CoRR cs.DL/9901009 (1999)
- 1998
- [j44]Kerry Coffman, Andrew M. Odlyzko: The Size and Growth Rate of the Internet. First Monday 3(10) (1998)
- [j43]Henri Gilbert, Dipankar Gupta, Andrew M. Odlyzko, Jean-Jacques Quisquater: Attacks on Shamir's `RSA for Paranoids'. Inf. Process. Lett. 68(4): 197-199 (1998)
- [j42]Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp: An Optimal Acceptance Policy for an Urn Scheme. SIAM J. Discrete Math. 11(2): 183-195 (1998)
- 1997
- [j41]Andrew M. Odlyzko, James B. Shearer, Ryan C. Siders: Monotonic subsequences in dimensions higher than one. Electr. J. Comb. 4(2) (1997)
- [j40]Peter C. Fishburn, Andrew M. Odlyzko, Ryan C. Siders: Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars. First Monday 2(7) (1997)
- [j39]
- [j38]Andrew M. Odlyzko: Silicon Dreams and Silicon Bricks: The Continuing Evolution of Libraries. Library Trends 46(1) (1997)
- [c21]
- [c20]Stanislaw Jarecki, Andrew M. Odlyzko: An Efficient Micropayment System Based on Probabilistic Polling. Financial Cryptography 1997: 173-192
- 1996
- [j37]Andrew M. Odlyzko: Analytic methods in asymptotic enumeration. Discrete Mathematics 153(1-3): 229-238 (1996)
- [j36]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko: Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. Fundam. Inform. 28(3-4): 297-301 (1996)
- [c19]Andrew M. Odlyzko: Computer Algebra and its Applications: Where are we Going? GI Jahrestagung 1996: 33-41
- [c18]
- 1995
- [j35]Andrew M. Odlyzko, W. D. Smith: Nonabelian sets with distinct k-sums. Discrete Mathematics 146(1-3): 169-177 (1995)
- [j34]Andrew M. Odlyzko: Tragic loss or good riddance? The impending demise of traditional scholarly journals. Int. J. Hum.-Comput. Stud. 42(1): 71-122 (1995)
- [j33]Andrew M. Odlyzko: Search for the Maximum of a Random Walk. Random Struct. Algorithms 6(2/3): 275-296 (1995)
- 1994
- [j32]Andrew M. Odlyzko: Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholary Journals. J. UCS 0(0): 3-53 (1994)
- [j31]Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang: Minimal-distance routing for KYKLOS II. Networks 24(2): 103-108 (1994)
- [j30]Albert G. Greenberg, Andrew M. Odlyzko, Jennifer Rexford, David Espinosa: Fast Parallel Solution of Fixed Point Equations for the Performance Evaluation of Circuit-Switched Networks. Perform. Eval. 20(1-3): 67-81 (1994)
- [c17]
- 1993
- [j29]Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond: The Distribution of Heights of Binary Trees and Other Simple Trees. Combinatorics, Probability & Computing 2: 145-156 (1993)
- 1992
- [j28]Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern: Improved Low-Density Subset Sum Algorithms. Computational Complexity 2: 111-128 (1992)
- [c16]Yvo Desmedt, Peter Landrock, Arjen K. Lenstra, Kevin S. McCurley, Andrew M. Odlyzko, Rainer A. Rueppel, Miles E. Smid: The Eurocrypt '92 Controversial Issue: Trapdoor Primes and Moduli (Panel). EUROCRYPT 1992: 194-199
- [c15]Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko: Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. ISSAC 1992: 117-122
- 1991
- [j27]Brian A. LaMacchia, Andrew M. Odlyzko: Computation of Discrete Logarithms in Prime Fields. Des. Codes Cryptography 1(1): 47-62 (1991)
- [c14]Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko: An Iproved Low-Denisty Subset Sum Algorithm. EUROCRYPT 1991: 54-67
- 1990
- [j26]Jerrold R. Griggs, Phil Hanlon, Andrew M. Odlyzko, Michael S. Waterman: On the number of alignments of k sequences. Graphs and Combinatorics 6(2): 133-146 (1990)
- [j25]Philippe Flajolet, Andrew M. Odlyzko: Singularity Analysis of Generating Functions. SIAM J. Discrete Math. 3(2): 216-240 (1990)
- [c13]Brian A. LaMacchia, Andrew M. Odlyzko: Solving Large Sparse Linear Systems over Finite Fields. CRYPTO 1990: 109-133
- [c12]Brian A. LaMacchia, Andrew M. Odlyzko: Computation of Discrete Logarithms in Prime Fields (Extended Abstract). CRYPTO 1990: 616-618
1980 – 1989
- 1989
- [c11]
- 1988
- [j24]Andrew M. Odlyzko: On subspaces spanned by random selections of plus/minus 1 vectors. J. Comb. Theory, Ser. A 47(1): 124-133 (1988)
- [j23]Noga Alon, E. E. Bergmann, Don Coppersmith, Andrew M. Odlyzko: Balancing sets of vectors. IEEE Transactions on Information Theory 34(1): 128-130 (1988)
- [j22]Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko: Simple, Efficient Asynchronous Parallel Algorithms for Maximization. ACM Trans. Program. Lang. Syst. 10(2): 313-337 (1988)
- 1987
- [j21]Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer: Ramsey-Sperner theory. Discrete Mathematics 63(2-3): 143-152 (1987)
- [j20]J. C. Lagarias, Andrew M. Odlyzko: Computing pi(x): An Analytic Method. J. Algorithms 8(2): 173-191 (1987)
- [j19]Andrew M. Odlyzko, Herbert S. Wilf: Bandwidths and profiles of trees. J. Comb. Theory, Ser. B 42(3): 348-370 (1987)
- [c10]Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang: Minimal-Distance Routing for Kykios II. ICPP 1987: 546-549
- [e1]Andrew M. Odlyzko (Ed.): Advances in Cryptology - CRYPTO '86, Santa Barbara, California, USA, 1986, Proceedings. Lecture Notes in Computer Science 263, Springer 1987
- 1986
- [j18]Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel: Discrete Logarithms in GF(p). Algorithmica 1(1): 1-15 (1986)
- [j17]J. C. Lagarias, Andrew M. Odlyzko, Don Zagier: On the Capacity of Disjointly Shared Networks. Computer Networks 10: 275-285 (1986)
- [j16]Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer: k-Color Sperner theorems. J. Comb. Theory, Ser. A 42(1): 31-54 (1986)
- [j15]Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay: Constant Time Generation of Free Trees. SIAM J. Comput. 15(2): 540-548 (1986)
- [j14]Khaled A. S. Abdel-Ghaffar, Robert J. McEliece, Andrew M. Odlyzko, Henk C. A. van Tilborg: On the existence of optimum cyclic burst-correcting codes. IEEE Transactions on Information Theory 32(6): 768-775 (1986)
- 1985
- [j13]Andrew M. Odlyzko, Janos Pintz, Kenneth B. Stolarsky: Partitions of planar sets into small triangles. Discrete Mathematics 57(1-2): 89-97 (1985)
- [j12]J. C. Lagarias, Andrew M. Odlyzko: Solving Low-Density Subset Sum Problems. J. ACM 32(1): 229-246 (1985)
- [j11]Andrew M. Odlyzko, L. Bruce Richmond: On the Number of Distinct Block Sizes in Partitions of a Set. J. Comb. Theory, Ser. A 38(2): 170-181 (1985)
- [c9]Yvo Desmedt, Andrew M. Odlyzko: A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. CRYPTO 1985: 516-522
- [c8]Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko: Simple, Efficient Asynchronous Parallel Algorithms for Maximization. PODC 1985: 300-308
- 1984
- [j10]Andrew M. Odlyzko: Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme. IEEE Transactions on Information Theory 30(4): 594-600 (1984)
- [c7]Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret: Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. EUROCRYPT 1984: 142-149
- [c6]Andrew M. Odlyzko: Discrete Logarithms in Finite Fields and Their Cryptographic Significance. EUROCRYPT 1984: 224-314
- 1983
- [j9]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer: On the Density of Sequences of Integers the Sum of No Two of Which Is a Square II. General Sequences. J. Comb. Theory, Ser. A 34(2): 123-139 (1983)
- [c5]Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko: Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. CRYPTO 1983: 39-42
- [c4]
- 1982
- [j8]Philippe Flajolet, Andrew M. Odlyzko: The Average Height of Binary Trees and Other Simple Trees. J. Comput. Syst. Sci. 25(2): 171-213 (1982)
- [j7]J. C. Lagarias, Andrew M. Odlyzko, James B. Shearer: On the Density of Sequences of Integers the Sum of No Two of which Is a Square. I. Arithmetic Progressions. J. Comb. Theory, Ser. A 33(2): 167-185 (1982)
- 1981
- [j6]Leonidas J. Guibas, Andrew M. Odlyzko: Periods in Strings. J. Comb. Theory, Ser. A 30(1): 19-42 (1981)
- [j5]Leonidas J. Guibas, Andrew M. Odlyzko: String Overlaps, Pattern Matching, and Nontransitive Games. J. Comb. Theory, Ser. A 30(2): 183-208 (1981)
- [c3]Leonard M. Adleman, Andrew M. Odlyzko: Irreducibility Testing and Factorization of Polynomials (Extended Abstract). FOCS 1981: 409-418
- 1980
- [j4]Leonidas J. Guibas, Andrew M. Odlyzko: A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. SIAM J. Comput. 9(4): 672-682 (1980)
- [c2]Philippe Flajolet, Andrew M. Odlyzko: Exploring Binary Trees and Other Simple Trees. FOCS 1980: 207-216
1970 – 1979
- 1979
- [j3]Andrew M. Odlyzko, N. J. A. Sloane: New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions. J. Comb. Theory, Ser. A 26(2): 210-214 (1979)
- 1978
- [j2]F. J. MacWilliams, Andrew M. Odlyzko, N. J. A. Sloane, Harold N. Ward: Self-Dual Codes over GF(4). J. Comb. Theory, Ser. A 25(3): 288-318 (1978)
- 1977
- [j1]F. J. MacWilliams, Andrew M. Odlyzko: Pelikán's Conjecture Cyclotomic Cosets. J. Comb. Theory, Ser. A 22(1): 110-114 (1977)
- [c1]Leonidas J. Guibas, Andrew M. Odlyzko: A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. FOCS 1977: 189-195
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-22 20:49 CEST by the dblp team