scientific article; zbMATH DE number 3755865
From MaRDI portal
Publication:3939231
Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Linear operators on function spaces (general) (47B38) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)
Cited in
(33)- Complexity and asymptotically optimal algorithms for modeling of absolutely continuous distributions
- A probabilistic method for lattice path enumeration
- Random walks, Gaussian processes and list structures
- A unified treatment of a class of combinatorial sums
- On some classes of inverse series relations and their applications
- A calculus for the random generation of labelled combinatorial structures
- Random walks, heat equation and distributed algorithms
- Binomial identities -- combinatorial and algorithmic aspects
- Probabilistic analysis of some (un)directed animals
- Presorting algorithms: an average-case point of view
- Applications of random sampling in computational geometry. II
- The order of points on the second convex hull of a simple polygon
- The combinatorics of overlapping genes
- Compressed data structures: Dictionaries and data-aware measures
- Some multifold reciprocal transformations with applications to series expansions
- Configurations of non-crossing rays and related problems
- Random Generation for Finitely Ambiguous Context-free Languages
- RANDOM GENERATION OF FINITELY GENERATED SUBGROUPS OF A FREE GROUP
- Exact and asymptotic distributions in digital and binary search trees
- Algebraic aspects of B-regular series
- Classical characteristics of the Bellman equation in constructions of grid optimal synthesis
- scientific article; zbMATH DE number 806502 (Why is no real title available?)
- A Probabilistic Analysis of a String Editing Problem and its Variations
- A note on a generalization of two well-known combinatorial identities via a hypergeometric series approach
- Analytic analysis of algorithms
- On proofs of generalized Knuth's old sum
- Multiple Quickselect -- Hoare's Find algorithm for several elements
- Random generation of words in an algebraic language in linear binary space
- Controlled non-uniform random generation of decomposable structures
- Pólya's urn scheme and a small world of combinatorial identities. An opportunity for inquiry-based learning
- Multifold analogues of Gould-Hsu inversions and their applications
- A short proof of Darboux's lemma
- Efficient sampling of RNA secondary structures from the Boltzmann ensemble of low-energy
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3939231)
