Sciweavers

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

109

Voted

WADS
1999
Springer

166views Algorithms» more WADS 1999»

Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions

15 years 7 months ago

Hash and Displace: Efficient Evaluation of Minimal Perfect Hash Functions

Download www.it-c.dk

Rasmus Pagh

Real-time Traffic

Algorithms | WADS 1999 |

claim paper

Related Content

» GigaHash scalable minimal perfect hashing for billions of urls

» Indexing Internal Memory with Minimal Perfect Hash Functions

» Move Generation with Perfect Hash Functions

» Hash Displace and Compress

» A Practical Minimal Perfect Hashing Method

» Highly MemoryEfficient LogLog Hash for Deep Packet Inspection

» Compact Fast and Robust Grids for Ray Tracing

» Storing the Web in Memory Space Efficient Language Models with Constant Time Retrieval

» An efficient scheme for authenticating public keys in sensor networks

Post Info
More Details (n/a)

Added	05 Aug 2010
Updated	05 Aug 2010
Type	Conference
Year	1999
Where	WADS
Authors	Rasmus Pagh

Comments (0)