Determining membership with 2 simultaneous queries

DOI10.1016/j.tcs.2014.05.020zbMath1360.68392OpenAlexW2024316265MaRDI QIDQ2250448

David M. Howard

Publication date: 7 July 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.05.020

zbMATH Keywords

sortinginformation retrievalsearchingmembershipcell-probe

Mathematics Subject Classification ID

Searching and sorting (68P10) Cooperative games (91A12) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Storing information with extractors.
• Low Redundancy in Static Dictionaries with Constant Query Time
• A Survey of Data Structures in the Bitprobe Model
• Are Bitvectors Optimal?
• Data Structures for Storing Small Sets in the Bitprobe Model
• Should Tables Be Sorted?
• Membership in Constant Time and Almost-Minimum Space
• Bit-Probe Lower Bounds for Succinct Data Structures
• On the cell probe complexity of membership and perfect hashing

This page was built for publication: Determining membership with 2 simultaneous queries