[{"_id":"23372","date_updated":"2022-01-06T06:55:50Z","language":[{"iso":"eng"}],"year":"1990","citation":{"short":"A. Trächtler, Fortschritte in Der Simulationstechnik Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg (1990) 395-397,.","ieee":"A. Trächtler, “Simulation dynamischer Systeme mit dem Programmsystem PILAR,” Fortschritte in der Simulationstechnik, vol. Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg, pp. 395-397, 1990.","chicago":"Trächtler, Ansgar. “Simulation Dynamischer Systeme Mit Dem Programmsystem PILAR.” Fortschritte in Der Simulationstechnik Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg (1990): 395-397,.","apa":"Trächtler, A. (1990). Simulation dynamischer Systeme mit dem Programmsystem PILAR. Fortschritte in Der Simulationstechnik, Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg, 395-397,.","ama":"Trächtler A. Simulation dynamischer Systeme mit dem Programmsystem PILAR. Fortschritte in der Simulationstechnik. 1990;Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg:395-397,.","mla":"Trächtler, Ansgar. “Simulation Dynamischer Systeme Mit Dem Programmsystem PILAR.” Fortschritte in Der Simulationstechnik, vol. Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg, 1990, pp. 395-397,.","bibtex":"@article{Trächtler_1990, title={Simulation dynamischer Systeme mit dem Programmsystem PILAR}, volume={Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg}, journal={Fortschritte in der Simulationstechnik}, author={Trächtler, Ansgar}, year={1990}, pages={395-397,} }"},"type":"journal_article","page":"395-397,","user_id":"24876","title":"Simulation dynamischer Systeme mit dem Programmsystem PILAR","status":"public","date_created":"2021-08-09T09:36:24Z","volume":"Bd. 1. Hrsg.: F. Breitenecker, I. Troch, P. Kopacek. Braunschweig: Vieweg","author":[{"first_name":"Ansgar","full_name":"Trächtler, Ansgar","last_name":"Trächtler","id":"552"}],"department":[{"_id":"153"}],"publication":"Fortschritte in der Simulationstechnik"},{"title":"Berechnung der Nullstellen quadratischer Mehrgrößensysteme","user_id":"24876","status":"public","date_created":"2021-08-09T09:36:26Z","author":[{"last_name":"Trächtler","id":"552","first_name":"Ansgar","full_name":"Trächtler, Ansgar"},{"first_name":"Boris","full_name":"Lohmann, Boris","last_name":"Lohmann"}],"publication":"at-Automatisierungstechnik","department":[{"_id":"153"}],"date_updated":"2022-01-06T06:55:50Z","_id":"23373","citation":{"ieee":"A. Trächtler and B. Lohmann, “Berechnung der Nullstellen quadratischer Mehrgrößensysteme,” at-Automatisierungstechnik, pp. 353-354, 1990.","short":"A. Trächtler, B. Lohmann, At-Automatisierungstechnik (1990) 353-354,.","bibtex":"@article{Trächtler_Lohmann_1990, title={Berechnung der Nullstellen quadratischer Mehrgrößensysteme}, journal={at-Automatisierungstechnik}, author={Trächtler, Ansgar and Lohmann, Boris}, year={1990}, pages={353-354,} }","mla":"Trächtler, Ansgar, and Boris Lohmann. “Berechnung Der Nullstellen Quadratischer Mehrgrößensysteme.” At-Automatisierungstechnik, 1990, pp. 353-354,.","chicago":"Trächtler, Ansgar, and Boris Lohmann. “Berechnung Der Nullstellen Quadratischer Mehrgrößensysteme.” At-Automatisierungstechnik, 1990, 353-354,.","apa":"Trächtler, A., & Lohmann, B. (1990). Berechnung der Nullstellen quadratischer Mehrgrößensysteme. At-Automatisierungstechnik, 353-354,.","ama":"Trächtler A, Lohmann B. Berechnung der Nullstellen quadratischer Mehrgrößensysteme. at-Automatisierungstechnik. 1990:353-354,."},"year":"1990","type":"journal_article","page":"353-354,","language":[{"iso":"eng"}]},{"_id":"7824","date_updated":"2022-01-06T07:03:46Z","language":[{"iso":"eng"}],"page":"177-188","type":"conference","year":"1990","citation":{"mla":"Hohenstein, Uwe, and Gregor Engels. “Formal Semantics of an Entity-Relationship Query Language.” Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland, ER Institute, 1990, pp. 177–88.","bibtex":"@inproceedings{Hohenstein_Engels_1990, title={Formal Semantics of an Entity-Relationship Query Language}, booktitle={Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland}, publisher={ER Institute}, author={Hohenstein, Uwe and Engels, Gregor}, year={1990}, pages={177–188} }","chicago":"Hohenstein, Uwe, and Gregor Engels. “Formal Semantics of an Entity-Relationship Query Language.” In Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland, 177–88. ER Institute, 1990.","apa":"Hohenstein, U., & Engels, G. (1990). Formal Semantics of an Entity-Relationship Query Language. In Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland (pp. 177–188). ER Institute.","ama":"Hohenstein U, Engels G. Formal Semantics of an Entity-Relationship Query Language. In: Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland. ER Institute; 1990:177-188.","ieee":"U. Hohenstein and G. Engels, “Formal Semantics of an Entity-Relationship Query Language,” in Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland, 1990, pp. 177–188.","short":"U. Hohenstein, G. Engels, in: Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland, ER Institute, 1990, pp. 177–188."},"user_id":"52534","title":"Formal Semantics of an Entity-Relationship Query Language","publication":"Proceedings of the 9th International Conference on Entity-Relationship Approach (ER 90), Lausanne, Switzerland","department":[{"_id":"66"}],"publisher":"ER Institute","author":[{"full_name":"Hohenstein, Uwe","first_name":"Uwe","last_name":"Hohenstein"},{"full_name":"Engels, Gregor","first_name":"Gregor","id":"107","last_name":"Engels"}],"date_created":"2019-02-20T13:50:40Z","status":"public"},{"doi":"10.1016/B978-0-08-037539-7.50062-4","date_updated":"2022-01-06T07:03:50Z","_id":"8081","conference":{"location":"Reading (UK)","start_date":"1990-09-23","name":"1st World Renewable Energy Congress","end_date":"1990-09-28"},"citation":{"short":"S. Krauter, R. Hanitsch, in: Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144., 1990.","ieee":"S. Krauter and R. Hanitsch, “The Influence of the Capsulation on the Efficiency of PV-Modules.,” in Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144., Reading (UK), 1990.","ama":"Krauter S, Hanitsch R. The Influence of the Capsulation on the Efficiency of PV-Modules. In: Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144. ; 1990. doi:10.1016/B978-0-08-037539-7.50062-4","apa":"Krauter, S., & Hanitsch, R. (1990). The Influence of the Capsulation on the Efficiency of PV-Modules. In Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144. Reading (UK). https://doi.org/10.1016/B978-0-08-037539-7.50062-4","chicago":"Krauter, Stefan, and Rolf Hanitsch. “The Influence of the Capsulation on the Efficiency of PV-Modules.” In Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144., 1990. https://doi.org/10.1016/B978-0-08-037539-7.50062-4.","mla":"Krauter, Stefan, and Rolf Hanitsch. “The Influence of the Capsulation on the Efficiency of PV-Modules.” Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144., 1990, doi:10.1016/B978-0-08-037539-7.50062-4.","bibtex":"@inproceedings{Krauter_Hanitsch_1990, title={The Influence of the Capsulation on the Efficiency of PV-Modules.}, DOI={10.1016/B978-0-08-037539-7.50062-4}, booktitle={Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144.}, author={Krauter, Stefan and Hanitsch, Rolf}, year={1990} }"},"type":"conference","year":"1990","language":[{"iso":"eng"}],"title":"The Influence of the Capsulation on the Efficiency of PV-Modules.","user_id":"16148","extern":"1","status":"public","date_created":"2019-02-26T06:21:38Z","author":[{"first_name":"Stefan","full_name":"Krauter, Stefan","orcid":"0000-0002-3594-260X","last_name":"Krauter","id":"28836"},{"last_name":"Hanitsch","first_name":"Rolf","full_name":"Hanitsch, Rolf"}],"publication":"Proceedings of the 1st World Renewable Energy Congress, Reading (UK), 23.–28. September 1990, Band 1, S. 141–144.","department":[{"_id":"53"}]},{"publisher":"Springer","author":[{"last_name":"Engels","id":"107","first_name":"Gregor","full_name":"Engels, Gregor"}],"publication":"Proceedings of the workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany)","status":"public","date_created":"2019-03-04T11:52:08Z","volume":532,"abstract":[{"lang":"eng","text":"Semantic data models have been widely studied for the conceptual specification of databases. However, most of these data models are restricted to the description of the static structure of a database. They do not provide means to specify the dynamic behaviour of a database. This paper sketches a language for the specification of actions on databases which have been specified by an Extended Entity-Relationship (EER) schema. These actions are based on so-called elementary actions, which are automatically be derived from the EER schema. So, it can always be guaranteed that these schema dependent elementary actions preserve all inherent integrity constraints. The semantics of the elementary actions is given in two steps: First, it is shown how the semantics of a database schema, i.e., a current database state, can be represented by an attributed graph. Then, the semantics of elementary actions is given by programmed graph replacements."}],"user_id":"52534","citation":{"ieee":"G. Engels, “Elementary Actions on an Extended Entity-Relationship Database,” in Proceedings of the workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany), 1990, vol. 532, pp. 344–362.","short":"G. Engels, in: Proceedings of the Workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany), Springer, Berlin/Heidelberg, 1990, pp. 344–362.","mla":"Engels, Gregor. “Elementary Actions on an Extended Entity-Relationship Database.” Proceedings of the Workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany), vol. 532, Springer, 1990, pp. 344–62, doi:http://dx.doi.org/10.1007/BFb0017372.","bibtex":"@inproceedings{Engels_1990, place={Berlin/Heidelberg}, title={Elementary Actions on an Extended Entity-Relationship Database}, volume={532}, DOI={http://dx.doi.org/10.1007/BFb0017372}, booktitle={Proceedings of the workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany)}, publisher={Springer}, author={Engels, Gregor}, year={1990}, pages={344–362} }","apa":"Engels, G. (1990). Elementary Actions on an Extended Entity-Relationship Database. In Proceedings of the workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany) (Vol. 532, pp. 344–362). Berlin/Heidelberg: Springer. http://dx.doi.org/10.1007/BFb0017372","ama":"Engels G. Elementary Actions on an Extended Entity-Relationship Database. In: Proceedings of the Workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany). Vol 532. Berlin/Heidelberg: Springer; 1990:344-362. doi:http://dx.doi.org/10.1007/BFb0017372","chicago":"Engels, Gregor. “Elementary Actions on an Extended Entity-Relationship Database.” In Proceedings of the Workshop on Graph Grammars and Their Application to Computer Science (1990), Bremen (Germany), 532:344–62. Berlin/Heidelberg: Springer, 1990. http://dx.doi.org/10.1007/BFb0017372."},"year":"1990","type":"conference","page":"344-362","_id":"8259","intvolume":" 532","department":[{"_id":"66"}],"place":"Berlin/Heidelberg","title":"Elementary Actions on an Extended Entity-Relationship Database","language":[{"iso":"eng"}],"date_updated":"2022-01-06T07:03:52Z","doi":"http://dx.doi.org/10.1007/BFb0017372"},{"title":"A new universal class of hash functions and dynamic hashing in real time","user_id":"15415","place":"Berlin/Heidelberg","publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","date_created":"2020-04-20T11:37:37Z","status":"public","department":[{"_id":"63"}],"publication":"Automata, Languages and Programming","author":[{"first_name":"Martin","full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.1007/bfb0032018","_id":"16738","date_updated":"2022-01-06T06:52:55Z","citation":{"short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Automata, Languages and Programming, Berlin/Heidelberg, 1990.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “A new universal class of hash functions and dynamic hashing in real time,” in Automata, Languages and Programming, Berlin/Heidelberg, 1990.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” In Automata, Languages and Programming. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0032018.","ama":"Dietzfelbinger M, Meyer auf der Heide F. A new universal class of hash functions and dynamic hashing in real time. In: Automata, Languages and Programming. Berlin/Heidelberg; 1990. doi:10.1007/bfb0032018","apa":"Dietzfelbinger, M., & Meyer auf der Heide, F. (1990). A new universal class of hash functions and dynamic hashing in real time. In Automata, Languages and Programming. Berlin/Heidelberg. https://doi.org/10.1007/bfb0032018","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={A new universal class of hash functions and dynamic hashing in real time}, DOI={10.1007/bfb0032018}, booktitle={Automata, Languages and Programming}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1990} }","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “A New Universal Class of Hash Functions and Dynamic Hashing in Real Time.” Automata, Languages and Programming, 1990, doi:10.1007/bfb0032018."},"type":"book_chapter","year":"1990","language":[{"iso":"eng"}]},{"title":"Dynamic hashing strategies","user_id":"15415","place":"Berlin/Heidelberg","publication_identifier":{"isbn":["3540529535"]},"publication_status":"published","status":"public","date_created":"2020-04-20T11:39:31Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"publication":"Lecture Notes in Computer Science","department":[{"_id":"63"}],"doi":"10.1007/bfb0029597","_id":"16739","date_updated":"2022-01-06T06:52:55Z","type":"book_chapter","year":"1990","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029597.","ama":"Meyer auf der Heide F. Dynamic hashing strategies. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029597","apa":"Meyer auf der Heide, F. (1990). Dynamic hashing strategies. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029597","mla":"Meyer auf der Heide, Friedhelm. “Dynamic Hashing Strategies.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029597.","bibtex":"@inbook{Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={Dynamic hashing strategies}, DOI={10.1007/bfb0029597}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1990} }","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","ieee":"F. Meyer auf der Heide, “Dynamic hashing strategies,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990."},"language":[{"iso":"eng"}]},{"title":"On the complexity of genuinely polynomial computation","user_id":"15415","place":"Berlin/Heidelberg","publication_status":"published","publication_identifier":{"isbn":["3540529535"]},"date_created":"2020-04-20T11:40:17Z","status":"public","department":[{"_id":"63"}],"publication":"Lecture Notes in Computer Science","author":[{"last_name":"Karpinski","first_name":"Marek","full_name":"Karpinski, Marek"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"doi":"10.1007/bfb0029630","_id":"16740","date_updated":"2022-01-06T06:52:55Z","type":"book_chapter","citation":{"mla":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” Lecture Notes in Computer Science, 1990, doi:10.1007/bfb0029630.","bibtex":"@inbook{Karpinski_Meyer auf der Heide_1990, place={Berlin/Heidelberg}, title={On the complexity of genuinely polynomial computation}, DOI={10.1007/bfb0029630}, booktitle={Lecture Notes in Computer Science}, author={Karpinski, Marek and Meyer auf der Heide, Friedhelm}, year={1990} }","apa":"Karpinski, M., & Meyer auf der Heide, F. (1990). On the complexity of genuinely polynomial computation. In Lecture Notes in Computer Science. Berlin/Heidelberg. https://doi.org/10.1007/bfb0029630","ama":"Karpinski M, Meyer auf der Heide F. On the complexity of genuinely polynomial computation. In: Lecture Notes in Computer Science. Berlin/Heidelberg; 1990. doi:10.1007/bfb0029630","chicago":"Karpinski, Marek, and Friedhelm Meyer auf der Heide. “On the Complexity of Genuinely Polynomial Computation.” In Lecture Notes in Computer Science. Berlin/Heidelberg, 1990. https://doi.org/10.1007/bfb0029630.","ieee":"M. Karpinski and F. Meyer auf der Heide, “On the complexity of genuinely polynomial computation,” in Lecture Notes in Computer Science, Berlin/Heidelberg, 1990.","short":"M. Karpinski, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin/Heidelberg, 1990."},"year":"1990","language":[{"iso":"eng"}]},{"author":[{"last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, M.","first_name":"M."},{"last_name":"Meyer auf der Heide","id":"15523","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","department":[{"_id":"63"}],"status":"public","date_created":"2020-04-20T11:41:08Z","publication_status":"published","publication_identifier":{"isbn":["0897913612"]},"user_id":"15415","title":"How to distribute a dictionary in a complete network","language":[{"iso":"eng"}],"year":"1990","citation":{"short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing - STOC ’90, 1990.","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.","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.","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","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","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} }"},"type":"conference","_id":"16741","date_updated":"2022-01-06T06:52:55Z","doi":"10.1145/100216.100229"},{"publication_identifier":{"isbn":["0897913612"]},"publication_status":"published","status":"public","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","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Wigderson","first_name":"A.","full_name":"Wigderson, A."}],"department":[{"_id":"63"}],"publication":"Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90","title":"Not all keys can be hashed in constant time","user_id":"15415","year":"1990","citation":{"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.","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","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","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.","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.","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."},"type":"conference","language":[{"iso":"eng"}],"doi":"10.1145/100216.100247","date_updated":"2022-01-06T06:52:55Z","_id":"16742"}]