Special issue: Average-case analysis of algorithms
From MaRDI portal
The articles of this volume will be reviewed individually.
Recommendations
- Special issue on analysis of algorithms
- scientific article; zbMATH DE number 986985
- scientific article; zbMATH DE number 4041254
- Average-case analysis of algorithms. Dedicated to Philippe Flajolet on the occasion of his 50th birthday
- Special issue: Mathematical analysis of algorithms
- Average-case analysis of algorithms using Kolmogorov complexity
- Automatic average-case analysis of algorithms
- scientific article; zbMATH DE number 1440120
- Special issue on Mathematical analysis of algorithms. Dedicated to D. E. Knuth
- Special issue: Experimental algorithms
Cited in
(49)- On the variance of the number of occupied boxes
- On the average depth of asymmetric LC-tries
- Analysis of multiple quickselect variants.
- Asymptotic analysis of a storage allocation model with finite capacity: joint distribution
- Singularity analysis, Hadamard products, and tree recurrences
- A lower bound on compression of unknown alphabets
- Gap-free compositions and gap-free samples of geometric random variables
- Posterior agreement for large parameter-rich optimization problems
- The height of a binary search tree: the limiting distribution perspective.
- Some results on tries with adaptive branching.
- Statistical correlation of fractional oscillator response by complex spectral moments and state variable expansion
- An elegant algorithm for the construction of suffix arrays
- Dynamic interpolation search revisited
- Descents following maximal values in samples of geometric random variables
- A linear-time algorithm for computing the multinomial stochastic complexity
- Compound patterns and generating functions: from basic waiting times to counts of occurrence
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Languages with mismatches
- A station strategy to deter backoff attacks in IEEE 802.11 LANs
- Generalized approximate counting revisited
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- Monotone runs of uniformly distributed integer random variables: A probabilistic analysis
- Entrance times of random walks: with applications to pension fund modeling
- The longest common substring problem
- Large deviation properties for patterns
- Record statistics in a random composition
- scientific article; zbMATH DE number 1742155 (Why is no real title available?)
- Dictionary-symbolwise flexible parsing
- Some asymptotic results for the transient distribution of the Halfin-Whitt diffusion process
- Average-case analysis of some plurality algorithms
- Asymmetric Rényi problem
- The largest missing value in a composition of an integer
- Gaussian distribution of trie depth for strongly tame sources
- Towards a realistic analysis of some popular sorting algorithms
- Testing convexity of figures under the uniform distribution
- The expected profile of digital search trees
- Quasi-random words and limits of word sequences
- Node profiles of symmetric digital search trees: Concentration properties
- The enumeration of prudent polygons by area and its unusual asymptotics
- A unified treatment of families of partition functions
- On average sequence complexity
- Renewal theory in the analysis of tries and strings
- Moments of distributions related to digital expansions
- From Nerode's congruence to suffix automata with mismatches
- The number of distinct values in a geometrically distributed sample
- Finding biclusters by random projections
- On descents after maximal values in samples of discrete random variables
- On the entropy of a hidden Markov process
- Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy
This page was built for publication: Special issue: Average-case analysis of algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840498)
