Clocked adversaries for hashing

DOI10.1007/BF01190898zbMath0787.68028OpenAlexW2058097145WikidataQ56287551 ScholiaQ56287551MaRDI QIDQ1209734

Jeffrey F. Naughton, Richard J. Lipton

Publication date: 16 May 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190898

zbMATH Keywords

hashingPRAM modeladversary techniquesclocked adversaries

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Bloom Filters in Adversarial Environments ⋮ Perfect hashing ⋮ Fast rehashing in PRAM emulations

Cites Work

• How to emulate shared memory
• Universal classes of hash functions
• How to share memory in a distributed system
• Parallel hashing
• Dynamic Perfect Hashing: Upper and Lower Bounds

This page was built for publication: Clocked adversaries for hashing