[{"_id":"16717","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Graph-Theoretic Concepts in Computer Science","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-17T07:46:18Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Matthias","last_name":"Westermann","full_name":"Westermann, Matthias"}],"title":"Hot-potato routing on multi-dimensional tori","doi":"10.1007/3-540-60618-1_77","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540606185","9783540484875"]},"publication_status":"published","year":"1995","place":"Berlin, Heidelberg","citation":{"apa":"Meyer auf der Heide, F., &#38; Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995.","mla":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” <i>Graph-Theoretic Concepts in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>.","bibtex":"@inbook{Meyer auf der Heide_Westermann_1995, place={Berlin, Heidelberg}, title={Hot-potato routing on multi-dimensional tori}, DOI={<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm and Westermann, Matthias}, year={1995} }","chicago":"Meyer auf der Heide, Friedhelm, and Matthias Westermann. “Hot-Potato Routing on Multi-Dimensional Tori.” In <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60618-1_77\">https://doi.org/10.1007/3-540-60618-1_77</a>.","ieee":"F. Meyer auf der Heide and M. Westermann, “Hot-potato routing on multi-dimensional tori,” in <i>Graph-Theoretic Concepts in Computer Science</i>, Berlin, Heidelberg, 1995.","ama":"Meyer auf der Heide F, Westermann M. Hot-potato routing on multi-dimensional tori. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60618-1_77\">10.1007/3-540-60618-1_77</a>"}},{"date_updated":"2022-01-06T06:52:58Z","author":[{"first_name":"Armin","last_name":"Bäumker","full_name":"Bäumker, Armin"},{"first_name":"Wolfgang","full_name":"Dittrich, Wolfgang","last_name":"Dittrich"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"date_created":"2020-04-27T13:59:05Z","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","doi":"10.1007/3-540-60313-1_131","publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"1995","place":"Berlin, Heidelberg","citation":{"mla":"Bäumker, Armin, et al. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>.","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_1995, place={Berlin, Heidelberg}, title={Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm}, year={1995} }","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","apa":"Bäumker, A., Dittrich, W., &#38; Meyer auf der Heide, F. (1995). Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F. Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_131\">10.1007/3-540-60313-1_131</a>","ieee":"A. Bäumker, W. Dittrich, and F. Meyer auf der Heide, “Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","chicago":"Bäumker, Armin, Wolfgang Dittrich, and Friedhelm Meyer auf der Heide. “Truly Efficient Parallel Algorithms: C-Optimal Multisearch for an Extension of the BSP Model.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_131\">https://doi.org/10.1007/3-540-60313-1_131</a>."},"_id":"16874","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public"},{"type":"book_editor","editor":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"B.","full_name":"Monien, B.","last_name":"Monien"},{"first_name":"A. L.","last_name":"Rosenberg","full_name":"Rosenberg, A. L."}],"status":"public","_id":"17477","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783540567318","9783540476375"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","year":"1993","citation":{"short":"F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.","bibtex":"@book{Meyer auf der Heide_Monien_Rosenberg_1993, place={Berlin, Heidelberg}, title={Parallel Architectures and Their Efficient Use}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>}, publisher={Springer}, year={1993} }","mla":"Meyer auf der Heide, Friedhelm, et al., editors. <i>Parallel Architectures and Their Efficient Use</i>. Springer, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>.","apa":"Meyer auf der Heide, F., Monien, B., &#38; Rosenberg, A. L. (Eds.). (1993). <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-56731-3\">https://doi.org/10.1007/3-540-56731-3</a>","chicago":"Meyer auf der Heide, Friedhelm, B. Monien, and A. L. Rosenberg, eds. <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993. <a href=\"https://doi.org/10.1007/3-540-56731-3\">https://doi.org/10.1007/3-540-56731-3</a>.","ieee":"F. Meyer auf der Heide, B. Monien, and A. L. Rosenberg, Eds., <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer, 1993.","ama":"Meyer auf der Heide F, Monien B, Rosenberg AL, eds. <i>Parallel Architectures and Their Efficient Use</i>. Berlin, Heidelberg: Springer; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3\">10.1007/3-540-56731-3</a>"},"publisher":"Springer","date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T09:49:20Z","title":"Parallel Architectures and Their Efficient Use","doi":"10.1007/3-540-56731-3"},{"publication_status":"published","publication_identifier":{"isbn":["9783540569398","9783540478263"],"issn":["0302-9743","1611-3349"]},"year":"1993","place":"Berlin, Heidelberg","citation":{"bibtex":"@inbook{Meyer auf der Heide_Oesterdiekhoff_Wanka_1993, place={Berlin, Heidelberg}, title={Strongly adaptive token distribution}, DOI={<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>}, booktitle={Automata, Languages and Programming}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1993} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” <i>Automata, Languages and Programming</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, Berlin, Heidelberg, 1993.","apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1993). Strongly adaptive token distribution. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56939-1_89\">https://doi.org/10.1007/3-540-56939-1_89</a>","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1993.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56939-1_89\">https://doi.org/10.1007/3-540-56939-1_89</a>.","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56939-1_89\">10.1007/3-540-56939-1_89</a>"},"date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T10:33:56Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"full_name":"Oesterdiekhoff, Brigitte","last_name":"Oesterdiekhoff","first_name":"Brigitte"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"title":"Strongly adaptive token distribution","doi":"10.1007/3-540-56939-1_89","type":"book_chapter","publication":"Automata, Languages and Programming","status":"public","_id":"16730","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"title":"Capabilities and complexity of computations with integer division","doi":"10.1007/3-540-56503-5_46","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:25:51Z","author":[{"first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"year":"1993","place":"Berlin, Heidelberg","citation":{"ieee":"K. Lürwer-Brüggemeier and F. Meyer auf der Heide, “Capabilities and complexity of computations with integer division,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1993.","chicago":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1993. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>.","ama":"Lürwer-Brüggemeier K, Meyer auf der Heide F. Capabilities and complexity of computations with integer division. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1993. doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>","bibtex":"@inbook{Lürwer-Brüggemeier_Meyer auf der Heide_1993, place={Berlin, Heidelberg}, title={Capabilities and complexity of computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>}, booktitle={Lecture Notes in Computer Science}, author={Lürwer-Brüggemeier, Katharina and Meyer auf der Heide, Friedhelm}, year={1993} }","mla":"Lürwer-Brüggemeier, Katharina, and Friedhelm Meyer auf der Heide. “Capabilities and Complexity of Computations with Integer Division.” <i>Lecture Notes in Computer Science</i>, 1993, doi:<a href=\"https://doi.org/10.1007/3-540-56503-5_46\">10.1007/3-540-56503-5_46</a>.","short":"K. Lürwer-Brüggemeier, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1993.","apa":"Lürwer-Brüggemeier, K., &#38; Meyer auf der Heide, F. (1993). Capabilities and complexity of computations with integer division. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56503-5_46\">https://doi.org/10.1007/3-540-56503-5_46</a>"},"publication_status":"published","publication_identifier":{"isbn":["9783540565031","9783540475743"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"_id":"16732","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science"},{"publication":"Data structures and efficient algorithms","type":"book_chapter","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"3046","publication_identifier":{"isbn":["9783540554882","9783540471035"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"1-24","citation":{"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} }","short":"H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.","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>.","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.","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>"},"place":"Berlin, Heidelberg","year":"1992","date_created":"2018-06-05T08:51:15Z","author":[{"first_name":"Helmut","last_name":"Alt","full_name":"Alt, Helmut"},{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_updated":"2022-01-06T06:58:54Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/3-540-55488-2_19","title":"Resemblance and symmetries of geometric patterns"},{"_id":"16733","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Data structures and efficient algorithms","status":"public","date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-20T11:27:50Z","title":"High performance universal hashing, with applications to shared memory simulations","doi":"10.1007/3-540-55488-2_31","publication_status":"published","publication_identifier":{"isbn":["9783540554882","9783540471035"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","year":"1992","citation":{"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>","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.","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>.","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>","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>.","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} }","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Data Structures and Efficient Algorithms, Berlin, Heidelberg, 1992."}},{"author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_created":"2020-04-20T11:29:58Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-56731-3_3","title":"Hashing strategies for simulating shared memory on distributed memory machines","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540567318","9783540476375"]},"citation":{"short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1992.","bibtex":"@inbook{Meyer auf der Heide_1992, place={Berlin, Heidelberg}, title={Hashing strategies for simulating shared memory on distributed memory machines}, DOI={<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1992} }","mla":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” <i>Lecture Notes in Computer Science</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>.","apa":"Meyer auf der Heide, F. (1992). Hashing strategies for simulating shared memory on distributed memory machines. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>","chicago":"Meyer auf der Heide, Friedhelm. “Hashing Strategies for Simulating Shared Memory on Distributed Memory Machines.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-56731-3_3\">https://doi.org/10.1007/3-540-56731-3_3</a>.","ieee":"F. Meyer auf der Heide, “Hashing strategies for simulating shared memory on distributed memory machines,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1992.","ama":"Meyer auf der Heide F. Hashing strategies for simulating shared memory on distributed memory machines. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-56731-3_3\">10.1007/3-540-56731-3_3</a>"},"place":"Berlin, Heidelberg","year":"1992","user_id":"15415","department":[{"_id":"63"}],"_id":"16734","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public"},{"title":"On the performance of networks with multiple busses","doi":"10.1007/3-540-55210-3_176","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-20T11:31:58Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Pham, Hieu Thien","last_name":"Pham","first_name":"Hieu Thien"}],"place":"Berlin, Heidelberg","year":"1992","citation":{"ama":"Meyer auf der Heide F, Pham HT. On the performance of networks with multiple busses. In: <i>STACS 92</i>. Berlin, Heidelberg; 1992. doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>","ieee":"F. Meyer auf der Heide and H. T. Pham, “On the performance of networks with multiple busses,” in <i>STACS 92</i>, Berlin, Heidelberg, 1992.","chicago":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” In <i>STACS 92</i>. Berlin, Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>.","apa":"Meyer auf der Heide, F., &#38; Pham, H. T. (1992). On the performance of networks with multiple busses. In <i>STACS 92</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55210-3_176\">https://doi.org/10.1007/3-540-55210-3_176</a>","mla":"Meyer auf der Heide, Friedhelm, and Hieu Thien Pham. “On the Performance of Networks with Multiple Busses.” <i>STACS 92</i>, 1992, doi:<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>.","short":"F. Meyer auf der Heide, H.T. Pham, in: STACS 92, Berlin, Heidelberg, 1992.","bibtex":"@inbook{Meyer auf der Heide_Pham_1992, place={Berlin, Heidelberg}, title={On the performance of networks with multiple busses}, DOI={<a href=\"https://doi.org/10.1007/3-540-55210-3_176\">10.1007/3-540-55210-3_176</a>}, booktitle={STACS 92}, author={Meyer auf der Heide, Friedhelm and Pham, Hieu Thien}, year={1992} }"},"publication_identifier":{"isbn":["9783540552109","9783540467755"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"16735","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"STACS 92","type":"book_chapter"},{"publication_identifier":{"isbn":["9783540508403","9783540460985"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1989","citation":{"ieee":"F. Meyer auf der Heide, “Computing minimum spanning forests on 1- and 2-dimensional processor arrays,” in <i>STACS 89</i>, Berlin, Heidelberg, 1989.","chicago":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” In <i>STACS 89</i>. Berlin, Heidelberg, 1989. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>.","ama":"Meyer auf der Heide F. Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In: <i>STACS 89</i>. Berlin, Heidelberg; 1989. doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>","apa":"Meyer auf der Heide, F. (1989). Computing minimum spanning forests on 1- and 2-dimensional processor arrays. In <i>STACS 89</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0028983\">https://doi.org/10.1007/bfb0028983</a>","bibtex":"@inbook{Meyer auf der Heide_1989, place={Berlin, Heidelberg}, title={Computing minimum spanning forests on 1- and 2-dimensional processor arrays}, DOI={<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>}, booktitle={STACS 89}, author={Meyer auf der Heide, Friedhelm}, year={1989} }","short":"F. Meyer auf der Heide, in: STACS 89, Berlin, Heidelberg, 1989.","mla":"Meyer auf der Heide, Friedhelm. “Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays.” <i>STACS 89</i>, 1989, doi:<a href=\"https://doi.org/10.1007/bfb0028983\">10.1007/bfb0028983</a>."},"date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-21T11:37:58Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Computing minimum spanning forests on 1- and 2-dimensional processor arrays","doi":"10.1007/bfb0028983","publication":"STACS 89","type":"book_chapter","status":"public","_id":"16789","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16767","status":"public","publication":"STACS 88","type":"book_chapter","doi":"10.1007/bfb0035829","title":"On computations with integer division","date_created":"2020-04-21T09:00:37Z","author":[{"first_name":"Bettina","last_name":"Just","full_name":"Just, Bettina"},{"full_name":"Mathematik, Fb","last_name":"Mathematik","first_name":"Fb"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Fb","last_name":"Informatik","full_name":"Informatik, Fb"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"date_updated":"2022-01-06T06:52:55Z","citation":{"apa":"Just, B., Mathematik, F., Meyer auf der Heide, F., Informatik, F., &#38; Wigderson, A. (1988). On computations with integer division. In <i>STACS 88</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0035829\">https://doi.org/10.1007/bfb0035829</a>","short":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, A. Wigderson, in: STACS 88, Berlin, Heidelberg, 1988.","bibtex":"@inbook{Just_Mathematik_Meyer auf der Heide_Informatik_Wigderson_1988, place={Berlin, Heidelberg}, title={On computations with integer division}, DOI={<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>}, booktitle={STACS 88}, author={Just, Bettina and Mathematik, Fb and Meyer auf der Heide, Friedhelm and Informatik, Fb and Wigderson, Avi}, year={1988} }","mla":"Just, Bettina, et al. “On Computations with Integer Division.” <i>STACS 88</i>, 1988, doi:<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>.","chicago":"Just, Bettina, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, and Avi Wigderson. “On Computations with Integer Division.” In <i>STACS 88</i>. Berlin, Heidelberg, 1988. <a href=\"https://doi.org/10.1007/bfb0035829\">https://doi.org/10.1007/bfb0035829</a>.","ieee":"B. Just, F. Mathematik, F. Meyer auf der Heide, F. Informatik, and A. Wigderson, “On computations with integer division,” in <i>STACS 88</i>, Berlin, Heidelberg, 1988.","ama":"Just B, Mathematik F, Meyer auf der Heide F, Informatik F, Wigderson A. On computations with integer division. In: <i>STACS 88</i>. Berlin, Heidelberg; 1988. doi:<a href=\"https://doi.org/10.1007/bfb0035829\">10.1007/bfb0035829</a>"},"place":"Berlin, Heidelberg","year":"1988","publication_identifier":{"isbn":["9783540188346","9783540481904"],"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"publication":"SWAT 88","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16768","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540194873","9783540392880"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"bibtex":"@inbook{Dietzfelbinger_Mehlhorn_Meyer auf der Heide_Rohnert_1988, place={Berlin, Heidelberg}, title={Upper and lower bounds for the dictionary problem}, DOI={<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>}, booktitle={SWAT 88}, author={Dietzfelbinger, M. and Mehlhorn, K. and Meyer auf der Heide, Friedhelm and Rohnert, H.}, year={1988} }","mla":"Dietzfelbinger, M., et al. “Upper and Lower Bounds for the Dictionary Problem.” <i>SWAT 88</i>, 1988, doi:<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>.","short":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, in: SWAT 88, Berlin, Heidelberg, 1988.","apa":"Dietzfelbinger, M., Mehlhorn, K., Meyer auf der Heide, F., &#38; Rohnert, H. (1988). Upper and lower bounds for the dictionary problem. In <i>SWAT 88</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-19487-8_24\">https://doi.org/10.1007/3-540-19487-8_24</a>","chicago":"Dietzfelbinger, M., K. Mehlhorn, Friedhelm Meyer auf der Heide, and H. Rohnert. “Upper and Lower Bounds for the Dictionary Problem.” In <i>SWAT 88</i>. Berlin, Heidelberg, 1988. <a href=\"https://doi.org/10.1007/3-540-19487-8_24\">https://doi.org/10.1007/3-540-19487-8_24</a>.","ieee":"M. Dietzfelbinger, K. Mehlhorn, F. Meyer auf der Heide, and H. Rohnert, “Upper and lower bounds for the dictionary problem,” in <i>SWAT 88</i>, Berlin, Heidelberg, 1988.","ama":"Dietzfelbinger M, Mehlhorn K, Meyer auf der Heide F, Rohnert H. Upper and lower bounds for the dictionary problem. In: <i>SWAT 88</i>. Berlin, Heidelberg; 1988. doi:<a href=\"https://doi.org/10.1007/3-540-19487-8_24\">10.1007/3-540-19487-8_24</a>"},"year":"1988","place":"Berlin, Heidelberg","date_created":"2020-04-21T09:01:36Z","author":[{"full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger","first_name":"M."},{"last_name":"Mehlhorn","full_name":"Mehlhorn, K.","first_name":"K."},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"H.","last_name":"Rohnert","full_name":"Rohnert, H."}],"date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-19487-8_24","title":"Upper and lower bounds for the dictionary problem"},{"date_updated":"2022-01-06T06:54:13Z","date_created":"2020-10-01T09:08:05Z","author":[{"first_name":"Hans Kleine","last_name":"Büning","full_name":"Büning, Hans Kleine"},{"full_name":"Lettmann, Theodor","id":"315","orcid":"0000-0001-5859-2457","last_name":"Lettmann","first_name":"Theodor"}],"title":"Representation independent query and update operations on propositional definite Horn formulas","doi":"10.1007/3-540-18170-9_167","publication_identifier":{"isbn":["9783540181705","9783540477952"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1987","page":"208-223","citation":{"chicago":"Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” In <i>Computation Theory and Logic</i>, edited by Egon Börger, 208–23. Berlin, Heidelberg, 1987. <a href=\"https://doi.org/10.1007/3-540-18170-9_167\">https://doi.org/10.1007/3-540-18170-9_167</a>.","ieee":"H. K. Büning and T. Lettmann, “Representation independent query and update operations on propositional definite Horn formulas,” in <i>Computation Theory and Logic</i>, E. Börger, Ed. Berlin, Heidelberg, 1987, pp. 208–223.","ama":"Büning HK, Lettmann T. Representation independent query and update operations on propositional definite Horn formulas. In: Börger E, ed. <i>Computation Theory and Logic</i>. Berlin, Heidelberg; 1987:208-223. doi:<a href=\"https://doi.org/10.1007/3-540-18170-9_167\">10.1007/3-540-18170-9_167</a>","apa":"Büning, H. K., &#38; Lettmann, T. (1987). Representation independent query and update operations on propositional definite Horn formulas. In E. Börger (Ed.), <i>Computation Theory and Logic</i> (pp. 208–223). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-18170-9_167\">https://doi.org/10.1007/3-540-18170-9_167</a>","mla":"Büning, Hans Kleine, and Theodor Lettmann. “Representation Independent Query and Update Operations on Propositional Definite Horn Formulas.” <i>Computation Theory and Logic</i>, edited by Egon Börger, 1987, pp. 208–23, doi:<a href=\"https://doi.org/10.1007/3-540-18170-9_167\">10.1007/3-540-18170-9_167</a>.","bibtex":"@inbook{Büning_Lettmann_1987, place={Berlin, Heidelberg}, title={Representation independent query and update operations on propositional definite Horn formulas}, DOI={<a href=\"https://doi.org/10.1007/3-540-18170-9_167\">10.1007/3-540-18170-9_167</a>}, booktitle={Computation Theory and Logic}, author={Büning, Hans Kleine and Lettmann, Theodor}, editor={Börger, EgonEditor}, year={1987}, pages={208–223} }","short":"H.K. Büning, T. Lettmann, in: E. Börger (Ed.), Computation Theory and Logic, Berlin, Heidelberg, 1987, pp. 208–223."},"_id":"19821","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"user_id":"315","language":[{"iso":"eng"}],"publication":"Computation Theory and Logic","type":"book_chapter","editor":[{"last_name":"Börger","full_name":"Börger, Egon","first_name":"Egon"}],"status":"public"},{"user_id":"315","department":[{"_id":"34"},{"_id":"355"},{"_id":"7"}],"_id":"19819","language":[{"iso":"eng"}],"type":"book_chapter","publication":"8th International Conference on Automated Deduction","status":"public","date_created":"2020-10-01T08:56:14Z","author":[{"last_name":"Kleine Büning","full_name":"Kleine Büning, H.","first_name":"H."},{"full_name":"Lettmann, Theodor","id":"315","orcid":"0000-0001-5859-2457","last_name":"Lettmann","first_name":"Theodor"}],"date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/3-540-16780-3_119","title":"Classes of first order formulas under various satisfiability definitions","publication_status":"published","publication_identifier":{"isbn":["9783540167808","9783540398615"],"issn":["0302-9743","1611-3349"]},"citation":{"short":"H. Kleine Büning, T. Lettmann, in: 8th International Conference on Automated Deduction, Berlin, Heidelberg, 1986.","mla":"Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” <i>8th International Conference on Automated Deduction</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16780-3_119\">10.1007/3-540-16780-3_119</a>.","bibtex":"@inbook{Kleine Büning_Lettmann_1986, place={Berlin, Heidelberg}, title={Classes of first order formulas under various satisfiability definitions}, DOI={<a href=\"https://doi.org/10.1007/3-540-16780-3_119\">10.1007/3-540-16780-3_119</a>}, booktitle={8th International Conference on Automated Deduction}, author={Kleine Büning, H. and Lettmann, Theodor}, year={1986} }","apa":"Kleine Büning, H., &#38; Lettmann, T. (1986). Classes of first order formulas under various satisfiability definitions. In <i>8th International Conference on Automated Deduction</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16780-3_119\">https://doi.org/10.1007/3-540-16780-3_119</a>","ieee":"H. Kleine Büning and T. Lettmann, “Classes of first order formulas under various satisfiability definitions,” in <i>8th International Conference on Automated Deduction</i>, Berlin, Heidelberg, 1986.","chicago":"Kleine Büning, H., and Theodor Lettmann. “Classes of First Order Formulas under Various Satisfiability Definitions.” In <i>8th International Conference on Automated Deduction</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16780-3_119\">https://doi.org/10.1007/3-540-16780-3_119</a>.","ama":"Kleine Büning H, Lettmann T. Classes of first order formulas under various satisfiability definitions. In: <i>8th International Conference on Automated Deduction</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16780-3_119\">10.1007/3-540-16780-3_119</a>"},"place":"Berlin, Heidelberg","year":"1986"},{"publication":"Automata, Languages and Programming","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"16774","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540167617","9783540398592"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ama":"Borodin A, Fich FE, Meyer auf der Heide F, Upfal E, Wigderson A. A tradeoff between search and update time for the implicit dictionary problem. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>","chicago":"Borodin, Allan, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, and Avi Wigderson. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16761-7_54\">https://doi.org/10.1007/3-540-16761-7_54</a>.","ieee":"A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A tradeoff between search and update time for the implicit dictionary problem,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 1986.","apa":"Borodin, A., Fich, F. E., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1986). A tradeoff between search and update time for the implicit dictionary problem. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16761-7_54\">https://doi.org/10.1007/3-540-16761-7_54</a>","short":"A. Borodin, F.E. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: Automata, Languages and Programming, Berlin, Heidelberg, 1986.","mla":"Borodin, Allan, et al. “A Tradeoff between Search and Update Time for the Implicit Dictionary Problem.” <i>Automata, Languages and Programming</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>.","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A tradeoff between search and update time for the implicit dictionary problem}, DOI={<a href=\"https://doi.org/10.1007/3-540-16761-7_54\">10.1007/3-540-16761-7_54</a>}, booktitle={Automata, Languages and Programming}, author={Borodin, Allan and Fich, Faith E. and Meyer auf der Heide, Friedhelm and Upfal, Eli and Wigderson, Avi}, year={1986} }"},"place":"Berlin, Heidelberg","year":"1986","author":[{"first_name":"Allan","last_name":"Borodin","full_name":"Borodin, Allan"},{"first_name":"Faith E.","full_name":"Fich, Faith E.","last_name":"Fich"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Upfal, Eli","last_name":"Upfal","first_name":"Eli"},{"first_name":"Avi","full_name":"Wigderson, Avi","last_name":"Wigderson"}],"date_created":"2020-04-21T10:05:54Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-16761-7_54","title":"A tradeoff between search and update time for the implicit dictionary problem"},{"author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-21T10:07:06Z","date_updated":"2022-01-06T06:52:55Z","doi":"10.1007/3-540-16078-7_72","title":"Speeding up random access machines by few processors","publication_identifier":{"isbn":["9783540160786","9783540397588"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"short":"F. Meyer auf der Heide, in: STACS 86, Berlin, Heidelberg, 1986.","bibtex":"@inbook{Meyer auf der Heide_1986, place={Berlin, Heidelberg}, title={Speeding up random access machines by few processors}, DOI={<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>}, booktitle={STACS 86}, author={Meyer auf der Heide, Friedhelm}, year={1986} }","mla":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” <i>STACS 86</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>.","apa":"Meyer auf der Heide, F. (1986). Speeding up random access machines by few processors. In <i>STACS 86</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16078-7_72\">https://doi.org/10.1007/3-540-16078-7_72</a>","ama":"Meyer auf der Heide F. Speeding up random access machines by few processors. In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_72\">10.1007/3-540-16078-7_72</a>","ieee":"F. Meyer auf der Heide, “Speeding up random access machines by few processors,” in <i>STACS 86</i>, Berlin, Heidelberg, 1986.","chicago":"Meyer auf der Heide, Friedhelm. “Speeding up Random Access Machines by Few Processors.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16078-7_72\">https://doi.org/10.1007/3-540-16078-7_72</a>."},"year":"1986","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"user_id":"15415","_id":"16775","language":[{"iso":"eng"}],"publication":"STACS 86","type":"book_chapter","status":"public"},{"doi":"10.1007/3-540-16078-7_89","title":"A time-space tradeoff for element distinctness","date_created":"2020-04-21T10:08:23Z","author":[{"first_name":"A.","full_name":"Borodin, A.","last_name":"Borodin"},{"last_name":"Fich","full_name":"Fich, F.","first_name":"F."},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Upfal","full_name":"Upfal, E.","first_name":"E."},{"full_name":"Wigderson, A.","last_name":"Wigderson","first_name":"A."}],"date_updated":"2022-01-06T06:52:55Z","citation":{"apa":"Borodin, A., Fich, F., Meyer auf der Heide, F., Upfal, E., &#38; Wigderson, A. (1986). A time-space tradeoff for element distinctness. In <i>STACS 86</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-16078-7_89\">https://doi.org/10.1007/3-540-16078-7_89</a>","bibtex":"@inbook{Borodin_Fich_Meyer auf der Heide_Upfal_Wigderson_1986, place={Berlin, Heidelberg}, title={A time-space tradeoff for element distinctness}, DOI={<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>}, booktitle={STACS 86}, author={Borodin, A. and Fich, F. and Meyer auf der Heide, Friedhelm and Upfal, E. and Wigderson, A.}, year={1986} }","mla":"Borodin, A., et al. “A Time-Space Tradeoff for Element Distinctness.” <i>STACS 86</i>, 1986, doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>.","short":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson, in: STACS 86, Berlin, Heidelberg, 1986.","ieee":"A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson, “A time-space tradeoff for element distinctness,” in <i>STACS 86</i>, Berlin, Heidelberg, 1986.","chicago":"Borodin, A., F. Fich, Friedhelm Meyer auf der Heide, E. Upfal, and A. Wigderson. “A Time-Space Tradeoff for Element Distinctness.” In <i>STACS 86</i>. Berlin, Heidelberg, 1986. <a href=\"https://doi.org/10.1007/3-540-16078-7_89\">https://doi.org/10.1007/3-540-16078-7_89</a>.","ama":"Borodin A, Fich F, Meyer auf der Heide F, Upfal E, Wigderson A. A time-space tradeoff for element distinctness. In: <i>STACS 86</i>. Berlin, Heidelberg; 1986. doi:<a href=\"https://doi.org/10.1007/3-540-16078-7_89\">10.1007/3-540-16078-7_89</a>"},"place":"Berlin, Heidelberg","year":"1986","publication_identifier":{"isbn":["9783540160786","9783540397588"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16776","status":"public","publication":"STACS 86","type":"book_chapter"},{"_id":"16787","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"STACS 84","status":"public","date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-21T11:28:40Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"title":"Efficient simulations among several models of parallel computers (extended abstract)","doi":"10.1007/3-540-12920-0_20","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540129202","9783540388050"]},"year":"1984","place":"Berlin, Heidelberg","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” In <i>STACS 84</i>. Berlin, Heidelberg, 1984. <a href=\"https://doi.org/10.1007/3-540-12920-0_20\">https://doi.org/10.1007/3-540-12920-0_20</a>.","ieee":"F. Meyer auf der Heide, “Efficient simulations among several models of parallel computers (extended abstract),” in <i>STACS 84</i>, Berlin, Heidelberg, 1984.","ama":"Meyer auf der Heide F. Efficient simulations among several models of parallel computers (extended abstract). In: <i>STACS 84</i>. Berlin, Heidelberg; 1984. doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>","apa":"Meyer auf der Heide, F. (1984). Efficient simulations among several models of parallel computers (extended abstract). In <i>STACS 84</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-12920-0_20\">https://doi.org/10.1007/3-540-12920-0_20</a>","bibtex":"@inbook{Meyer auf der Heide_1984, place={Berlin, Heidelberg}, title={Efficient simulations among several models of parallel computers (extended abstract)}, DOI={<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>}, booktitle={STACS 84}, author={Meyer auf der Heide, Friedhelm}, year={1984} }","short":"F. Meyer auf der Heide, in: STACS 84, Berlin, Heidelberg, 1984.","mla":"Meyer auf der Heide, Friedhelm. “Efficient Simulations among Several Models of Parallel Computers (Extended Abstract).” <i>STACS 84</i>, 1984, doi:<a href=\"https://doi.org/10.1007/3-540-12920-0_20\">10.1007/3-540-12920-0_20</a>."}},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16813","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Fundamentals of Computation Theory","status":"public","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Anton","full_name":"Rollik, Anton","last_name":"Rollik"}],"date_created":"2020-04-22T09:03:21Z","date_updated":"2022-01-06T06:52:56Z","doi":"10.1007/3-540-10854-8_29","title":"Random access machines and straight-line programs","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540108542","9783540387657"]},"citation":{"mla":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” <i>Fundamentals of Computation Theory</i>, 1981, doi:<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>.","bibtex":"@inbook{Meyer auf der Heide_Rollik_1981, place={Berlin, Heidelberg}, title={Random access machines and straight-line programs}, DOI={<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>}, booktitle={Fundamentals of Computation Theory}, author={Meyer auf der Heide, Friedhelm and Rollik, Anton}, year={1981} }","short":"F. Meyer auf der Heide, A. Rollik, in: Fundamentals of Computation Theory, Berlin, Heidelberg, 1981.","apa":"Meyer auf der Heide, F., &#38; Rollik, A. (1981). Random access machines and straight-line programs. In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-10854-8_29\">https://doi.org/10.1007/3-540-10854-8_29</a>","ama":"Meyer auf der Heide F, Rollik A. Random access machines and straight-line programs. In: <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg; 1981. doi:<a href=\"https://doi.org/10.1007/3-540-10854-8_29\">10.1007/3-540-10854-8_29</a>","ieee":"F. Meyer auf der Heide and A. Rollik, “Random access machines and straight-line programs,” in <i>Fundamentals of Computation Theory</i>, Berlin, Heidelberg, 1981.","chicago":"Meyer auf der Heide, Friedhelm, and Anton Rollik. “Random Access Machines and Straight-Line Programs.” In <i>Fundamentals of Computation Theory</i>. Berlin, Heidelberg, 1981. <a href=\"https://doi.org/10.1007/3-540-10854-8_29\">https://doi.org/10.1007/3-540-10854-8_29</a>."},"year":"1981","place":"Berlin, Heidelberg"},{"publication_status":"published","publication_identifier":{"isbn":["9783540108566","9783540387695"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","year":"1981","citation":{"mla":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” <i>Lecture Notes in Computer Science</i>, 1981, doi:<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>.","bibtex":"@inbook{Meyer auf der Heide_1981, place={Berlin, Heidelberg}, title={Time-processor trade-offs for universal parallel computers}, DOI={<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>}, booktitle={Lecture Notes in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={1981} }","short":"F. Meyer auf der Heide, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1981.","apa":"Meyer auf der Heide, F. (1981). Time-processor trade-offs for universal parallel computers. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-10856-4_111\">https://doi.org/10.1007/3-540-10856-4_111</a>","chicago":"Meyer auf der Heide, Friedhelm. “Time-Processor Trade-Offs for Universal Parallel Computers.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1981. <a href=\"https://doi.org/10.1007/3-540-10856-4_111\">https://doi.org/10.1007/3-540-10856-4_111</a>.","ieee":"F. Meyer auf der Heide, “Time-processor trade-offs for universal parallel computers,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1981.","ama":"Meyer auf der Heide F. Time-processor trade-offs for universal parallel computers. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1981. doi:<a href=\"https://doi.org/10.1007/3-540-10856-4_111\">10.1007/3-540-10856-4_111</a>"},"date_updated":"2022-01-06T06:52:56Z","date_created":"2020-04-22T09:05:15Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"title":"Time-processor trade-offs for universal parallel computers","doi":"10.1007/3-540-10856-4_111","type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","_id":"16814","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]}]