Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
  Browse All Reviews > Data (E) > Data Storage Representations (E.2) > Hash-Table Representations (E.2...)  
  1-10 of 18 Reviews about "Hash-Table Representations (E.2...)": Date Reviewed
  Asymptotically efficient lattice-based digital signatures
Lyubashevsky V., Micciancio D. Journal of Cryptology 31(3): 774-797, 2018.  Type: Article

This paper proposes a general framework for designing a one-time signature scheme using “certain types of linear collision-resistant hash functions.” Using a standard transformation (for example, signatures based on...

Oct 2 2018
  A modified exhaustive search on a password system using SHA-1
Kim M., Jung Y., Song J. International Journal of Information Security 16(3): 263-269, 2017.  Type: Article

Nowadays information is more and more of an asset; as such, it is becoming ever more important as evidence in law enforcement cases. Being valuable, information is often encrypted; thus law enforcement bodies must have access to method...

Jul 6 2017
  Compressed matrix multiplication
Pagh R. ACM Transactions on Computation Theory 5(3): 1-17, 2013.  Type: Article, Reviews: (2 of 2)

This paper is concerned with approximating a matrix product, that is, finding the large entries (AB){i,j} [and the corresponding indices (i,
Jul 18 2014
  Compressed matrix multiplication
Pagh R. ACM Transactions on Computation Theory 5(3): 1-17, 2013.  Type: Article, Reviews: (1 of 2)

There has been a lot of research on matrix multiplication algorithms in the recent past. For insight, one should read the second volume of Knuth’s wonderful set of books on algorithms [1]....

Jun 5 2014
  LH*--a scalable, distributed data structure
Litwin W., Neimat M., Schneider D. ACM Transactions on Database Systems 21(4): 480-525, 1996.  Type: Article

Linear hashing (LH) is a directoryless, dynamic hashing technique developed by Litwin. LH* is a generalization of LH that allows for hashing in a distributed environment....

Oct 1 1997
  Maximum size of a dynamic data structure
Aldous D., Hofri M., Szpankowski W. (ed) SIAM Journal on Computing 21(4): 713-732, 1992.  Type: Article

Queueing analysis is used to study the wasted space that results from lazy deletions in a bucket hash table. With lazy deletions, deletions are performed only when a new item is added to the bucket. Using the assumptions underlying the...

Oct 1 1993
  Fast hashing of variable-length text strings
Pearson P. Communications of the ACM 33(6): 677-680, 1990.  Type: Article

A simple, fast, interesting, apparently effective, and apparently new hashing function for strings of text is based on iterated use of the exclusive OR (XOR) operation and avoids the use of multiplication, division, and long register s...

Dec 1 1990
  Concurrent operations on extendible hashing and its performance
Kumar V. Communications of the ACM 33(6): 681-694, 1990.  Type: Article

Extendible hashing is a mechanism that allows two-level access to an arbitrary number of records using a hash function. The scheme is dynamic, allowing the hash table to grow and shrink as records are inserted and deleted....

Dec 1 1990
  Practical performance of Bloom filters and parallel free-text searching
Ramakrishna M. Communications of the ACM 32(10): 1237-1239, 1989.  Type: Article

This short communication deals with a special kind of hash function called “Bloom filters.” These filters are used, for example, to search a differential file containing updates to a main file. The paper recalls the...

May 1 1990
  A probability model for overflow sufficiency in small hash tables
Norton R., Yeager D. Communications of the ACM 28(10): 1068-1075, 1985.  Type: Article

When limited disk space is allocated for a hashed database, it is split between a primary area for hash buckets and an overflow area for records that hash to full buckets. Within the range of its validity, the model in this paper shows...

Sep 1 1987
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2023 ThinkLoud®
Terms of Use
| Privacy Policy