page 60040 / 60054 » publications |
NIS
1998
14 years 9 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
SIAMCOMP
1998
14 years 9 months ago
1998
Random binary search trees, b-ary search trees, median-of-(2k+1) trees, quadtrees, simplex trees, tries, and digital search trees are special cases of random split trees. For these...
104
click to vote
SIAMCOMP
2002
14 years 9 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
TIT
1998
14 years 9 months ago
1998
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X ) where X = fXi:i 2 g. This can be viewed as a f...
TITB
1998
14 years 9 months ago
1998
Abstract— The European High-Performance Information Infrastructure in Medicine, nB3014 (HIM3) project of the Trans-European Network—Integrated Broadband Communications (TEN-IB...