English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Dynamic Perfect Hashing: Upper and Lower Bounds

MPS-Authors
/persons/resource/persons44318

Dietzfelbinger,  Martin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Karlin,  Anna
Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Rohnert,  Hans
Max Planck Society;

Tarjan,  Robert E.
Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., & Tarjan, R. E. (1988). Dynamic Perfect Hashing: Upper and Lower Bounds. In 29th Annual Symposium on Foundations of Computer Science (FOCS 1988) (pp. 524-531). Washington, USA: IEEE.


Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AE86-5
Abstract
There is no abstract available