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