scientific article
From MaRDI portal
Publication:2715788
zbMath0968.68205MaRDI QIDQ2715788
Publication date: 28 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (64)
Central limit theorems for additive functionals and fringe trees in tries ⋮ A universal online caching algorithm based on pattern matching ⋮ Distances in random digital search trees ⋮ The intersite distances between pattern occurrences in strings generated by general discrete- and continuous-time models: an algorithmic approach ⋮ Rounding of continuous random variables and oscillatory asymptotics ⋮ Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process ⋮ Unicyclic strong permutations ⋮ Successions in words and compositions ⋮ Statistical Inference for Rényi Entropy Functionals ⋮ Asymptotic normality for -dependent and constrained -statistics, with applications to pattern matching in random strings and permutations ⋮ On a general \(q\)-identity ⋮ On the variety of shapes in digital trees ⋮ Generalized Lyapunov exponents and aspects of the theory of deep learning ⋮ Parking functions: from combinatorics to probability ⋮ Return-time -spectrum for equilibrium states with potentials of summable variation ⋮ Number of survivors in the presence of a demon ⋮ An Analysis of the Height of Tries with Random Weights on the Edges ⋮ Asymptotic expectation of protected node profile in random digital search trees ⋮ Asymptotic expansions relating to the distribution of the length of longest increasing subsequences ⋮ Profiles of PATRICIA tries ⋮ Joint string complexity for Markov sources: small data matters ⋮ On the nonsymmetric longer queue model: joint distribution, asymptotic properties, and heavy traffic limits ⋮ Scaled Penalization of Brownian Motion with Drift and the Brownian Ascent ⋮ On the Joint Path Length Distribution in Random Binary Trees ⋮ Process convergence for the complexity of radix selection on Markov sources ⋮ Švarc–Milnor quasi-isometries for Fuchsian groups ⋮ Average-Case Analysis of Cousins in m-ary Tries ⋮ Management and analysis of DNA microarray data by using weighted trees ⋮ A general limit theorem for recursive algorithms and combinatorial structures ⋮ The \(q\)-Catalan numbers: a saddle point approach ⋮ Weighted height of random trees ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ Analysis of randomized protocols for conflict-free distributed access ⋮ Almost Optimal Distribution-Free Sample-Based Testing of k-Modality ⋮ New results for molecular formation under pairwise potential minimization ⋮ Integral representations and summations of the modified Struve function ⋮ The total path length of split trees ⋮ Quantum double suspension and spectral triples ⋮ Clustgrams: an extension to histogram densities based on the minimum description length principle ⋮ Statistical properties of factor oracles ⋮ Compression based homogeneity testing ⋮ On integral representation of Bessel function of the first kind ⋮ Some families of Mathieu \(\mathbf a\)-series and alternating Mathieu \(\mathbf a\)-series ⋮ The oscillatory distribution of distances in random tries ⋮ Bias of a nonparametric entropy estimator for Markov measures ⋮ Random databases with approximate record matching ⋮ A probabilistic analysis of some tree algorithms ⋮ ON CLIMBING TRIES ⋮ Testing randomness via aperiodic words ⋮ Profile of Tries ⋮ Multiple choice tries and distributed hash tables ⋮ On the shape of the fringe of various types of random trees ⋮ Statistical Properties of Factor Oracles ⋮ Dichotomic Selection on Words: A Probabilistic Analysis ⋮ Imbalance in random digital trees ⋮ Conflict-resolving tree algorithm stable to incomplete interference damping ⋮ Average complexity of Moore's and Hopcroft's algorithms ⋮ Limit distribution of distances in biased random tries ⋮ Spectral gap of the Erlang A model in the Halfin-Whitt regime ⋮ Unnamed Item ⋮ Digital search trees and chaos game representation ⋮ The Wiener Index of Random Digital Trees ⋮ Limit theorems for patterns in phylogenetic trees ⋮ New convolutions associated with the Mellin transform and their applications in integral equations
This page was built for publication:
