{"doi":"10.1137/s0097539791194094","department":[{"_id":"63"}],"user_id":"15415","citation":{"mla":"Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>SIAM Journal on Computing</i>, 1994, pp. 738–61, doi:<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>.","short":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.","apa":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &#38; Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. <i>SIAM Journal on Computing</i>, 738–761. <a href=\"https://doi.org/10.1137/s0097539791194094\">https://doi.org/10.1137/s0097539791194094</a>","ama":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. <i>SIAM Journal on Computing</i>. 1994:738-761. doi:<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>","bibtex":"@article{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994, title={Dynamic Perfect Hashing: Upper and Lower Bounds}, DOI={<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>}, journal={SIAM Journal on Computing}, author={Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.}, year={1994}, pages={738–761} }","chicago":"Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>SIAM Journal on Computing</i>, 1994, 738–61. <a href=\"https://doi.org/10.1137/s0097539791194094\">https://doi.org/10.1137/s0097539791194094</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,” <i>SIAM Journal on Computing</i>, pp. 738–761, 1994."},"type":"journal_article","page":"738-761","date_created":"2020-04-20T10:19:33Z","title":"Dynamic Perfect Hashing: Upper and Lower Bounds","publication":"SIAM Journal on Computing","date_updated":"2022-01-06T06:52:55Z","status":"public","author":[{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"first_name":"Anna","last_name":"Karlin","full_name":"Karlin, Anna"},{"first_name":"Kurt","last_name":"Mehlhorn","full_name":"Mehlhorn, Kurt"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm"},{"full_name":"Rohnert, Hans","last_name":"Rohnert","first_name":"Hans"},{"first_name":"Robert E.","full_name":"Tarjan, Robert E.","last_name":"Tarjan"}],"publication_status":"published","year":"1994","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"_id":"16728"}