2004•Theory of Computing SystemsOpen access

Space Efficient Hash Tables with Worst Case Constant Access Time

Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis

Open full text 170 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 170 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Dynamic perfect hashing, Hash table, Constant (computer programming), Perfect hash function, Hash function, Double hashing, Universal hashing, Computer science

Back to paper search Browse research topics Original source

Space Efficient Hash Tables with Worst Case Constant Access Time — Research Paper | ScholarLens