English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Fast and Reliable Parallel Hashing

Bast, H., & Hagerup, T. (1991). Fast and Reliable Parallel Hashing. In 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91) (pp. 50-61). New York, NY, USA: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE37-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AE38-6
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bast, Holger1, Author           
Hagerup, Torben1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: A perfect hash function for a (multi)set $X$ of $n$ integers is an injective function $h:X\to\{1,\ldots,s\}$, where $s=O(n)$, that can be stored in $O(n)$ space and evaluated in constant time by a single processor. We show that a perfect hash function for a given multiset of $n$ integers can be constructed optimally in $O(\log^* n)$ time using $O(n/\log^* n)$ processors. Our algorithm is faster than all previously published methods. More significantly, it is highly reliable: Whereas analyses of previous fast parallel hashing schemes provided bounds on the expected resource requirements only, our algorithm is guaranteed to stay within the bounds given with overwhelming probability.

Details

show
hide
Language(s): eng - English
 Dates: 2006-09-191991
 Publication Status: Issued
 Pages: -
 Publishing info: New York, NY, USA : ACM
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 518233
Other: Local-ID: C1256428004B93B8-E59C179126DA04D4C12571880047B476-BastH91
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Hilton Head Island, South Carolina, USA
Start-/End Date: 2001-07-21 - 2001-07-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'91)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY, USA : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 50 - 61 Identifier: -