Pages that link to "Item:Q1840498"
From MaRDI portal
The following pages link to Special issue: Average-case analysis of algorithms (Q1840498):
Displayed 46 items.
- Entrance times of random walks: with applications to pension fund modeling (Q282259) (← links)
- Large deviation properties for patterns (Q396708) (← links)
- Record statistics in a random composition (Q412369) (← links)
- Dictionary-symbolwise flexible parsing (Q450551) (← links)
- The largest missing value in a composition of an integer (Q533783) (← links)
- The expected profile of digital search trees (Q549244) (← links)
- The enumeration of prudent polygons by area and its unusual asymptotics (Q640842) (← links)
- On average sequence complexity (Q703547) (← links)
- Renewal theory in the analysis of tries and strings (Q764315) (← links)
- Moments of distributions related to digital expansions (Q819673) (← links)
- From Nerode's congruence to suffix automata with mismatches (Q840766) (← links)
- The number of distinct values in a geometrically distributed sample (Q852697) (← links)
- Finding biclusters by random projections (Q859851) (← links)
- On descents after maximal values in samples of discrete random variables (Q894598) (← links)
- On the entropy of a hidden Markov process (Q932317) (← links)
- Statistical inference for the \(\epsilon \)-entropy and the quadratic Rényi entropy (Q990884) (← links)
- On the variance of the number of occupied boxes (Q1031734) (← links)
- On the average depth of asymmetric LC-tries (Q1044716) (← links)
- Analysis of multiple quickselect variants. (Q1401319) (← links)
- Asymptotic analysis of a storage allocation model with finite capacity: joint distribution (Q1748479) (← links)
- Singularity analysis, Hadamard products, and tree recurrences (Q1765441) (← links)
- A lower bound on compression of unknown alphabets (Q1770393) (← links)
- Gap-free compositions and gap-free samples of geometric random variables (Q1781973) (← links)
- Posterior agreement for large parameter-rich optimization problems (Q1786589) (← links)
- The height of a binary search tree: the limiting distribution perspective. (Q1853551) (← links)
- Some results on tries with adaptive branching. (Q1853567) (← links)
- Statistical correlation of fractional oscillator response by complex spectral moments and state variable expansion (Q2200234) (← links)
- An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
- Dynamic interpolation search revisited (Q2288214) (← links)
- Descents following maximal values in samples of geometric random variables (Q2343660) (← links)
- A linear-time algorithm for computing the multinomial stochastic complexity (Q2379977) (← links)
- Compound patterns and generating functions: from basic waiting times to counts of occurrence (Q2431573) (← links)
- An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
- Languages with mismatches (Q2456367) (← links)
- A station strategy to deter backoff attacks in IEEE 802.11 LANs (Q2466009) (← links)
- Generalized approximate counting revisited (Q2474230) (← links)
- On gaps and unoccupied urns in sequences of geometrically distributed random variables (Q2477379) (← links)
- Monotone runs of uniformly distributed integer random variables: A probabilistic analysis (Q2581352) (← links)
- The longest common substring problem (Q2971067) (← links)
- Some asymptotic results for the transient distribution of the Halfin–Whitt diffusion process (Q4594537) (← links)
- Asymmetric Rényi Problem (Q5219326) (← links)
- Gaussian Distribution of Trie Depth for Strongly Tame Sources (Q5364227) (← links)
- Towards a Realistic Analysis of Some Popular Sorting Algorithms (Q5364228) (← links)
- Testing convexity of figures under the uniform distribution (Q5381051) (← links)
- Quasi-random words and limits of word sequences (Q5918087) (← links)
- Node profiles of symmetric digital search trees: Concentration properties (Q6049998) (← links)