A. M. Odlyzko  Home/Search
Context Related
Links: ACM | belllabs.com/netl...mptotic.enum.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: belllabs.com/netlib/a...complete (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper: (Update)
Cited by: More
Fixed-Parameter Algorithms for Closest String - And Related Problems (Correct)
Model Checking Dynamic Allocation and Deallocation - Distefano, Rensink, Katoen (2002) (Correct)
Two-stage allocations and the double Q-function - Agievich (2003) (Correct)
Active bibliography (related documents): More All
2.6: Some New Methods and Results in Tree Enumeration - Odlyzko (1984) (Correct)
2.4: Automatic Average-Case Analysis Of Algorithms - Flajolet, al. (1991) (Correct)
2.4: Analytic Analysis of Algorithms - Flajolet (1992) (Correct)
Similar documents based on text: More All
0.1: Asymptotic Estimates of Elementary Probability Distributions - Hwang (Correct)
0.1: An Improved Low-Density Subset Sum Algorithm - Coster, LaMacchia, Odlyzko.. (1991) (Correct)
0.1: Improved Low-Density Subset Sum Algorithms - Coster, Joux, LaMacchia.. (1991) (Correct)
Related documents from co-citation: More All
21: Singularity Analysis of Generating Functions (context) - Flajolet, Odlyzko - 1990
20: The art of computer programming (context) - Knuth - 1973
15: Central and local limit theorems applied to asymptotic enumeration (context) - Bender - 1973
BibTeX entry: (Update)
A. Odlyzko, Asymptotic Enumeration Methods, in Handbook of Combinatorics, vol. 2 (R. L. Graham, M. Groetschel, and L. Lovasz, eds.) (1996), Elsevier. http://citeseer.ist.psu.edu/article/odlyzko96asymptotic.html More
@incollection{ odlyzko95asymptotic,
author = "A. M. Odlyzko",
title = "Asymptotic Enumeration Methods",
booktitle = "Handbook of Combinatorics",
volume = "2",
publisher = "North-Holland",
address = "Amsterdam",
editor = "R[onald] L[ewis] Graham and M[artin] Gr{\"o}tschel and L[ászló] Lovász",
isbn = "0-444-82351-4",
pages = "1063--1229",
year = "1995",
url = "citeseer.ist.psu.edu/article/odlyzko96asymptotic.html" }
Citations (may not include all citations):957 The Probabilistic Method (context) - Alon, Spencer - 1992 ACM DBLP
466 Probability and Measure (context) - Billingsley - 1979
442 Concrete Mathematics (context) - Graham, Knuth et al. - 1989 ACM
283 Random Graphs (context) - Bollobas - 1985 ACM
176 An Introduction to Chaotic Dynamical Systems (context) - Devaney - 1989
166 Series and Products (context) - Gradshteyn, Ryzhik et al. - 1965
161 A Course of Modern Analysis (context) - Whittaker, Watson - 1927
160 Exactly Solved Models in Statistical Mechanics (context) - Baxter - 1982
157 Advanced Combinatorics (context) - Comtet - 1974
154 Combinatorial Enumeration (context) - Goulden, Jackson - 1983 ACM
154 Orthogonal Polynomials (context) - Szego - 1959
151 Singularity analysis of generating function (context) - Flajolet, Odlyzko - 1990
139 Ten Lectures on the Probabilistic Method (context) - Spencer - 1987
130 Evolution of Random Search Trees (context) - Mahmoud - 1992
124 The Art of Computer Programming Vol (context) - Knuth - 1981
124 The Art of Computer Programming Vol (context) - Knuth - 1973
124 The Art of Computer Programming Vol (context) - Knuth - 1973
121 Handbook of Algorithms and Data Structures (context) - Gonnet, Baeza-Yates - 1991
116 Graphical Enumeration (context) - Harary, Palmer - 1973
114 The Theory of Partitions (context) - Andrews - 1976
104 Introduction to Analytic Number Theory (context) - Apostol - 1976
101 Central and local limit theorems applied to asymptotic enume.. (context) - Bender, Richmond - 1983
101 Central and local limit theorems applied to asymptotic enume.. (context) - Bender, Richmond et al. - 1983
101 Central and local limit theorem applied to asymptotic enumer.. (context) - Bender - 1973
98 Asymptotics and Special Functions (context) - Olver - 1974
85 Mathematics for the Analysis of Algorithms (context) - Greene, Knuth - 1982 ACM
80 Introduction to Combinatorial Analysis (context) - Riordan - 1958
79 The Theory of Branching Processes (context) - Harris - 1963
76 Probability approximations via the Poisson clumping heuristi.. - Aldous - 1989
69 An algorithmic proof theory for hypergeometric (context) - Wilf, Zeilberger - 1992
66 the altitude of nodes in random trees (context) - Meir, Moon - 1978
65 Mathematical Analysis (context) - Apostol - 1957 ACM
65 Combinatorial Identities (context) - Riordan - 1968
64 Decision procedure for indefinite hypergeometric summation (context) - Gosper - 1978
61 Asymptotic Methods in Analysis (context) - de Bruijn - 1958
61 Oxford University Press (context) - Titchmarsh, of et al. - 1939
61 Combinatorial aspects of continued fractions (context) - Flajolet - 1980
59 Lectures on Functional Equations and Their Applications (context) - Aczel - 1966
58 Random Allocations (context) - Kolchin, Sevast'yanov et al. - 1978
58 Percolation Theory for Mathematicians (context) - Kesten - 1982
57 Probabilistic Methods in Combinatorics - Erdos, Spencer - 1974
56 Asymptotic Approximations of Integrals (context) - Wong - 1989 ACM
55 Asymptotic Expansions of Integrals (context) - Bleistein, Handelsman - 1975 ACM
48 Asymptotic methods in enumeration (context) - Bender - 1974
47 Symmetric functions and P -recursiveness (context) - Gessel - 1990
46 A variational problem for random Young tableaux (context) - Logan, Shepp - 1977
44 A Handbook of Integer Sequences (context) - Sloane - 1973
42 Die Lehre von den Kettenbruchen (context) - Perron
42 Random mapping statistics - Flajolet, Odlyzko - 1990 ACM DBLP
40 Probabilistic recurrence relations (context) - Karp - 1991 ACM DBLP
39 Automatic average--case analysis of algorithms - Flajolet, Salvy et al. - 1991
38 Asymptotics of the Plancherel measure of the symmetric group.. (context) - Vershik, Kerov - 1977
37 Polylogarithms and Associated Functions (context) - Lewin - 1981
35 Analytic variations on quadtrees - Flajolet, Gonnet et al. DBLP
35 The average height of binary trees and other simple trees (context) - Flajolet, Odlyzko - 1982 DBLP
35 Handbuch der Laplace Transformation (context) - Doetsch - 1955
34 Ordered cycle lengths in a random permutation (context) - Shepp, Lloyd - 1966
34 and nontransitive games (context) - Guibas, Odlyzko et al. - 1981
33 Digital search trees revisited (context) - Flajolet, Sedgewick - 1986 ACM DBLP
33 Asymptotic enumeration by degree sequence of graphs of high .. (context) - McKay, Wormald - 1990 ACM
31 Saddlepoint approximations in statistics (context) - Daniels - 1954
31 Asymptotic values for degrees associated with strips of Youn.. (context) - Regev - 1981
31 laws in logic and combinatorics (context) - Compton - 1988
30 Cambridge Univ (context) - Hardy, Littlewood et al. - 1952
29 A Table of Series and Products (context) - Hansen - 1975
29 Probabilistic Analysis of Algorithms (context) - Hofri - 1987
28 Total Positivity (context) - Karlin - 1968
28 Combinatorial Enumeration of Groups (context) - Polya, Read - 1987
27 Continued Fractions: Analytic Theory and Applications (context) - Jones, Thron - 1980
27 Gaussian limiting distributions for the number of components.. (context) - Flajolet, Soria - 1990 ACM
27 Rational functions certify combinatorial identities - Wilf, Zeilberger - 1990
26 Computers and Mathematics with Applications (context) - Louchard, excursion et al. - 1984
26 Wadsworth and Brooks/Cole (context) - Stanley, Combinatorics - 1986
25 Oxford University Press (context) - Barbour, Holst et al. - 1992
25 The distribution of the number of summands in the partitions.. (context) - Erdos, Lehner - 1941
24 Mellin transforms and asymptotics: digital sums - Flajolet, Grabner et al. DBLP
23 Branching processes in the analysis of the heights of trees (context) - Devroye - 1987 ACM DBLP
23 The Problem of Moments (context) - Shohat, Tamarkin - 1943
23 Exact and asymptotic distributions in digital and binary sea.. (context) - Louchard - 1987
22 Central and local limit theorems applied to asymptotic enume.. (context) - Gao, Richmond - 1992
21 Oxford University Press (context) - Hardy, Series - 1949
21 Analytic Inequalities (context) - Mitrinovic - 1970
21 Combinatorial Identities (context) - Gould - 1972
20 Trie partitioning process: limiting distributions (context) - Jacquet, Regnier - 1986 ACM DBLP
20 regular sequences (context) - Allouche, Shallit et al. - 1992
20 Log-concave and unimodal sequences in algebra (context) - Stanley - 1989
20 Probability distributions related to random mappings (context) - Harris - 1960
20 A recurrence related to trees (context) - Knuth, Pittel - 1989
19 Analysis of the space of search trees under the random inser.. (context) - Mahmoud, Pittel - 1989 ACM DBLP
19 Maximal prefix--synchronized codes (context) - Guibas, Odlyzko - 1978
19 Two parallel queues created by arrivals with two demands (context) - Flatto, Hahn - 1984
19 The average height of planted plane trees (context) - de Bruijn, Knuth et al. - 1972
19 Applications of basic hypergeometric functions (context) - Andrews - 1974
19 A logical approach to asymptotic combinatorics (context) - Compton - 1989
19 A logical approach to asymptotic combinatorics (context) - Compton - 1987
18 The number of trees (context) - Otter - 1948
18 Generating Functions (context) - Stanley - 1978
18 Poisson approximation and the Chen-Stein method (context) - Arratia, Goldstein et al. - 1990
18 Fundamentals of the Average Case Analysis of Particular Algo.. (context) - Kemp - 1984 ACM
17 Computation with Recurrence Relations (context) - Wimp - 1984
17 Finite Power Series (context) - Lipshitz - 1989
16 The Uses of Integral Transforms (context) - Sneddon - 1972
16 the length of the longest monotone subsequence in a random p.. - Frieze - 1991
16 Random mappings with constraints on coalescence and number o.. (context) - Arney, Bender - 1982
16 Stirling behavior is asymptotically normal (context) - Harper - 1967
15 Asymptotic distributions and a multivariate Darboux method i.. (context) - Drmota ACM
15 Poisson approximation for dependent trials (context) - Chen - 1975
14 Finite exchangeable sequences (context) - Diaconis, Freedman - 1980
14 Lattice points in high--dimensional spheres - Mazo, Odlyzko - 1990
14 an asymptotic method in enumeration (context) - Meir, Moon - 1989
14 Resurrecting the asymptotics of linear recurrences (context) - Wimp, Zeilberger - 1985
13 Optimization Software Inc (context) - Kolchin, Mappings - 1986
13 A generalization of Stirling's formula (context) - Hayman - 1956
13 Mathematical methods in the analysis of algorithms and data .. (context) - Flajolet - 1988
13 Search costs in quadtrees and singularity perturbation asymp.. - Flajolet, La DBLP
13 On Mahler's partition problem (context) - de Bruijn - 1948
13 Long repetitive patterns in random sequences (context) - Guibas, Odlyzko - 1980
12 The structure of random partitions of large integers (context) - Fristedt - 1993
12 Functional Equations in a Single Variable (context) - Kuczma - 1968
12 The analysis of multidimensional searching in quad-trees (context) - Flajolet, Gonnet et al. - 1991 ACM DBLP
12 Enumerative uses of generating functions (context) - Bender, Goldman - 1971
11 The expected linearity of a simple equivalence algorithm (context) - Knuth, Schonhage - 1978 DBLP
11 On some applications of formulae of Ramanujan in the analysi.. (context) - Kirschenhofer, Prodinger - 1991
11 Asymptotic estimates of Stirling numbers (context) - Temme - 1993
11 Independent process approximations for random combinatorial .. (context) - Arratia, Tavare - 1993
11 the height of trees (context) - Renyi, Szekeres - 1967
11 Combinatorial Chance (context) - David, Barton - 1962
11 Integral Transforms and Their Applications (context) - Davies - 1978
10 Order statistics for decomposable combinatorial structures (context) - Hansen DBLP
10 Some techniques for solving recurrences (context) - Lueker - 1980 ACM DBLP
10 Integral Representation and the Computation of Combinatorial.. (context) - Egorychev - 1984
10 Asymptotic Expansions (context) - Erdelyi - 1956
10 Asymptotic distribution of the number and size of parts in u.. (context) - Szekeres - 1987
10 An Introduction to the Theory of Infinite Series (context) - I'a - 1955
10 The Hardy-Littlewood Method (context) - Vaughan - 1981
10 Bessel functions and a divergent series (context) - Flajolet, Schott et al. - 1990
9 Data movement in odd--even merging (context) - Sedgewick - 1978
9 Asymptotic bounds for the number of convex n-ominoes (context) - Klarner, Rivest - 1974
9 the number of certain lattice polygons (context) - Polya - 1969
9 Normal limiting distribution of the size of tries (context) - Jacquet, Regnier - 1988 ACM DBLP
9 in symmetric groups (context) - Moser, Wyman et al. - 1955
9 Explicit Tauberian estimates for functions with positive coe.. - Odlyzko - 1992
9 finite power series is D--finite (context) - Lipshitz, of et al. - 1988
9 The moments of partitions (context) - Richmond - 1975
8 Asymptotische Aussagen uber Partitionen (context) - Meinardus - 1954
8 erential Equations in the Complex Domain (context) - Hille, Di - 1976
8 A Bernoulli excursion and its various applications (context) - Takacs - 1991
8 Some asymptotic formulae in the theory of partitions (context) - Roth, Szekeres - 1954
8 Some asymptotic formulae in the theory of partitions (context) - Szekeres - 1953
8 Wadsworth and Brooks/Cole (context) - Durrett, Theory - 1991
8 Graphs on unlabelled nodes with a given number of edges (context) - Wright - 1971
8 Constant time generation of free trees (context) - Wright, Richmond et al. - 1986
8 An Introduction to the Analytic Theory of Numbers (context) - Ayoub - 1963
7 a special functional equation (context) - Mahler - 1940
7 Analytic Functions (context) - Evgrafov - 1966
7 Upper bounds for modular form (context) - Mallows, Odlyzko et al. - 1975
7 Remarks on an asymptotic method in combinatorics (context) - Canfield - 1984
7 Some uses of the Mellin integral transform in the analysis o.. (context) - Flajolet, Regnier et al. - 1985
7 Recurrence relations based on minimization (context) - Fredman, Knuth - 1974
7 A central limit theorem on GL n (context) - Goh, Schmutz
7 Enumeration of strings - Odlyzko - 1985
7 Asymptotic development of the Stirling numbers of the first .. (context) - Moser, Wyman - 1958
7 Brownian motion and algorithm complexity (context) - Louchard - 1986 ACM DBLP
7 Tauberian theorems concerning power series and Dirichlet's s.. (context) - Hardy, Littlewood - 1914
6 The solution of van der Waerden's problem for permanents (context) - Egorychev - 1981
6 Power and exponential sums of digital sums related to binomi.. (context) - Stolarsky - 1977
6 A Tauberian theorem for partitions (context) - Ingham - 1941
6 Counting labeled trees (context) - Moon - 1970
6 The Erdos-Renyi law in distribution for coin tossing and seq.. (context) - Arratia, Gordon et al. - 1990
6 Foundations of Applied Combinatorics (context) - Bender, Williamson - 1991
6 Asymptotic enumeration of Latin rectangles (context) - Godsil, McKay - 1990 ACM
6 The asymptotic number of irreducible partitions (context) - Bender, Odlyzko et al. - 1985
6 Twenty--step algorithm for determining the asymptotic number.. (context) - Harary, Robinson et al. - 1975
6 On random binary trees (context) - Brown, Shubert - 1984
6 Normal limiting distribution for the size and the external p.. (context) - Jacquet, Regnier
5 Une nouvelle demonstration combinatoire des formules d'inver.. (context) - Labelle - 1981
5 Integral Representations and Residues in Multidimensional Co.. (context) - Aizenberg, Yuzhakov - 1983
5 Some doubly exponential sequences (context) - Aho, Sloane - 1973
5 manuscript in preparation (context) - Knopfmacher, Odlyzko et al.
5 Techniques of Asymptotic Analysis (context) - Sirovich - 1971
5 Probabilistic Methods in Combinatorial Analysis (context) - Sachkov - 1978
5 manuscript in preparation (context) - Odlyzko, Poonen et al.
5 Stirling numbers of the second kind (context) - Moser, Wyman - 1958
5 The diagonals of a double power series (context) - Hautus, Klarner - 1971
5 Bonferroni inequalities (context) - Galambos - 1977
5 Asymptotic relations between enumerative functions in graph .. (context) - Wright - 1970
5 A relationship between two sequences (context) - Wright - 1967
5 Asymptotic formulae in the theory of partitions (context) - Haselgrove, Temperley - 1954
5 The expected order of a random permutation (context) - Goh, Schmutz
5 The Calculus of Finite Di#erences (context) - Milne-Thomson - 1933
5 Distribution of labelled trees by diameter (context) - Szekeres - 1982
5 The cycle structure of random permutations (context) - Arratia, Tavare - 1992
4 the unimodality of high convolutions of discrete distributio.. - Odlyzko, Richmond - 1985
4 A note on the expected height of binary search trees (context) - Devroye - 1986
4 Institut de Recherche en Informatique et en Automatique (context) - Flajolet, de manipulation - 1978
4 and the number of elements of each order in S n (context) - Wilf, of - 1986
4 Tauberian theory and its applications (context) - Postnikov - 1980
4 the capacity of disjointly shared networks (context) - Lagarias, Odlyzko et al. - 1985
4 and Polya Frequency Sequences in Combinatorics (context) - Brenti, Log-concave - 1989
4 Notes on plane partitions (context) - Gordon, Houten - 1969
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://netlib.bell-labs.com/netlib/att/math/people/amo/doc/complete.html): More
Connectedness, Classes, and Cycle Index - Bender, Cameron, Odlyzko, Richmond (Correct)
Short Proofs for Nondivisibility of Sparse Polynomials.. - Grigoriev, Karpinski.. (1996) (Correct)
Lattice Points in High-Dimensional Spheres - Mazo, Odlyzko (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC