Special issue: Average-case analysis of algorithms
From MaRDI portal
Publication:1840498
DOI10.1007/BF02679610zbMath0969.00028OpenAlexW4241273426MaRDI QIDQ1840498
No author found.
Publication date: 9 September 2001
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02679610
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items
Moments of distributions related to digital expansions ⋮ Entrance times of random walks: with applications to pension fund modeling ⋮ From Nerode's congruence to suffix automata with mismatches ⋮ A linear-time algorithm for computing the multinomial stochastic complexity ⋮ The number of distinct values in a geometrically distributed sample ⋮ Finding biclusters by random projections ⋮ Large deviation properties for patterns ⋮ Node profiles of symmetric digital search trees: Concentration properties ⋮ On descents after maximal values in samples of discrete random variables ⋮ Some asymptotic results for the transient distribution of the Halfin–Whitt diffusion process ⋮ Record statistics in a random composition ⋮ Analysis of multiple quickselect variants. ⋮ Statistical correlation of fractional oscillator response by complex spectral moments and state variable expansion ⋮ Compound patterns and generating functions: from basic waiting times to counts of occurrence ⋮ Gaussian Distribution of Trie Depth for Strongly Tame Sources ⋮ Towards a Realistic Analysis of Some Popular Sorting Algorithms ⋮ The longest common substring problem ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ The enumeration of prudent polygons by area and its unusual asymptotics ⋮ Dictionary-symbolwise flexible parsing ⋮ Testing convexity of figures under the uniform distribution ⋮ On the entropy of a hidden Markov process ⋮ Languages with mismatches ⋮ A station strategy to deter backoff attacks in IEEE 802.11 LANs ⋮ Asymptotic analysis of a storage allocation model with finite capacity: joint distribution ⋮ Generalized approximate counting revisited ⋮ An elegant algorithm for the construction of suffix arrays ⋮ On gaps and unoccupied urns in sequences of geometrically distributed random variables ⋮ The largest missing value in a composition of an integer ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ The expected profile of digital search trees ⋮ On average sequence complexity ⋮ A lower bound on compression of unknown alphabets ⋮ Gap-free compositions and gap-free samples of geometric random variables ⋮ Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy ⋮ Posterior agreement for large parameter-rich optimization problems ⋮ Dynamic interpolation search revisited ⋮ Quasi-random words and limits of word sequences ⋮ Asymmetric Rényi Problem ⋮ Renewal theory in the analysis of tries and strings ⋮ On the variance of the number of occupied boxes ⋮ On the average depth of asymmetric LC-tries ⋮ The height of a binary search tree: the limiting distribution perspective. ⋮ Some results on tries with adaptive branching. ⋮ Monotone runs of uniformly distributed integer random variables: A probabilistic analysis ⋮ Descents following maximal values in samples of geometric random variables
