69 search results - page 11 / 14 » Merkle Tree Traversal in Log Space and Time |
CF
2009
ACM
14 years 2 months ago
2009
ACM
As multithreaded server applications and runtime systems prevail, garbage collection is becoming an essential feature to support high performance systems. The fundamental issue of...
CPM
1999
Springer
14 years 4 days ago
1999
Springer
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
IPL
2010
13 years 6 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
ICNP
2007
IEEE
14 years 2 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...