Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic required for disseminating membership changes information (events). These eve...
Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R....
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
We study the hardware cost of implementing hash-tree based verification of untrusted external memory by a high performance processor. This verification could enable applications s...
Blaise Gassend, G. Edward Suh, Dwaine E. Clarke, M...
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
One of the research problems in P2P computing is to look up and store the resource efficiently. The recent algorithms developed by several research groups for the lookup problem p...
Sun-Mi Park, Il-dong Jung, Dong-joo Song, Young-su...