[{"user_id":"15415","doi":"10.1145/100216.100229","_id":"16741","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","publication_identifier":{"isbn":["0897913612"]},"author":[{"last_name":"Dietzfelbinger","first_name":"M.","full_name":"Dietzfelbinger, M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"}],"title":"How to distribute a dictionary in a complete network","status":"public","year":"1990","department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-20T11:41:08Z","citation":{"ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “How to distribute a dictionary in a complete network,” in <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>, 1990.","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1990). How to distribute a dictionary in a complete network. In <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>. <a href=\"https://doi.org/10.1145/100216.100229\">https://doi.org/10.1145/100216.100229</a>","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.","chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” In <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href=\"https://doi.org/10.1145/100216.100229\">https://doi.org/10.1145/100216.100229</a>.","mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “How to Distribute a Dictionary in a Complete Network.” <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>.","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1990, title={How to distribute a dictionary in a complete network}, DOI={<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>}, booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1990} }","ama":"Dietzfelbinger M, Meyer auf der Heide F. How to distribute a dictionary in a complete network. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href=\"https://doi.org/10.1145/100216.100229\">10.1145/100216.100229</a>"},"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90"},{"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90","citation":{"mla":"Gil, J., et al. “Not All Keys Can Be Hashed in Constant Time.” <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990, doi:<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>.","apa":"Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1990). Not all keys can be hashed in constant time. In <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>. <a href=\"https://doi.org/10.1145/100216.100247\">https://doi.org/10.1145/100216.100247</a>","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “Not all keys can be hashed in constant time,” in <i>Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90</i>, 1990.","chicago":"Gil, J., Friedhelm Meyer auf der Heide, and A. Wigderson. “Not All Keys Can Be Hashed in Constant Time.” In <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>, 1990. <a href=\"https://doi.org/10.1145/100216.100247\">https://doi.org/10.1145/100216.100247</a>.","short":"J. Gil, F. Meyer auf der Heide, A. Wigderson, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 1990.","ama":"Gil J, Meyer auf der Heide F, Wigderson A. Not all keys can be hashed in constant time. In: <i>Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90</i>. ; 1990. doi:<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>","bibtex":"@inproceedings{Gil_Meyer auf der Heide_Wigderson_1990, title={Not all keys can be hashed in constant time}, DOI={<a href=\"https://doi.org/10.1145/100216.100247\">10.1145/100216.100247</a>}, booktitle={Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC ’90}, author={Gil, J. and Meyer auf der Heide, Friedhelm and Wigderson, A.}, year={1990} }"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-20T11:41:55Z","publication_status":"published","date_updated":"2022-01-06T06:52:55Z","year":"1990","status":"public","title":"Not all keys can be hashed in constant time","publication_identifier":{"isbn":["0897913612"]},"author":[{"full_name":"Gil, J.","last_name":"Gil","first_name":"J."},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Wigderson","first_name":"A.","full_name":"Wigderson, A."}],"user_id":"15415","doi":"10.1145/100216.100247","language":[{"iso":"eng"}],"_id":"16742"}]