Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

88

TKDE
1998

63views more TKDE 1998»

Reducing the Storage Requirements of a Perfect Hash Function

15 years 2 months ago

Reducing the Storage Requirements of a Perfect Hash Function

Download www.mathcs.emory.edu

Paolino Di Felice, Ugo Madama

Real-time Traffic

TKDE 1998 |

claim paper

Related Content

» GigaHash scalable minimal perfect hashing for billions of urls

» Indexing Internal Memory with Minimal Perfect Hash Functions

» Graphs Hypergraphs and Hashing

» Blooming Trees for Minimal Perfect Hashing

» Theory and Practise of Monotone Minimal Perfect Hashing

» A Practical Minimal Perfect Hashing Method

» MAME A Compression Function with Reduced Hardware Requirements

» A Key Distribution method for Reducing Storage and Supporting High Level Security in the L...

» Collisions and NearCollisions for ReducedRound Tiger

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TKDE
Authors	Paolino Di Felice, Ugo Madama

Comments (0)