The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Andrew M. Odlyzko: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Leonidas J. Guibas, Andrew M. Odlyzko
    A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm [Citation Graph (1, 0)][DBLP]
    FOCS, 1977, pp:189-195 [Conf]
  2. Don Coppersmith, Andrew M. Odlyzko, Richard Schroeppel
    Discrete Logarithms in GF(p). [Citation Graph (1, 0)][DBLP]
    Algorithmica, 1986, v:1, n:1, pp:1-15 [Journal]
  3. Philippe Flajolet, Andrew M. Odlyzko
    The Average Height of Binary Trees and Other Simple Trees. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:2, pp:171-213 [Journal]
  4. Andrew M. Odlyzko
    Privacy, economics, and price discrimination on the Internet. [Citation Graph (0, 0)][DBLP]
    ICEC, 2003, pp:355-366 [Conf]
  5. Andrew M. Odlyzko
    The Unsolvable Privacy Problem and Its Implications for Security Technologies. [Citation Graph (0, 0)][DBLP]
    ACISP, 2003, pp:51-54 [Conf]
  6. Yvo Desmedt, Andrew M. Odlyzko
    A Chosen Text Attack on the RSA Cryptosystem and Some Discrete Logarithm Schemes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:516-522 [Conf]
  7. Brian A. LaMacchia, Andrew M. Odlyzko
    Solving Large Sparse Linear Systems over Finite Fields. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:109-133 [Conf]
  8. Brian A. LaMacchia, Andrew M. Odlyzko
    Computation of Discrete Logarithms in Prime Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1990, pp:616-618 [Conf]
  9. Ernest F. Brickell, J. C. Lagarias, Andrew M. Odlyzko
    Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1983, pp:39-42 [Conf]
  10. Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko
    An Iproved Low-Denisty Subset Sum Algorithm. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:54-67 [Conf]
  11. 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). [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1992, pp:194-199 [Conf]
  12. Philippe Delsarte, Yvo Desmedt, Andrew M. Odlyzko, Philippe Piret
    Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1984, pp:142-149 [Conf]
  13. Philippe Flajolet, Andrew M. Odlyzko
    Random Mapping Statistics. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1989, pp:329-354 [Conf]
  14. Andrew M. Odlyzko
    Discrete Logarithms in Finite Fields and Their Cryptographic Significance. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1984, pp:224-314 [Conf]
  15. Stanislaw Jarecki, Andrew M. Odlyzko
    An Efficient Micropayment System Based on Probabilistic Polling. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 1997, pp:173-192 [Conf]
  16. Andrew M. Odlyzko
    The Case Against Micropayments. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2003, pp:77-83 [Conf]
  17. Andrew M. Odlyzko
    Economics, Psychology, and Sociology of Security. [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2003, pp:182-189 [Conf]
  18. Nicko van Someren, Andrew M. Odlyzko, Ronald L. Rivest, Tim Jones, Duncan Goldie-Scot
    Does Anyone Really Need MicroPayments? [Citation Graph (0, 0)][DBLP]
    Financial Cryptography, 2003, pp:69-76 [Conf]
  19. Leonard M. Adleman, Andrew M. Odlyzko
    Irreducibility Testing and Factorization of Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:409-418 [Conf]
  20. Philippe Flajolet, Andrew M. Odlyzko
    Exploring Binary Trees and Other Simple Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:207-216 [Conf]
  21. J. C. Lagarias, Andrew M. Odlyzko
    Solving Low-Density Subset Sum Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:1-10 [Conf]
  22. Andrew M. Odlyzko
    Computer Algebra and its Applications: Where are we Going? [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1996, pp:33-41 [Conf]
  23. Ding-Zhu Du, Frank K. Hwang, Andrew M. Odlyzko, Yanjun Zhang
    Minimal-Distance Routing for Kykios II. [Citation Graph (0, 0)][DBLP]
    ICPP, 1987, pp:546-549 [Conf]
  24. Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko
    Existence of Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann Hypothesis. [Citation Graph (0, 0)][DBLP]
    ISSAC, 1992, pp:117-122 [Conf]
  25. Andrew M. Odlyzko
    Integer Factorization and Discrete Logarithms (Abstract). [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:258- [Conf]
  26. Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko
    Simple, Efficient Asynchronous Parallel Algorithms for Maximization. [Citation Graph (0, 0)][DBLP]
    PODC, 1985, pp:300-308 [Conf]
  27. Andrew M. Odlyzko
    Keynote Talk: Internet Charging. [Citation Graph (0, 0)][DBLP]
    QofIS, 2000, pp:360- [Conf]
  28. Andrew M. Odlyzko
    Paris metro pricing for the internet. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 1999, pp:140-147 [Conf]
  29. Andrew M. Odlyzko
    Search for the maximum of a random walk. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:336-345 [Conf]
  30. Andrew M. Odlyzko
    The bumpy road of Electronic Commerce. [Citation Graph (0, 0)][DBLP]
    WebNet, 1996, pp:- [Conf]
  31. Matthijs J. Coster, Antoine Joux, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr, Jacques Stern
    Improved Low-Density Subset Sum Algorithms. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1992, v:2, n:, pp:111-128 [Journal]
  32. J. C. Lagarias, Andrew M. Odlyzko, Don Zagier
    On the Capacity of Disjointly Shared Networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 1986, v:10, n:, pp:275-285 [Journal]
  33. Andrew M. Odlyzko
    Internet pricing and the history of communications. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2001, v:36, n:5/6, pp:493-517 [Journal]
  34. Arnold Knopfmacher, Andrew M. Odlyzko, Boris Pittel, L. Bruce Richmond, Dudley Stark, G. Szekeres, Nicholas C. Wormald
    The Asymptotic Number of Set Partitions with Unequal Block Sizes. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  35. Andrew M. Odlyzko, James B. Shearer, Ryan C. Siders
    Monotonic subsequences in dimensions higher than one. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  36. Andrew M. Odlyzko
    Competition and cooperation: Libraries and publishers in the transition to electronic scholarly journals [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  37. Philippe Flajolet, Zhicheng Gao, Andrew M. Odlyzko, L. Bruce Richmond
    The Distribution of Heights of Binary Trees and Other Simple Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:145-156 [Journal]
  38. Jean-Sébastien Coron, David Naccache, Yvo Desmedt, Andrew M. Odlyzko, Julien P. Stern
    Index Calculation Attacks on RSA Signature and Encryption. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:1, pp:41-53 [Journal]
  39. Brian A. LaMacchia, Andrew M. Odlyzko
    Computation of Discrete Logarithms in Prime Fields. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1991, v:1, n:1, pp:47-62 [Journal]
  40. Andrew M. Odlyzko
    Discrete Logarithms: The Past and the Future. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:19, n:2/3, pp:129-145 [Journal]
  41. Kerry Coffman, Andrew M. Odlyzko
    The Size and Growth Rate of the Internet. [Citation Graph (0, 0)][DBLP]
    First Monday, 1998, v:3, n:10, pp:- [Journal]
  42. Peter C. Fishburn, Andrew M. Odlyzko, Ryan C. Siders
    Fixed fee versus unit pricing for information goods: competition, equilibria, and price wars. [Citation Graph (0, 0)][DBLP]
    First Monday, 1997, v:2, n:7, pp:- [Journal]
  43. Andrew M. Odlyzko
    Content is Not King. [Citation Graph (0, 0)][DBLP]
    First Monday, 2001, v:6, n:2, pp:- [Journal]
  44. Andrew M. Odlyzko
    The many paradoxes of broadband. [Citation Graph (0, 0)][DBLP]
    First Monday, 2003, v:8, n:9, pp:- [Journal]
  45. Andrew M. Odlyzko
    The Economics of Electronic Journals. [Citation Graph (0, 0)][DBLP]
    First Monday, 1997, v:2, n:8, pp:- [Journal]
  46. Andrew M. Odlyzko
    The Visible Problems of the Invisible Computer: A Skeptical Look at Information Appliances. [Citation Graph (0, 0)][DBLP]
    First Monday, 1999, v:4, n:9, pp:- [Journal]
  47. Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko
    Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1996, v:28, n:3-4, pp:297-301 [Journal]
  48. Andrew M. Odlyzko
    The Internet and other networks: utilization rates and their implications. [Citation Graph (0, 0)][DBLP]
    Information Economics and Policy, 2000, v:12, n:4, pp:341-365 [Journal]
  49. Andrew M. Odlyzko
    Tragic loss or good riddance? The impending demise of traditional scholarly journals. [Citation Graph (0, 0)][DBLP]
    Int. J. Hum.-Comput. Stud., 1995, v:42, n:1, pp:71-122 [Journal]
  50. Henri Gilbert, Dipankar Gupta, Andrew M. Odlyzko, Jean-Jacques Quisquater
    Attacks on Shamir's `RSA for Paranoids'. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:4, pp:197-199 [Journal]
  51. J. C. Lagarias, Andrew M. Odlyzko
    Solving Low-Density Subset Sum Problems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:1, pp:229-246 [Journal]
  52. J. C. Lagarias, Andrew M. Odlyzko
    Computing pi(x): An Analytic Method. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1987, v:8, n:2, pp:173-191 [Journal]
  53. Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer
    k-Color Sperner theorems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:42, n:1, pp:31-54 [Journal]
  54. Leonidas J. Guibas, Andrew M. Odlyzko
    Periods in Strings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:30, n:1, pp:19-42 [Journal]
  55. Leonidas J. Guibas, Andrew M. Odlyzko
    String Overlaps, Pattern Matching, and Nontransitive Games. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:30, n:2, pp:183-208 [Journal]
  56. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:33, n:2, pp:167-185 [Journal]
  57. 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. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1983, v:34, n:2, pp:123-139 [Journal]
  58. F. J. MacWilliams, Andrew M. Odlyzko
    Pelikán's Conjecture Cyclotomic Cosets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1977, v:22, n:1, pp:110-114 [Journal]
  59. F. J. MacWilliams, Andrew M. Odlyzko, N. J. A. Sloane, Harold N. Ward
    Self-Dual Codes over GF(4). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:3, pp:288-318 [Journal]
  60. Andrew M. Odlyzko
    On subspaces spanned by random selections of plus/minus 1 vectors. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1988, v:47, n:1, pp:124-133 [Journal]
  61. Andrew M. Odlyzko, L. Bruce Richmond
    On the Number of Distinct Block Sizes in Partitions of a Set. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:170-181 [Journal]
  62. Andrew M. Odlyzko, N. J. A. Sloane
    New Bounds on the Number of Unit Spheres That Can Touch a Unit Sphere in n Dimensions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1979, v:26, n:2, pp:210-214 [Journal]
  63. Andrew M. Odlyzko, Herbert S. Wilf
    Bandwidths and profiles of trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:348-370 [Journal]
  64. Andrew M. Odlyzko
    Tragic Loss or Good Riddance? The Impending Demise of Traditional Scholary Journals. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1994, v:0, n:0, pp:3-53 [Journal]
  65. Andrew M. Odlyzko
    Silicon Dreams and Silicon Bricks: The Continuing Evolution of Libraries. [Citation Graph (0, 0)][DBLP]
    Library Trends, 1997, v:46, n:1, pp:- [Journal]
  66. 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. [Citation Graph (0, 0)][DBLP]
    Perform. Eval., 1994, v:20, n:1-3, pp:67-81 [Journal]
  67. Andrew M. Odlyzko
    Search for the Maximum of a Random Walk. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:275-296 [Journal]
  68. Leonidas J. Guibas, Andrew M. Odlyzko
    A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:672-682 [Journal]
  69. Robert Alan Wright, L. Bruce Richmond, Andrew M. Odlyzko, Brendan D. McKay
    Constant Time Generation of Free Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:2, pp:540-548 [Journal]
  70. Robert W. Chen, Alan Zame, Andrew M. Odlyzko, Larry A. Shepp
    An Optimal Acceptance Policy for an Urn Scheme. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:2, pp:183-195 [Journal]
  71. Philippe Flajolet, Andrew M. Odlyzko
    Singularity Analysis of Generating Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:2, pp:216-240 [Journal]
  72. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:6, pp:768-775 [Journal]
  73. Noga Alon, E. E. Bergmann, Don Coppersmith, Andrew M. Odlyzko
    Balancing sets of vectors. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:128-0 [Journal]
  74. Andrew M. Odlyzko
    Cryptanalytic attacks on the multiplicative knapsack cryptosystem and on Shamir's fast signature scheme. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:594-600 [Journal]
  75. Albert G. Greenberg, Boris D. Lubachevsky, Andrew M. Odlyzko
    Simple, Efficient Asynchronous Parallel Algorithms for Maximization. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1988, v:10, n:2, pp:313-337 [Journal]
  76. Andrew M. Odlyzko
    Privacy and the clandestine evolution of e-commerce. [Citation Graph (0, 0)][DBLP]
    ICEC, 2007, pp:3-6 [Conf]
  77. Andrew M. Odlyzko, Janos Pintz, Kenneth B. Stolarsky
    Partitions of planar sets into small triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:57, n:1-2, pp:89-97 [Journal]
  78. Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer
    Ramsey-Sperner theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:2-3, pp:143-152 [Journal]
  79. Andrew M. Odlyzko, W. D. Smith
    Nonabelian sets with distinct k-sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:169-177 [Journal]
  80. Andrew M. Odlyzko
    Analytic methods in asymptotic enumeration. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:153, n:1-3, pp:229-238 [Journal]
  81. Peter C. Fishburn, Andrew M. Odlyzko
    Dynamic behavior of differential pricing and quality of service options for the internet. [Citation Graph (0, 0)][DBLP]
    Decision Support Systems, 2000, v:28, n:1-2, pp:123-136 [Journal]

  82. Digital rights management: desirable, inevitable, and almost irrelevant. [Citation Graph (, )][DBLP]


  83. Interactions, Competition and Innovation in a Service-Oriented Internet: An Economic Model. [Citation Graph (, )][DBLP]


  84. Economics and technology in the evolution of networks. [Citation Graph (, )][DBLP]


  85. Providing security with insecure systems. [Citation Graph (, )][DBLP]


  86. The slow evolution of electronic publishing. [Citation Graph (, )][DBLP]


  87. Social networks and mathematical models: A research commentary on "Critical Mass and Willingness to Pay for Social Networks" by J. Christopher Westland. [Citation Graph (, )][DBLP]


Search in 0.107secs, Finished in 0.112secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002