scientific article
From MaRDI portal
Publication:3939231
zbMath0481.68042MaRDI QIDQ3939231
Daniel H. Greene, Donald E. Knuth
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Exact enumeration problems, generating functions (05A15) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Recurrences (11B37) Linear operators on function spaces (general) (47B38) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Complexity and asymptotically optimal algorithms for modeling of absolutely continuous distributions, A probabilistic method for lattice path enumeration, A calculus for the random generation of labelled combinatorial structures, Configurations of non-crossing rays and related problems, Random walks, heat equation and distributed algorithms, Binomial identities -- combinatorial and algorithmic aspects, The order of points on the second convex hull of a simple polygon, Probabilistic analysis of some (un)directed animals, Random walks, Gaussian processes and list structures, Some multifold reciprocal transformations with applications to series expansions, A Probabilistic Analysis of a String Editing Problem and its Variations, RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP, Exact and asymptotic distributions in digital and binary search trees, Multifold analogues of Gould-Hsu inversions and their applications, A short proof of Darboux's lemma, A unified treatment of a class of combinatorial sums, Algebraic aspects of B-regular series, Classical characteristics of the Bellman equation in constructions of grid optimal synthesis, Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy, Multiple Quickselect -- Hoare's Find algorithm for several elements, Compressed data structures: Dictionaries and data-aware measures, Random generation of words in an algebraic language in linear binary space, A note on a generalization of two well-known Cominatorial identities via a Hypergeometric series approach, The combinatorics of overlapping genes, Controlled non-uniform random generation of decomposable structures, Analytic analysis of algorithms, Unnamed Item, Applications of random sampling in computational geometry. II, Presorting algorithms: an average-case point of view, On some classes of inverse series relations and their applications, Random Generation for Finitely Ambiguous Context-free Languages
