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