[{"publication":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16766","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["0818608773"]},"publication_status":"published","citation":{"short":"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.","bibtex":"@inproceedings{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1988, title={Dynamic perfect hashing: upper and lower bounds}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1988.21968\">10.1109/sfcs.1988.21968</a>}, 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} }","mla":"Dietzfelbinger, M., et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988, doi:<a href=\"https://doi.org/10.1109/sfcs.1988.21968\">10.1109/sfcs.1988.21968</a>.","apa":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &#38; Tarjan, R. E. (1988). Dynamic perfect hashing: upper and lower bounds. In <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1988.21968\">https://doi.org/10.1109/sfcs.1988.21968</a>","chicago":"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 <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988. <a href=\"https://doi.org/10.1109/sfcs.1988.21968\">https://doi.org/10.1109/sfcs.1988.21968</a>.","ieee":"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 <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>, 1988.","ama":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic perfect hashing: upper and lower bounds. In: <i>[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science</i>. ; 1988. doi:<a href=\"https://doi.org/10.1109/sfcs.1988.21968\">10.1109/sfcs.1988.21968</a>"},"year":"1988","author":[{"first_name":"M.","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M."},{"first_name":"A.","full_name":"Karlin, A.","last_name":"Karlin"},{"first_name":"K.","full_name":"Mehlhorn, K.","last_name":"Mehlhorn"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"H.","full_name":"Rohnert, H.","last_name":"Rohnert"},{"last_name":"Tarjan","full_name":"Tarjan, R.E.","first_name":"R.E."}],"date_created":"2020-04-21T08:59:26Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1109/sfcs.1988.21968","title":"Dynamic perfect hashing: upper and lower bounds"}]