Andrew Odlyzko: Papers on Combinatorial Enumeration and Asymptotics

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

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

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

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

• Analytic methods in asymptotic enumeration, A. M. Odlyzko, Discrete Math. 153 (1996), pp. 229-238. [PDF]

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

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

• Explicit Tauberian estimates for functions with positive coefficients, A. M. Odlyzko, J. Computational Appl. Math., 41 (1992), pp. 187-197. [PDF] [comments]

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

• Functional iteration and the Josephus problem, A. M. Odlyzko and H. S. Wilf, Glasgow Math. J., 33 (1991), pp. 235-240. [PDF]

• Lattice points in high-dimensional spheres, J. E. Mazo and A. M. Odlyzko, Monatsh. Math., 110 (1990), pp. 47-61. [online journal version]

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

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

• The editor's corner: n coins in a fountain, A. M. Odlyzko and H. S. Wilf, Amer. Math. Monthly, 95 (1988), pp. 840-843.

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

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

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

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

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

• On the unimodality of high convolutions of discrete distributions, A. M. Odlyzko and L. B. Richmond, Ann. Prob., 13 (1985), pp. 299-306. [PDF]

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

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

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

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

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

• Periodic oscillations of coefficients of power series that satisfy functional equations, A. M. Odlyzko, Advances in Math., 44 (1982), pp. 180-205. [online journal version]

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

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

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

• Maximal prefix-synchronized codes, L. J. Guibas and A. M. Odlyzko, SIAM J. Appl. Math., 35 (1978), pp. 401-418.