The following pages link to Wojciech Szpankowski (Q205208):
Displaying 50 items.
- (Q224245) (redirect page) (← links)
- On a recurrence arising in graph compression (Q456337) (← links)
- The expected profile of digital search trees (Q549244) (← links)
- Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989) (← links)
- A note on binomial recurrences arising in the analysis of algorithms (Q685508) (← links)
- On average sequence complexity (Q703547) (← links)
- On symmetry of uniform and preferential attachment graphs (Q740670) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Finding biclusters by random projections (Q859851) (← links)
- On the height of digital trees and related problems (Q922689) (← links)
- On the entropy of a hidden Markov process (Q932317) (← links)
- An analysis of a contention resolution algorithm. Another approach (Q1091813) (← links)
- The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028) (← links)
- The presence of exponentiality in entropy maximized M/GI/1 queues (Q1120462) (← links)
- On the balance property of Patricia tries: External path length viewpoint (Q1124339) (← links)
- Analytical depoissonization and its applications (Q1129001) (← links)
- A characterization of digital search trees from the successful search viewpoint (Q1183573) (← links)
- Stability of token passing rings (Q1193782) (← links)
- Probabilistic modeling of data structures on words. A reply to Professor Andersson's letter (Q1202935) (← links)
- On The variance of the extremal path length in a symmetric digital trie (Q1262137) (← links)
- Yet another application of a binomial recurrence. Order statistics (Q1262639) (← links)
- On asymptotics of certain recurrences arising in universal coding (Q1276783) (← links)
- Philippe Flajolet's research in analysis of algorithms and combinatorics (Q1277370) (← links)
- On pattern frequency occurrences in a Markovian sequence (Q1277388) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- On pattern occurrences in a random text (Q1351627) (← links)
- On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
- (Q1378507) (redirect page) (← links)
- Analysis of an asymmetric leader election algorithm (Q1378508) (← links)
- Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458) (← links)
- A note on the asymptotic behavior of the heights in \(b\)-trees for \(b\) large (Q1578478) (← links)
- Profiles of PATRICIA tries (Q1702132) (← links)
- Posterior agreement for large parameter-rich optimization problems (Q1786589) (← links)
- The height of a binary search tree: the limiting distribution perspective. (Q1853551) (← links)
- A scheduling policy with maximal stability region for ring networks with spatial reuse (Q1892646) (← links)
- Hidden words statistics for large patterns (Q2030762) (← links)
- Degree distribution for duplication-divergence graphs: large deviations (Q2110621) (← links)
- Sequential universal modeling for non-binary sequences with constrained distributions (Q2155950) (← links)
- Compression of dynamic graphs generated by a duplication model (Q2196614) (← links)
- Joint string complexity for Markov sources: small data matters (Q2205940) (← links)
- Towards degree distribution of a duplication-divergence graph model (Q2223471) (← links)
- The concentration of the maximum degree in the duplication-divergence models (Q2695307) (← links)
- Asymptotic average redundancy of Huffman (and other) block codes (Q2705977) (← links)
- (Q2715788) (← links)
- (Q2789544) (← links)
- (Q2789565) (← links)
- A functional equation often arising in the analysis of algorithms (extended abstract) (Q2817674) (← links)
- (Q2834331) (← links)
- (Q2920840) (← links)
- (Q2920863) (← links)
