Pages that link to "Item:Q672989"

The following pages link to Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989):

Displaying 12 items.

• The expected profile of digital search trees (Q549244) (← links)
• On the variance of a class of inductive valuations of data structures for digital search (Q672993) (← links)
• Analytical depoissonization and its applications (Q1129001) (← links)
• On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
• A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
• On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach (Q1575544) (← links)
• On optimal parsing for LZ78-like compressors (Q1698700) (← links)
• An analytic approach to the asymptotic variance of trie statistics and related structures (Q2437771) (← links)
• D?E?K=(1000)8 (Q2772918) (← links)
• Size and path length of Patricia tries: Dynamical sources context (Q2772922) (← links)
• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme (Q3122915) (← links)
• A Central Limit Theorem for Non-Overlapping Return Times (Q5488986) (← links)