Dynamic perfect hashing: upper and lower bounds
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, in: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
Download
No fulltext has been uploaded.
Conference Paper
| Published
| English
Author
Dietzfelbinger, M.;
Karlin, A.;
Mehlhorn, K.;
Meyer auf der Heide, FriedhelmLibreCat;
Rohnert, H.;
Tarjan, R.E.
Publishing Year
Proceedings Title
[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
ISBN
LibreCat-ID
Cite this
Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. ; 1988. doi:10.1109/sfcs.1988.21968
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 [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. https://doi.org/10.1109/sfcs.1988.21968
@inproceedings{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1988, title={Dynamic perfect hashing: upper and lower bounds}, DOI={10.1109/sfcs.1988.21968}, booktitle={[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science}, author={Dietzfelbinger, M. and Karlin, A. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H. and Tarjan, R.E.}, year={1988} }
Dietzfelbinger, M., A. Karlin, K. Mehlhorn, Friedhelm Meyer auf der Heide, H. Rohnert, and R.E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988. https://doi.org/10.1109/sfcs.1988.21968.
M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic perfect hashing: upper and lower bounds,” in [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988, doi:10.1109/sfcs.1988.21968.
Google Scholar
ISBN Search