scientific article
From MaRDI portal
Publication:3779735
zbMath0638.68026MaRDI QIDQ3779735
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
permutationscomplexitygenerating functionsasymptoticsrandom walksdata structuressorting networksaverage case analysis of algorithmsDyck languages
Analysis of algorithms and problem complexity (68Q25) Sums of independent random variables; random walks (60G50) Exact enumeration problems, generating functions (05A15) Complexity of computation (including implicit computational complexity) (03D15) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items
Distribution of distances in random binary search trees. ⋮ The multiplicity of left-to-right maxima in geometrically distributed words ⋮ An analysis of a class of algorithms for \(S\)-box construction ⋮ One-sided variations on binary search trees ⋮ The scientific works of Rainer Kemp (1949--2004) ⋮ On the height of random m‐ary search trees ⋮ The joint distribution of the three types of nodes in uniform binary trees ⋮ On the average complexity of the membership problem for a generalized Dyck language ⋮ The limiting common distribution of two leaf heights in a random binary tree ⋮ On-line sorting of twisted sequences in linear time ⋮ On random cartesian trees ⋮ Connection reliabilities in stochastic acyclic networks ⋮ Balanced ordered trees ⋮ The left-right-imbalance of binary search trees ⋮ Analytic methods in asymptotic enumeration ⋮ A new semigroup technique in Poisson approximation ⋮ A one-to-one correspondence between two classes of ordered trees ⋮ The Variance of Level Numbers in Certain Families of Trees ⋮ Retracted: Strong limiting behavior in binary search trees ⋮ DEGREE-BASED GINI INDEX FOR GRAPHS ⋮ On the average minimal prefix-length of the generalized semi-Dycklanguage ⋮ Limit Theorems for Record Indicators in Threshold $F^\alpha$-Schemes ⋮ Left and right length of paths in binary trees or on a question of Knuth ⋮ A path integral approach to data structure evolution ⋮ Uniformly growing backtrack trees ⋮ A special case the of dynamization problem for least cost paths ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ The asymptotic contour process of a binary tree is a Brownian excursion ⋮ A simulated annealing strategy for the detection of arbitrarily shaped spatial clusters ⋮ On the optimality of multivariate Poisson approximation ⋮ Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees ⋮ Properties of complexity measures for PRAMs and WRAMs ⋮ Generating alternating permutations lexicographically ⋮ The stack-size of tries: A combinatorial study ⋮ Analytic analysis of algorithms ⋮ The expected additive weight of trees ⋮ Limit laws for the Randić index of random binary tree models ⋮ Universal Limit Laws for Depths in Random Trees ⋮ On the number of inversions in bimodal permutations
