Expected Worst-case Performance of Hash Files
نویسندگان
چکیده
منابع مشابه
Efficient Hash Tables with Worst Case Constant Access
We generalize Cuckoo Hashing [23] to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ε) n memory cells, for any constant ε > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d = O(ln(1/ε)) probes and the expected amortized insertion time is constant. This is the first dictionary that has worst case con...
متن کاملWorst-Case Expected Shortfall with Univariate and Bivariate Marginals
Worst-case bounds on the expected shortfall risk given only limited information on the distribution of the random variables has been studied extensively in the literature. In this paper, we develop a new worst-case bound on the expected shortfall when the univariate marginals are known exactly and additional expert information is available in terms of bivariate marginals. Such expert informatio...
متن کاملExpected worst-case partial match in random quadtries
We consider random multivariate quadtries obtained from n points independently and uniformly distributed on the unit cube of Rd. Let Nn(y) be the complexity of the standard partial match algorithm for fixed vector y, where y is a vector in Rs, 0 < s < d. We study Nn = supy Nn(y), the worst-case time for partial match. Among other things, we show that partial match is very stable, in the sense t...
متن کاملTesting Forensic Hash Tools on Sparse Files
Forensic hash tools are usually used to prove and protect the integrity of digital evidence: When a file is intercepted by law enforcement, a cryprographic fingerprint is taken by using a forensic hash tool. If later in a court of law the identical fingerprint can be computed from the presented evidence, the evidence is taken to be original. In this paper we demonstrate that most of the freely ...
متن کاملDiscrete Loops and Worst Case Performance
In this paper so-called discrete loops are introduced which narrow the gap between general loops (e.g. while-or repeat-loops) and for-loops. Although discrete loops can be used for applications that would otherwise require general loops, discrete loops are known to complete in any case. Furthermore it is possible to determine the number of iterations of a discrete loop, while this is trivial to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1982
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/25.3.347