scientific article

DOI<103::AID-RSA5>3.0.CO;2-Z 10.1002/(SICI)1098-2418(199701/03)10:1/2<103::AID-RSA5>3.0.CO;2-ZzbMath0869.39010MaRDI QIDQ3122908

Michael Drmota

Publication date: 10 June 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

generating functions functional equations asymptotic expansions context-free languages tree enumeration implcit

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Formal languages and automata (68Q45) Enumeration in graph theory (05C30) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Multidimensional problems (41A63) Functional inequalities, including subadditivity, convexity, etc. (39B62) Implicit function theorems, Jacobians, transformations with several variables (26B10) Series expansions (e.g., Taylor, Lidstone series, but not Fourier series) (41A58) Functional equations for complex functions (39B32)

Related Items

Performance analysis of a \(GI-Geo-1\) buffer with a preemptive resume priority scheduling discipline, Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers, Analysis of steady-state and transient delay in discrete-time single-arrival and batch-arrival systems, Priority queueing systems: from probability generating functions to tail probabilities, Scaling limits of permutation classes with a finite specification: a dichotomy, A modified HOL priority scheduling discipline: performance analysis, On the number of matchings of a tree, The vectorial kernel method for walks with longer steps, Non-redundant random generation algorithms for weighted context-free grammars, The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree, Fast Algorithms for Discrete Differential Equations, Rare event asymptotics for a random walk in the quarter plane, Simplifications of Uniform Expressions Specified by Systems, Structure and enumeration of \(K_4\)-minor-free links and link-diagrams, Asymptotic enumeration and limit laws for graphs of fixed genus, Formulae and Asymptotics for Coefficients of Algebraic Functions, Many 2-level polytopes from matroids, Performance analysis of a single-server ATM queue with a priority scheduling., Combinatorics of locally optimal RNA secondary structures, Asymptotic number of hairpins of saturated RNA secondary structures, Growth-sensitivity of context-free languages., Asymptotic distribution of motifs in a stochastic context-free grammar model of RNA folding, Spanning forests in regular planar maps, Analysis of a discrete-time preemptive resume priority buffer, Degree distribution in random planar graphs, The asymptotic value of the Randić index for trees, Controlled non-uniform random generation of decomposable structures, Complexity and Limiting Ratio of Boolean Functions over Implication, Counting, Generating, Analyzing and Sampling Tree Alignments, Unnamed Item, Structure and enumeration of \(K_{4}\)-minor-free links and link diagrams, On \(q\)-functional equations and excursion moments, Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs, Recursion and growth estimates in renormalizable quantum field theory, Transversal structures on triangulations: A combinatorial study and straight-line drawings, Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models, On Two Subclasses of Motzkin Paths and Their Relation to Ternary Trees, Limit Distributions and Scaling Functions, Minor-obstructions for apex sub-unicyclic graphs, Statistical properties of lambda terms, Analytic combinatorics of non-crossing configurations, On the limiting distribution of the metric dimension for random forests, Spanning trees in random series-parallel graphs, Analysis of an efficient reduction algorithm for random regular expressions based on universality detection, Growth and ergodicity of context-free languages

Cites Work