scientific article; zbMATH DE number 4041254
From MaRDI portal
Publication:3779735
asymptoticsaverage case analysis of algorithmscomplexitydata structuresDyck languagesgenerating functionspermutationsrandom walkssorting networks
Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Complexity of computation (including implicit computational complexity) (03D15) Software, source code, etc. for problems pertaining to combinatorics (05-04) Exact enumeration problems, generating functions (05A15) Sums of independent random variables; random walks (60G50) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cited in
(48)- Limit laws for the Randić index of random binary tree models
- On-line sorting of twisted sequences in linear time
- A new semigroup technique in Poisson approximation
- A one-to-one correspondence between two classes of ordered trees
- Automatic average-case analysis of algorithms
- A path integral approach to data structure evolution
- A special case the of dynamization problem for least cost paths
- The asymptotic contour process of a binary tree is a Brownian excursion
- On the optimality of multivariate Poisson approximation
- The expected additive weight of trees
- An analysis of a class of algorithms for S-box construction
- The joint distribution of the three types of nodes in uniform binary trees
- Special issue: Average-case analysis of algorithms
- Distribution of distances in random binary search trees.
- One-sided variations on binary search trees
- Analytic methods in asymptotic enumeration
- The scientific works of Rainer Kemp (1949--2004)
- On the number of inversions in bimodal permutations
- scientific article; zbMATH DE number 4033058 (Why is no real title available?)
- Retracted: Strong limiting behavior in binary search trees
- On the height of random m‐ary search trees
- The limiting common distribution of two leaf heights in a random binary tree
- The Variance of Level Numbers in Certain Families of Trees
- Universal Limit Laws for Depths in Random Trees
- On random cartesian trees
- Connection reliabilities in stochastic acyclic networks
- Balanced ordered trees
- scientific article; zbMATH DE number 1008511 (Why is no real title available?)
- On the average minimal prefix-length of the generalized semi-Dycklanguage
- Uniformly growing backtrack trees
- scientific article; zbMATH DE number 4115969 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- Average-case analysis of some plurality algorithms
- On the average complexity of the membership problem for a generalized Dyck language
- DEGREE-BASED GINI INDEX FOR GRAPHS
- Limit theorems for record indicators in threshold \(F^\alpha \)-schemes
- Analytic analysis of algorithms
- Properties of complexity measures for PRAMs and WRAMs
- Generating alternating permutations lexicographically
- The multiplicity of left-to-right maxima in geometrically distributed words
- The stack-size of tries: A combinatorial study
- Left and right length of paths in binary trees or on a question of Knuth
- Mellin transforms and asymptotics: Harmonic sums
- Average-case analysis of unification algorithms
- Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees
- The left-right-imbalance of binary search trees
- Average-case analysis of the double description method and the beneath-beyond algorithm
- A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters
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 Q3779735)
