Andrew Odlyzko: Papers on Probability

• 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]

• 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]

• 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]

• 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]

• 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]

• 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]

• 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]

• On subspaces spanned by random selections of +-1 vectors, A. M. Odlyzko, J. Combinatorial Theory A, 47 (1988), pp. 124-133. [PDF]

• 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]

• 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.

• Enumeration of strings, A. M. Odlyzko, pp. 205-228 in Combinatorial Algorithms on Words, A. Apostolico and Z. Galil (eds.), Springer, 1985. [PDF]

• Random shuffles and group representations, L. Flatto, A. M. Odlyzko, and D. B. Wales, Ann. Prob., 13 (1985), pp. 154-178. [PDF]

• 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.

• 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]

• Bounds for eigenvalues of certain stochastic matrices, H. J. Landau and A. M. Odlyzko, Linear Algebra Appl., 38 (1981), pp. 5-15.

• String overlaps, pattern matching, and nontransitive games, L. J. Guibas and A. M. Odlyzko, J. Comb. Theory A, 30 (1981), pp. 183-208.

• Long repetitive patterns in random sequences, L. J. Guibas and A. M. Odlyzko, Z. Wahrscheinlichkeitstheorie verw. Geb., 53 (1980), pp. 241-262.

• 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]

• 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]