| Document Date: 2006-02-20 09:42:43
Open Document File Size: 497,77 KBShare Result on Facebook
City Marseille / / Company GT / / IndustryTerm multidimensional search / digital search trees / search costs / definite solution / search trees / search depth decreases / leader election protocol / probabilistic algorithms / grid-file algorithms / search tries / worst-case search cost / abstract structure underlying several algorithms / distributed computing / stack protocol / communication protocols / tree protocol / trie algorithms / compression algorithms / ternary search tries / data compression algorithms / dynamical systems / quantitative data mining / / Organization GH / / Person PHILIPPE FLAJOLET / De Bruijn / / Position author / general data models / great analyst / uniform model / / PublishedMedium Lecture Notes in Computer Science / / Technology trie algorithms / grid-file algorithms / leader election protocol / data compression algorithms / resulting algorithm / analysing trie algorithms / Quicksort algorithm / corresponding algorithms / resulting sorting algorithm / compression algorithms / tree protocol / CTM protocol / data mining / Paging / stack protocol / communication protocols / /
SocialTag |
Invited lecture, STACS06, Marseille, FebruaryProceedings in Lecture Notes in Computer Science. THE UBIQUITOUS DIGITAL TREE PHILIPPE FLAJOLET