Werner Schachinger Concentration of Size and Path Length of Tries. [Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:763-793 [Journal]
Werner Schachinger Asymptotic normality of recursive algorithms via martingale difference arrays. [Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:363-398 [Journal]
Werner Schachinger Limiting distributions for the costs of partial match retrievals in multidimensional tries. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2000, v:17, n:3-4, pp:428-459 [Journal]
Werner Schachinger The Variance of Partial Match Retrieval in a Multidimensional Symmetric Trie. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1995, v:7, n:1, pp:81-96 [Journal]
Werner Schachinger Distributional Results for Costs of Partial Match Queries in Asymmetric K-Dimensional Tries. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:4, pp:952-983 [Journal]
Werner Schachinger On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:144, n:1&2, pp:251-275 [Journal]
Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP