[{"date_created":"2018-06-05T08:51:15Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"64"}],"publication":"Data structures and efficient algorithms","citation":{"short":"H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.","chicago":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In <i>Data Structures and Efficient Algorithms</i>, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_19\">https://doi.org/10.1007/3-540-55488-2_19</a>.","ieee":"H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.","apa":"Alt, H., &#38; Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In <i>Data structures and efficient algorithms</i> (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_19\">https://doi.org/10.1007/3-540-55488-2_19</a>","bibtex":"@inbook{Alt_Blömer_1992, place={Berlin, Heidelberg}, title={Resemblance and symmetries of geometric patterns}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>}, booktitle={Data structures and efficient algorithms}, publisher={Springer Berlin Heidelberg}, author={Alt, Helmut and Blömer, Johannes}, year={1992}, pages={1–24} }","ama":"Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>","mla":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” <i>Data Structures and Efficient Algorithms</i>, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>."},"page":"1-24","publisher":"Springer Berlin Heidelberg","_id":"3046","user_id":"25078","doi":"10.1007/3-540-55488-2_19","year":"1992","title":"Resemblance and symmetries of geometric patterns","status":"public","author":[{"full_name":"Alt, Helmut","last_name":"Alt","first_name":"Helmut"},{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"publication_status":"published","date_updated":"2022-01-06T06:58:54Z"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"author":[{"last_name":"Dietzfelbinger","first_name":"Martin","full_name":"Dietzfelbinger, Martin"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"status":"public","year":"1992","title":"High performance universal hashing, with applications to shared memory simulations","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","_id":"16733","language":[{"iso":"eng"}],"doi":"10.1007/3-540-55488-2_31","user_id":"15415","citation":{"mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” <i>Data Structures and Efficient Algorithms</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>.","ama":"Dietzfelbinger M, Meyer auf der Heide F. High performance universal hashing, with applications to shared memory simulations. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>","bibtex":"@inbook{Dietzfelbinger_Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={High performance universal hashing, with applications to shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_31\">10.1007/3-540-55488-2_31</a>}, booktitle={Data structures and efficient algorithms}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1992} }","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1992). High performance universal hashing, with applications to shared memory simulations. In <i>Data structures and efficient algorithms</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “High performance universal hashing, with applications to shared memory simulations,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg, 1992.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992.","chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “High Performance Universal Hashing, with Applications to Shared Memory Simulations.” In <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_31\">https://doi.org/10.1007/3-540-55488-2_31</a>."},"publication":"Data structures and efficient algorithms","place":"Berlin, Heidelberg","date_created":"2020-04-20T11:27:50Z","department":[{"_id":"63"}],"type":"book_chapter"}]