Implementation of a Perfect Hash Function Scheme

Simple item page
dc.contributor.authorDatta, Sanjeeven
dc.contributor.authorFox, Edward A.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:35Zen
dc.date.available2013-06-19T14:36:35Zen
dc.date.issued1989-03-01en
dc.description.abstractThis report surveys the recent development in computing perfect hash functions, and in particular, closely examines an algorithm proposed by Thomas Sager. An implementation of that algorithm in C has been done to demonstrate and verify the behavior of the algorithm for various settings of parameters.en
dc.format.mimetypeapplication/pdfen
dc.identifierhttp://eprints.cs.vt.edu/archive/00000146/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000146/01/TR-89-09.pdfen
dc.identifier.trnumberTR-89-09en
dc.identifier.urihttp://hdl.handle.net/10919/19495en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleImplementation of a Perfect Hash Function Schemeen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-89-09.pdf
Size:
2.63 MB
Format:
Adobe Portable Document Format
Download

Collections

Computer Science Technical Reports