[{"status":"public","type":"conference","publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90","language":[{"iso":"eng"}],"_id":"16741","user_id":"15415","department":[{"_id":"63"}],"year":"1990","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.","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>.","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>","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} }","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>.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing  - STOC ’90, 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>"},"publication_status":"published","publication_identifier":{"isbn":["0897913612"]},"title":"How to distribute a dictionary in a complete network","doi":"10.1145/100216.100229","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:41:08Z","author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M.","first_name":"M."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}]},{"date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:41:55Z","author":[{"first_name":"J.","full_name":"Gil, J.","last_name":"Gil"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Wigderson, A.","last_name":"Wigderson","first_name":"A."}],"title":"Not all keys can be hashed in constant time","doi":"10.1145/100216.100247","publication_identifier":{"isbn":["0897913612"]},"publication_status":"published","year":"1990","citation":{"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>.","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.","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>","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>.","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} }","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.","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>"},"_id":"16742","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing  - STOC '90","type":"conference","status":"public"}]