On the variance of a class of inductive valuations of data structures for digital search
From MaRDI portal
Publication:672993
DOI10.1016/0304-3975(94)00306-4zbMATH Open0874.68077OpenAlexW1966082969MaRDI QIDQ672993FDOQ672993
Authors: Werner Schachinger 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(94)00306-4
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Complexity of Finite Sequences
- Title not available (Why is that?)
- Digital Search Trees Revisited
- Exact and asymptotic distributions in digital and binary search trees
- Partial match retrieval of multidimensional data
- On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel
- Partial-Match Retrieval Algorithms
- File structures using hashing functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- Dynamic hashing
- On The variance of the extremal path length in a symmetric digital trie
- On the balance property of Patricia tries: External path length viewpoint
- On some applications of formulae of Ramanujan in the analysis of algorithms
- MULTIDIMENSIONAL DIGITAL SEARCHING AND SOME NEW PARAMETERS IN TRIES
- Multidimensional digital searching—alternative data structures
- Trie size in a dynamic list structure
- New results on the size of tries
- The average CRI-length of a tree collision resolution algorithm in presence of multiplicity-dependent capture effects
Cited In (9)
- A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
- On 2-protected nodes in random digital trees
- Title not available (Why is that?)
- Dependence between path-length and size in random digital trees
- An analytic approach to the asymptotic variance of trie statistics and related structures
- On the variety of shapes in digital trees
- The Wiener index of random digital trees
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- Asymptotic normality for the size of graph tries built from M-ary tree labelings
Uses Software
This page was built for publication: On the variance of a class of inductive valuations of data structures for digital search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672993)
