{"citation":{"short":"J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.","ama":"Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. <i>SIAM Journal on Computing</i>. 1996:936-955. doi:<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>","chicago":"Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.” <i>SIAM Journal on Computing</i>, 1996, 936–55. <a href=\"https://doi.org/10.1137/s0097539793255722\">https://doi.org/10.1137/s0097539793255722</a>.","bibtex":"@article{Gil_Meyer auf der Heide_Wigderson_1996, title={The Tree Model for Hashing: Lower and Upper Bounds}, DOI={<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>}, journal={SIAM Journal on Computing}, author={Gil, Joseph and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1996}, pages={936–955} }","mla":"Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” <i>SIAM Journal on Computing</i>, 1996, pp. 936–55, doi:<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>.","apa":"Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. <i>SIAM Journal on Computing</i>, 936–955. <a href=\"https://doi.org/10.1137/s0097539793255722\">https://doi.org/10.1137/s0097539793255722</a>","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” <i>SIAM Journal on Computing</i>, pp. 936–955, 1996."},"user_id":"15415","department":[{"_id":"63"}],"doi":"10.1137/s0097539793255722","_id":"16701","publication_identifier":{"issn":["0097-5397","1095-7111"]},"language":[{"iso":"eng"}],"year":"1996","publication_status":"published","status":"public","author":[{"first_name":"Joseph","last_name":"Gil","full_name":"Gil, Joseph"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523"},{"first_name":"Avi","last_name":"Wigderson","full_name":"Wigderson, Avi"}],"date_updated":"2022-01-06T06:52:54Z","publication":"SIAM Journal on Computing","date_created":"2020-04-16T11:53:57Z","title":"The Tree Model for Hashing: Lower and Upper Bounds","page":"936-955","type":"journal_article"}