Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the optimal time/space tradeoff for hash tables

From MaRDI portal
Publication:6083583
Jump to:navigation, search

DOI10.1145/3519935.3519969arXiv2111.00602OpenAlexW3208234243MaRDI QIDQ6083583

William Kuszmaul, Unnamed Author, Martín Farach-Colton, Michael A. Bender, Mingmou Liu

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.00602

zbMATH Keywords

data structureshash tablesballs and binssuccinct


Mathematics Subject Classification ID

Theory of computing (68Qxx)





Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6083583&oldid=35529784"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 10 July 2024, at 07:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki