scientific article; zbMATH DE number 53861
From MaRDI portal
Publication:4004056
Recommendations
- Randomized search trees
- An evolutionary approach for finding optimal trees in undirected networks
- Tree evolution processes for bucket increasing trees
- Rapidly-exploring random trees: Progress and prospects
- Computing and Combinatorics
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- scientific article; zbMATH DE number 1088267
Cited in
(only showing first 100 items - show all)- Limit laws for the Randić index of random binary tree models
- Imbalance in random digital trees
- Continued fraction algorithms, functional operators, and structure constants
- Analytical depoissonization and its applications
- Page usage in a quadtree index
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter
- Normality of tree-growing search strategies
- Asymptotic analysis of a class of functional equations and applications
- On the expected height of fringe-blanced trees
- On the distribution for the duration of a randomized leader election algorithm
- Second phase changes in random \(m\)-ary search trees and generalized quicksort: Convergence rates
- Emerging behavior as binary search trees are symmetrically updated.
- A general limit theorem for recursive algorithms and combinatorial structures
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- An evolutionary approach for finding optimal trees in undirected networks
- Profile of random exponential binary trees
- General Edgeworth expansions with applications to profiles of random trees
- Refined asymptotics for the composition of cyclic urns
- Singularity analysis, Hadamard products, and tree recurrences
- Mixed Poisson approximation of node depth distributions in random binary search trees
- Analytic urns
- On weighted depths in random binary search trees
- The number of winners in a discrete geometrically distributed sample
- The height of a binary search tree: the limiting distribution perspective.
- Extreme value statistics and traveling fronts: Various applications
- Distribution of distances in random binary search trees.
- The profile of binary search trees
- Limit laws for partial match queries in quadtrees
- Spanning tree size in random binary search trees.
- One-sided variations on binary search trees
- Paths in \(m\)-ary interval trees
- On the contraction method with degenerate limit equation.
- Analytic methods in asymptotic enumeration
- Large deviations for combinatorial distributions. I: Central limit theorems
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics
- The m-version of binary search trees: an average case analysis
- On joint properties of vertices with a given degree or label in the random recursive tree
- Central limit theorems for additive functionals and fringe trees in tries
- Solutions to complex smoothing equations
- Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees
- Reductions in binary search trees
- Average case analysis for tree labelling schemes
- Long and short paths in uniform random recursive dags
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Combinatiorial Markov chains
- Limit distributions for multitype branching processes of \(m\)-ary search trees
- Search trees: metric aspects and strong limit theorems
- Renewals for exponentially increasing lifetimes, with an application to digital search trees
- Random binary trees: from the average case analysis to the asymptotics of distributions
- A functional limit theorem for the profile of search trees
- A probabilistic analysis of some tree algorithms
- Probabilistic analysis of algorithms for the Dutch national flag problem
- Functional limit theorems for multitype branching processes and generalized Pólya urns.
- Continuous-time digital search tree and a border aggregation model
- Asymptotic expectation of protected node profile in random digital search trees
- On the stack-size of general tries
- D E K=(100)_8
- Size and path length of Patricia tries: Dynamical sources context
- Phase changes in random m-ary search trees and generalized quicksort
- On a multivariate contraction method for random recursive structures with applications to quicksort
- Multiway trees of maximum and minimum probability under the random permutation model
- Toward a formal derivation of the expected behavior of prefix B-trees
- Psi-series method for equality of random trees and quadratic convolution recurrences
- On rotations in fringe-balanced binary trees
- On the richness of the collection of subtrees in random binary search trees
- Stochastic analysis of the extra clustering model for animal grouping
- Stochastic analysis of tree–like data structures
- Ascents and descents in random trees
- Branching random walks on binary search trees: convergence of the occupation measure
- On finding a minimum spanning tree in a network with random weights
- The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees
- On the number of full levels in tries
- Simply generated trees, B-series and Wigner processes
- An Improved Bound for Random Binary Search Trees with Concurrent Insertions
- On the asymptotic behaviour of random recursive trees in random environments
- Probability, trees and algorithms. Abstracts from the workshop held November 2--8, 2014.
- An Analysis of the Height of Tries with Random Weights on the Edges
- On the variety of shapes on the fringe of a random recursive tree
- Searching Trees: An Essay
- Multiple choice tries and distributed hash tables
- A limit process for partial match queries in random quadtrees and 2-d trees
- Retracted: Strong limiting behavior in binary search trees
- Generalized Digital Trees and Their Difference—Differential Equations
- Universal Limit Laws for Depths in Random Trees
- scientific article; zbMATH DE number 1246231 (Why is no real title available?)
- On the internal path length ofd-dimensional quad trees
- A family of random trees with random edge lengths
- On random cartesian trees
- Greedy Search on the Binary Tree with Random Edge-Weights
- Random suffix search trees
- An almost sure result for path lengths in binary search trees
- m‐ary Search trees when m ≥ 27: A strong asymptotics for the space requirements
- One-sided variations on interval trees
- scientific article; zbMATH DE number 1545682 (Why is no real title available?)
- scientific article; zbMATH DE number 1545683 (Why is no real title available?)
- The climbing depth of random trees
- Dependence between path-length and size in random digital trees
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- The variance of a partial match retrieval in a multidimensional symmetric trie
- Hypergeometrics and the cost structure of quadtrees
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 Q4004056)
