[{"date_updated":"2022-01-06T06:54:09Z","intvolume":"         6","title":"Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher","status":"public","year":"1995","publication_identifier":{"isbn":["3-931466-05-1"]},"author":[{"first_name":"Alf","last_name":"Wachsmann","full_name":"Wachsmann, Alf"}],"user_id":"5786","volume":6,"_id":"19630","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","supervisor":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"citation":{"chicago":"Wachsmann, Alf. <i>Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher</i>. Vol. 6. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","short":"A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","ieee":"A. Wachsmann, <i>Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher</i>, vol. 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Wachsmann, A. (1995). <i>Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher</i> (Vol. 6). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","bibtex":"@book{Wachsmann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher}, volume={6}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Wachsmann, Alf}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Wachsmann A. <i>Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher</i>. Vol 6. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","mla":"Wachsmann, Alf. <i>Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995."},"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-22T12:40:46Z"},{"date_created":"2020-09-22T12:50:36Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"citation":{"mla":"Ameur, Foued. <i>Space-Bounded Learning Algorithms</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","bibtex":"@book{Ameur_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Space-Bounded Learning Algorithms}, volume={10}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Ameur, Foued}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Ameur F. <i>Space-Bounded Learning Algorithms</i>. Vol 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","ieee":"F. Ameur, <i>Space-Bounded Learning Algorithms</i>, vol. 10. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Ameur, F. (1995). <i>Space-Bounded Learning Algorithms</i> (Vol. 10). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","short":"F. Ameur, Space-Bounded Learning Algorithms, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","chicago":"Ameur, Foued. <i>Space-Bounded Learning Algorithms</i>. Vol. 10. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995."},"language":[{"iso":"eng"}],"_id":"19634","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","volume":10,"user_id":"5786","author":[{"full_name":"Ameur, Foued","first_name":"Foued","last_name":"Ameur"}],"publication_identifier":{"isbn":["3-931466-09-4"]},"title":"Space-Bounded Learning Algorithms","status":"public","year":"1995","intvolume":"        10","date_updated":"2022-01-06T06:54:09Z"},{"date_updated":"2022-01-06T06:53:12Z","year":"1995","status":"public","title":"Simulating shared memory in real time: On the computation power of reconfigurable meshes","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"user_id":"15415","page":"46--59","_id":"17482","language":[{"iso":"eng"}],"publication":"Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures","citation":{"chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” In <i>Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures</i>, 46--59, 1995.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, pp. 46--59.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Simulating shared memory in real time: On the computation power of reconfigurable meshes. In <i>Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures</i> (pp. 46--59).","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Simulating shared memory in real time: On the computation power of reconfigurable meshes,” in <i>Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures</i>, 1995, pp. 46--59.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Simulating shared memory in real time: On the computation power of reconfigurable meshes. In: <i>Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures</i>. ; 1995:46--59.","bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Simulating shared memory in real time: On the computation power of reconfigurable meshes}, booktitle={Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995}, pages={46--59} }","mla":"Czumaj, Artur, et al. “Simulating Shared Memory in Real Time: On the Computation Power of Reconfigurable Meshes.” <i>Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures</i>, 1995, pp. 46--59."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-07-30T14:09:45Z"},{"date_updated":"2022-01-06T06:55:18Z","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792"}],"title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks","year":"1995","doi":"10.1007/3-540-60313-1_154","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","publication":"ESA","department":[{"_id":"79"},{"_id":"63"}],"type":"conference","date_created":"2018-04-03T09:40:55Z","file":[{"creator":"florida","date_created":"2018-04-12T06:57:17Z","file_name":"ESA95.pdf","access_level":"open_access","file_size":177256,"relation":"main_file","date_updated":"2018-04-12T07:09:35Z","file_id":"2279","content_type":"application/pdf"}],"has_accepted_license":"1","status":"public","user_id":"14955","ddc":["040"],"_id":"2187","urn":"21878","page":"341--354","citation":{"ama":"Meyer auf der Heide F, Scheideler C. Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In: <i>ESA</i>. Lecture Notes in Computer Science. ; 1995:341--354. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_154\">10.1007/3-540-60313-1_154</a>","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, series={Lecture Notes in Computer Science}, title={Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_154\">10.1007/3-540-60313-1_154</a>}, booktitle={ESA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={341--354}, collection={Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” <i>ESA</i>, 1995, pp. 341--354, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_154\">10.1007/3-540-60313-1_154</a>.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks.” In <i>ESA</i>, 341--354. Lecture Notes in Computer Science, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_154\">https://doi.org/10.1007/3-540-60313-1_154</a>.","short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks. In <i>ESA</i> (pp. 341--354). <a href=\"https://doi.org/10.1007/3-540-60313-1_154\">https://doi.org/10.1007/3-540-60313-1_154</a>","ieee":"F. Meyer auf der Heide and C. Scheideler, “Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks,” in <i>ESA</i>, 1995, pp. 341--354."},"file_date_updated":"2018-04-12T07:09:35Z","oa":"1"},{"has_accepted_license":"1","date_updated":"2022-01-06T06:55:24Z","author":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"}],"status":"public","title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","year":"1995","user_id":"14955","ddc":["040"],"_id":"2207","urn":"22075","language":[{"iso":"eng"}],"page":"137--146","citation":{"mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” <i>SPAA</i>, 1995, pp. 137--146.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1995, title={Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)}, booktitle={SPAA}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1995}, pages={137--146} }","ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: <i>SPAA</i>. ; 1995:137--146.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract),” in <i>SPAA</i>, 1995, pp. 137--146.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1995). Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In <i>SPAA</i> (pp. 137--146).","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract).” In <i>SPAA</i>, 137--146, 1995.","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 1995, pp. 137--146."},"file_date_updated":"2018-04-12T07:09:52Z","publication":"SPAA","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","date_created":"2018-04-04T12:43:41Z","file":[{"file_name":"SPAA95.pdf","file_size":284222,"access_level":"open_access","relation":"main_file","date_updated":"2018-04-12T07:09:52Z","file_id":"2278","content_type":"application/pdf","creator":"florida","date_created":"2018-04-12T06:56:32Z"}]},{"language":[{"iso":"eng"}],"_id":"2208","urn":"22085","page":"267--278","user_id":"14955","ddc":["040"],"author":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","full_name":"Scheideler, Christian","first_name":"Christian","last_name":"Scheideler"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"status":"public","year":"1995","title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","has_accepted_license":"1","date_updated":"2022-01-06T06:55:24Z","date_created":"2018-04-04T12:44:26Z","file":[{"date_created":"2018-04-12T06:54:40Z","creator":"florida","content_type":"application/pdf","file_id":"2277","date_updated":"2018-04-12T07:09:13Z","relation":"main_file","access_level":"open_access","file_size":407467,"file_name":"STACS95.pdf"}],"department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","citation":{"bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_Stemann_1995, title={Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations}, booktitle={STACS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1995}, pages={267--278} }","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In: <i>STACS</i>. ; 1995:267--278.","mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” <i>STACS</i>, 1995, pp. 267--278.","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations.” In <i>STACS</i>, 267--278, 1995.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 1995, pp. 267--278.","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations,” in <i>STACS</i>, 1995, pp. 267--278.","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1995). Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations. In <i>STACS</i> (pp. 267--278)."},"file_date_updated":"2018-04-12T07:09:13Z","publication":"STACS"},{"citation":{"short":"D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110.","ama":"Breslauer D, Czumaj A, Dubhashi DP, Meyer auf der Heide F. Transforming comparison model lower bounds to the parallel-random-access-machine. <i>Information Processing Letters</i>. 1995:103-110. doi:<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>","chicago":"Breslauer, Dany, Artur Czumaj, Devdatt P. Dubhashi, and Friedhelm Meyer auf der Heide. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995, 103–10. <a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">https://doi.org/10.1016/s0020-0190(97)00032-x</a>.","bibtex":"@article{Breslauer_Czumaj_Dubhashi_Meyer auf der Heide_1995, title={Transforming comparison model lower bounds to the parallel-random-access-machine}, DOI={<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>}, journal={Information Processing Letters}, author={Breslauer, Dany and Czumaj, Artur and Dubhashi, Devdatt P. and Meyer auf der Heide, Friedhelm}, year={1995}, pages={103–110} }","mla":"Breslauer, Dany, et al. “Transforming Comparison Model Lower Bounds to the Parallel-Random-Access-Machine.” <i>Information Processing Letters</i>, 1995, pp. 103–10, doi:<a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">10.1016/s0020-0190(97)00032-x</a>.","apa":"Breslauer, D., Czumaj, A., Dubhashi, D. P., &#38; Meyer auf der Heide, F. (1995). Transforming comparison model lower bounds to the parallel-random-access-machine. <i>Information Processing Letters</i>, 103–110. <a href=\"https://doi.org/10.1016/s0020-0190(97)00032-x\">https://doi.org/10.1016/s0020-0190(97)00032-x</a>","ieee":"D. Breslauer, A. Czumaj, D. P. Dubhashi, and F. Meyer auf der Heide, “Transforming comparison model lower bounds to the parallel-random-access-machine,” <i>Information Processing Letters</i>, pp. 103–110, 1995."},"publication":"Information Processing Letters","date_created":"2020-04-15T11:28:35Z","department":[{"_id":"63"}],"type":"journal_article","author":[{"full_name":"Breslauer, Dany","last_name":"Breslauer","first_name":"Dany"},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"},{"first_name":"Devdatt P.","last_name":"Dubhashi","full_name":"Dubhashi, Devdatt P."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"publication_identifier":{"issn":["0020-0190"]},"status":"public","year":"1995","title":"Transforming comparison model lower bounds to the parallel-random-access-machine","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","_id":"16566","language":[{"iso":"eng"}],"page":"103-110","doi":"10.1016/s0020-0190(97)00032-x","user_id":"15415"},{"title":"A packet routing protocol for arbitrary networks","status":"public","year":"1995","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540590422","9783540491750"]},"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","language":[{"iso":"eng"}],"_id":"16704","user_id":"15415","doi":"10.1007/3-540-59042-0_81","publication":"STACS 95","citation":{"bibtex":"@inbook{Meyer auf der Heide_Vöcking_1995, place={Berlin, Heidelberg}, title={A packet routing protocol for arbitrary networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>}, booktitle={STACS 95}, author={Meyer auf der Heide, Friedhelm and Vöcking, Berthold}, year={1995} }","ama":"Meyer auf der Heide F, Vöcking B. A packet routing protocol for arbitrary networks. In: <i>STACS 95</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>","mla":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” <i>STACS 95</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-59042-0_81\">10.1007/3-540-59042-0_81</a>.","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995.","chicago":"Meyer auf der Heide, Friedhelm, and Berthold Vöcking. “A Packet Routing Protocol for Arbitrary Networks.” In <i>STACS 95</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>.","ieee":"F. Meyer auf der Heide and B. Vöcking, “A packet routing protocol for arbitrary networks,” in <i>STACS 95</i>, Berlin, Heidelberg, 1995.","apa":"Meyer auf der Heide, F., &#38; Vöcking, B. (1995). A packet routing protocol for arbitrary networks. In <i>STACS 95</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-59042-0_81\">https://doi.org/10.1007/3-540-59042-0_81</a>"},"date_created":"2020-04-16T13:36:32Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}]},{"department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-16T13:40:52Z","place":"Berlin, Heidelberg","citation":{"apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Shared memory simulations with triple-logarithmic delay. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>","mla":"Czumaj, Artur, et al. “Shared Memory Simulations with Triple-Logarithmic Delay.” <i>Lecture Notes in Computer Science</i>, 1995, doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>.","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Shared memory simulations with triple-logarithmic delay,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Shared Memory Simulations with Triple-Logarithmic Delay.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 1995. <a href=\"https://doi.org/10.1007/3-540-60313-1_133\">https://doi.org/10.1007/3-540-60313-1_133</a>.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Shared memory simulations with triple-logarithmic delay. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1995. doi:<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","bibtex":"@inbook{Czumaj_Meyer auf der Heide_Stemann_1995, place={Berlin, Heidelberg}, title={Shared memory simulations with triple-logarithmic delay}, DOI={<a href=\"https://doi.org/10.1007/3-540-60313-1_133\">10.1007/3-540-60313-1_133</a>}, booktitle={Lecture Notes in Computer Science}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }"},"publication":"Lecture Notes in Computer Science","user_id":"15415","doi":"10.1007/3-540-60313-1_133","_id":"16705","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"year":"1995","status":"public","title":"Shared memory simulations with triple-logarithmic delay"},{"publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95","citation":{"ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal trade-offs between size and slowdown for universal parallel networks,” in <i>Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95</i>, 1995.","apa":"Meyer auf der Heide, F., Storch, M., &#38; Wanka, R. (1995). Optimal trade-offs between size and slowdown for universal parallel networks. In <i>Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95</i>. <a href=\"https://doi.org/10.1145/215399.215430\">https://doi.org/10.1145/215399.215430</a>","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, in: Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95, 1995.","chicago":"Meyer auf der Heide, Friedhelm, Martin Storch, and Rolf Wanka. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” In <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>, 1995. <a href=\"https://doi.org/10.1145/215399.215430\">https://doi.org/10.1145/215399.215430</a>.","mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Trade-Offs between Size and Slowdown for Universal Parallel Networks.” <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>, 1995, doi:<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>.","bibtex":"@inproceedings{Meyer auf der Heide_Storch_Wanka_1995, title={Optimal trade-offs between size and slowdown for universal parallel networks}, DOI={<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>}, booktitle={Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA ’95}, author={Meyer auf der Heide, Friedhelm and Storch, Martin and Wanka, Rolf}, year={1995} }","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal trade-offs between size and slowdown for universal parallel networks. In: <i>Proceedings of the Seventh Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’95</i>. ; 1995. doi:<a href=\"https://doi.org/10.1145/215399.215430\">10.1145/215399.215430</a>"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T13:47:15Z","date_updated":"2022-01-06T06:52:54Z","publication_status":"published","status":"public","title":"Optimal trade-offs between size and slowdown for universal parallel networks","year":"1995","publication_identifier":{"isbn":["0897917170"]},"author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"full_name":"Storch, Martin","last_name":"Storch","first_name":"Martin"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"doi":"10.1145/215399.215430","user_id":"15415","language":[{"iso":"eng"}],"_id":"16706"},{"publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","citation":{"short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.","chicago":"Czumaj, Artur, Friedhelm Meyer auf der Heide, and Volker Stemann. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” In <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>.","apa":"Czumaj, A., Meyer auf der Heide, F., &#38; Stemann, V. (1995). Improved optimal shared memory simulations, and the power of reconfiguration. <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. <a href=\"https://doi.org/10.1109/istcs.1995.377051\">https://doi.org/10.1109/istcs.1995.377051</a>","ieee":"A. Czumaj, F. Meyer auf der Heide, and V. Stemann, “Improved optimal shared memory simulations, and the power of reconfiguration,” 1995, doi: <a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>.","ama":"Czumaj A, Meyer auf der Heide F, Stemann V. Improved optimal shared memory simulations, and the power of reconfiguration. In: <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>. ; 1995. doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>","bibtex":"@inproceedings{Czumaj_Meyer auf der Heide_Stemann_1995, title={Improved optimal shared memory simulations, and the power of reconfiguration}, DOI={<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>}, booktitle={Proceedings Third Israel Symposium on the Theory of Computing and Systems}, author={Czumaj, Artur and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1995} }","mla":"Czumaj, Artur, et al. “Improved Optimal Shared Memory Simulations, and the Power of Reconfiguration.” <i>Proceedings Third Israel Symposium on the Theory of Computing and Systems</i>, 1995, doi:<a href=\"https://doi.org/10.1109/istcs.1995.377051\">10.1109/istcs.1995.377051</a>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T13:49:13Z","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","status":"public","title":"Improved optimal shared memory simulations, and the power of reconfiguration","year":"1995","author":[{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"isbn":["0818669152"]},"user_id":"15415","doi":"10.1109/istcs.1995.377051","_id":"16707","language":[{"iso":"eng"}]},{"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Westermann, Matthias","last_name":"Westermann","first_name":"Matthias"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540606185","9783540484875"]},"title":"Hot-potato routing on multi-dimensional tori","year":"1995","status":"public","user_id":"15415","doi":"10.1007/3-540-60618-1_77","_id":"16717","language":[{"iso":"eng"}],"citation":{"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>.","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>","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} }","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>","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.","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>.","short":"F. Meyer auf der Heide, M. Westermann, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 1995."},"publication":"Graph-Theoretic Concepts in Computer Science","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-17T07:46:18Z","place":"Berlin, Heidelberg"},{"publication_status":"published","date_updated":"2022-01-06T06:52:58Z","status":"public","title":"Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model","year":"1995","author":[{"last_name":"Bäumker","first_name":"Armin","full_name":"Bäumker, Armin"},{"full_name":"Dittrich, Wolfgang","first_name":"Wolfgang","last_name":"Dittrich"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540603139","9783540449133"]},"user_id":"15415","doi":"10.1007/3-540-60313-1_131","language":[{"iso":"eng"}],"_id":"16874","publication":"Lecture Notes in Computer Science","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>.","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>","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} }","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>","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.","short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, in: Lecture Notes in Computer Science, 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>."},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-04-27T13:59:05Z","place":"Berlin, Heidelberg"},{"file_date_updated":"2020-09-22T12:32:33Z","supervisor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"citation":{"ama":"Wanka R. <i>Paralleles Sortieren Auf Mehrdimensionalen Gittern</i>. Universität Paderborn; 1994.","bibtex":"@book{Wanka_1994, place={Universität Paderborn}, title={Paralleles Sortieren auf mehrdimensionalen Gittern}, author={Wanka, Rolf}, year={1994} }","mla":"Wanka, Rolf. <i>Paralleles Sortieren Auf Mehrdimensionalen Gittern</i>. 1994.","chicago":"Wanka, Rolf. <i>Paralleles Sortieren Auf Mehrdimensionalen Gittern</i>. Universität Paderborn, 1994.","short":"R. Wanka, Paralleles Sortieren Auf Mehrdimensionalen Gittern, Universität Paderborn, 1994.","apa":"Wanka, R. (1994). <i>Paralleles Sortieren auf mehrdimensionalen Gittern</i>. Universität Paderborn.","ieee":"R. Wanka, <i>Paralleles Sortieren auf mehrdimensionalen Gittern</i>. Universität Paderborn, 1994."},"file":[{"creator":"koala","date_created":"2020-09-22T12:32:33Z","relation":"main_file","date_updated":"2020-09-22T12:32:33Z","file_name":"pub-hni-9686.pdf","file_size":967735,"access_level":"closed","file_id":"19625","success":1,"content_type":"application/pdf"}],"place":"Universität Paderborn","date_created":"2020-09-22T12:32:48Z","type":"dissertation","department":[{"_id":"63"}],"title":"Paralleles Sortieren auf mehrdimensionalen Gittern","status":"public","year":"1994","author":[{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"date_updated":"2022-01-06T06:54:09Z","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"19624","ddc":["000"],"user_id":"15415"},{"page":"738-761","_id":"16728","language":[{"iso":"eng"}],"doi":"10.1137/s0097539791194094","user_id":"15415","status":"public","title":"Dynamic Perfect Hashing: Upper and Lower Bounds","year":"1994","publication_identifier":{"issn":["0097-5397","1095-7111"]},"author":[{"first_name":"Martin","last_name":"Dietzfelbinger","full_name":"Dietzfelbinger, Martin"},{"full_name":"Karlin, Anna","last_name":"Karlin","first_name":"Anna"},{"last_name":"Mehlhorn","first_name":"Kurt","full_name":"Mehlhorn, Kurt"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Rohnert, Hans","first_name":"Hans","last_name":"Rohnert"},{"first_name":"Robert E.","last_name":"Tarjan","full_name":"Tarjan, Robert E."}],"date_updated":"2022-01-06T06:52:55Z","publication_status":"published","date_created":"2020-04-20T10:19:33Z","type":"journal_article","department":[{"_id":"63"}],"publication":"SIAM Journal on Computing","citation":{"mla":"Dietzfelbinger, Martin, et al. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>SIAM Journal on Computing</i>, 1994, pp. 738–61, doi:<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>.","ama":"Dietzfelbinger M, Karlin A, Mehlhorn K, Meyer auf der Heide F, Rohnert H, Tarjan RE. Dynamic Perfect Hashing: Upper and Lower Bounds. <i>SIAM Journal on Computing</i>. 1994:738-761. doi:<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>","bibtex":"@article{Dietzfelbinger_Karlin_Mehlhorn_Meyer auf der Heide_Rohnert_Tarjan_1994, title={Dynamic Perfect Hashing: Upper and Lower Bounds}, DOI={<a href=\"https://doi.org/10.1137/s0097539791194094\">10.1137/s0097539791194094</a>}, journal={SIAM Journal on Computing}, author={Dietzfelbinger, Martin and Karlin, Anna and Mehlhorn, Kurt and Meyer auf der Heide, Friedhelm and Rohnert, Hans and Tarjan, Robert E.}, year={1994}, pages={738–761} }","apa":"Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., &#38; Tarjan, R. E. (1994). Dynamic Perfect Hashing: Upper and Lower Bounds. <i>SIAM Journal on Computing</i>, 738–761. <a href=\"https://doi.org/10.1137/s0097539791194094\">https://doi.org/10.1137/s0097539791194094</a>","ieee":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan, “Dynamic Perfect Hashing: Upper and Lower Bounds,” <i>SIAM Journal on Computing</i>, pp. 738–761, 1994.","short":"M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, R.E. Tarjan, SIAM Journal on Computing (1994) 738–761.","chicago":"Dietzfelbinger, Martin, Anna Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, and Robert E. Tarjan. “Dynamic Perfect Hashing: Upper and Lower Bounds.” <i>SIAM Journal on Computing</i>, 1994, 738–61. <a href=\"https://doi.org/10.1137/s0097539791194094\">https://doi.org/10.1137/s0097539791194094</a>."}},{"citation":{"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} }","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>","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>.","short":"F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, eds., Parallel Architectures and Their Efficient Use, Springer, Berlin, Heidelberg, 1993.","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.","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>"},"date_created":"2020-07-30T09:49:20Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_editor","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540567318","9783540476375"]},"status":"public","year":"1993","title":"Parallel Architectures and Their Efficient Use","publication_status":"published","date_updated":"2022-01-06T06:53:12Z","_id":"17477","publisher":"Springer","language":[{"iso":"eng"}],"editor":[{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Monien","first_name":"B.","full_name":"Monien, B."},{"full_name":"Rosenberg, A. L.","last_name":"Rosenberg","first_name":"A. L."}],"user_id":"15415","doi":"10.1007/3-540-56731-3"},{"publication":"Proc. 3rd PASA Workshop, PARS Mitteilungen","citation":{"apa":"Kastens, U., Meyer auf der Heide, F., Wachsmann, A., &#38; Wichmann, F. (1993). OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i> (pp. 50–55).","ieee":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, and F. Wichmann, “OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report),” in <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>, 1993, pp. 50–55.","chicago":"Kastens, Uwe, Friedhelm Meyer auf der Heide, Alf Wachsmann, and Friedrich Wichmann. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” In <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>, 50–55, 1993.","short":"U. Kastens, F. Meyer auf der Heide, A. Wachsmann, F. Wichmann, in: Proc. 3rd PASA Workshop, PARS Mitteilungen, 1993, pp. 50–55.","mla":"Kastens, Uwe, et al. “OCCAM-Light: A Language Combining Shared Memory and Message Passing (A First Report).” <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>, 1993, pp. 50–55.","ama":"Kastens U, Meyer auf der Heide F, Wachsmann A, Wichmann F. OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report). In: <i>Proc. 3rd PASA Workshop, PARS Mitteilungen</i>. ; 1993:50-55.","bibtex":"@inproceedings{Kastens_Meyer auf der Heide_Wachsmann_Wichmann_1993, title={OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)}, booktitle={Proc. 3rd PASA Workshop, PARS Mitteilungen}, author={Kastens, Uwe and Meyer auf der Heide, Friedhelm and Wachsmann, Alf and Wichmann, Friedrich}, year={1993}, pages={50–55} }"},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-07-30T10:54:52Z","date_updated":"2022-01-06T06:53:12Z","year":"1993","title":"OCCAM-light: A Language Combining Shared Memory and Message Passing (A First Report)","status":"public","author":[{"full_name":"Kastens, Uwe","first_name":"Uwe","last_name":"Kastens"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Wachsmann, Alf","first_name":"Alf","last_name":"Wachsmann"},{"last_name":"Wichmann","first_name":"Friedrich","full_name":"Wichmann, Friedrich"}],"user_id":"15415","page":"50-55","language":[{"iso":"eng"}],"_id":"17479"},{"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-20T10:31:51Z","publication":"Information and Computation","citation":{"mla":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Information and Computation</i>, 1993, pp. 196–217, doi:<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>.","ama":"Dietzfelbinger M, Meyer auf der Heide F. An Optimal Parallel Dictionary. <i>Information and Computation</i>. 1993:196-217. doi:<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>","bibtex":"@article{Dietzfelbinger_Meyer auf der Heide_1993, title={An Optimal Parallel Dictionary}, DOI={<a href=\"https://doi.org/10.1006/inco.1993.1007\">10.1006/inco.1993.1007</a>}, journal={Information and Computation}, author={Dietzfelbinger, M. and Meyer auf der Heide, Friedhelm}, year={1993}, pages={196–217} }","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1993). An Optimal Parallel Dictionary. <i>Information and Computation</i>, 196–217. <a href=\"https://doi.org/10.1006/inco.1993.1007\">https://doi.org/10.1006/inco.1993.1007</a>","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “An Optimal Parallel Dictionary,” <i>Information and Computation</i>, pp. 196–217, 1993.","short":"M. Dietzfelbinger, F. Meyer auf der Heide, Information and Computation (1993) 196–217.","chicago":"Dietzfelbinger, M., and Friedhelm Meyer auf der Heide. “An Optimal Parallel Dictionary.” <i>Information and Computation</i>, 1993, 196–217. <a href=\"https://doi.org/10.1006/inco.1993.1007\">https://doi.org/10.1006/inco.1993.1007</a>."},"user_id":"15415","doi":"10.1006/inco.1993.1007","page":"196-217","_id":"16729","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","year":"1993","status":"public","title":"An Optimal Parallel Dictionary","publication_identifier":{"issn":["0890-5401"]},"author":[{"full_name":"Dietzfelbinger, M.","last_name":"Dietzfelbinger","first_name":"M."},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}]},{"user_id":"15415","doi":"10.1007/3-540-56939-1_89","_id":"16730","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:55Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"first_name":"Brigitte","last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte"},{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"publication_identifier":{"isbn":["9783540569398","9783540478263"],"issn":["0302-9743","1611-3349"]},"title":"Strongly adaptive token distribution","status":"public","year":"1993","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-20T10:33:56Z","place":"Berlin, Heidelberg","citation":{"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.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, in: Automata, Languages and Programming, 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>.","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>.","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>","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} }"},"publication":"Automata, Languages and Programming"},{"citation":{"chicago":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” In <i>Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93</i>, 1993. <a href=\"https://doi.org/10.1145/165231.165246\">https://doi.org/10.1145/165231.165246</a>.","ama":"Dietzfelbinger M, Meyer auf der Heide F. Simple, efficient shared memory simulations. In: <i>Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93</i>. ; 1993. doi:<a href=\"https://doi.org/10.1145/165231.165246\">10.1145/165231.165246</a>","short":"M. Dietzfelbinger, F. Meyer auf der Heide, in: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93, 1993.","bibtex":"@inproceedings{Dietzfelbinger_Meyer auf der Heide_1993, title={Simple, efficient shared memory simulations}, DOI={<a href=\"https://doi.org/10.1145/165231.165246\">10.1145/165231.165246</a>}, booktitle={Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93}, author={Dietzfelbinger, Martin and Meyer auf der Heide, Friedhelm}, year={1993} }","apa":"Dietzfelbinger, M., &#38; Meyer auf der Heide, F. (1993). Simple, efficient shared memory simulations. In <i>Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93</i>. <a href=\"https://doi.org/10.1145/165231.165246\">https://doi.org/10.1145/165231.165246</a>","mla":"Dietzfelbinger, Martin, and Friedhelm Meyer auf der Heide. “Simple, Efficient Shared Memory Simulations.” <i>Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’93</i>, 1993, doi:<a href=\"https://doi.org/10.1145/165231.165246\">10.1145/165231.165246</a>.","ieee":"M. Dietzfelbinger and F. Meyer auf der Heide, “Simple, efficient shared memory simulations,” in <i>Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’93</i>, 1993."},"publication":"Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures  - SPAA '93","date_created":"2020-04-20T10:35:49Z","department":[{"_id":"63"}],"type":"conference","publication_identifier":{"isbn":["0897915992"]},"author":[{"full_name":"Dietzfelbinger, Martin","last_name":"Dietzfelbinger","first_name":"Martin"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"1993","status":"public","title":"Simple, efficient shared memory simulations","date_updated":"2022-01-06T06:52:55Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16731","doi":"10.1145/165231.165246","user_id":"15415"}]