[{"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","_id":"17564","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540616276","9783540706366"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"1996","page":"369-376","citation":{"short":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, I. Rieping, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1996, pp. 369–376.","mla":"Bäumker, Armin, et al. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” <i>Lecture Notes in Computer Science</i>, 1996, pp. 369–76, doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>.","bibtex":"@inbook{Bäumker_Dittrich_Meyer auf der Heide_Rieping_1996, place={Berlin, Heidelberg}, title={Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model}, DOI={<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>}, booktitle={Lecture Notes in Computer Science}, author={Bäumker, Armin and Dittrich, Wolfgang and Meyer auf der Heide, Friedhelm and Rieping, Ingo}, year={1996}, pages={369–376} }","apa":"Bäumker, A., Dittrich, W., Meyer auf der Heide, F., &#38; Rieping, I. (1996). Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In <i>Lecture Notes in Computer Science</i> (pp. 369–376). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>","ama":"Bäumker A, Dittrich W, Meyer auf der Heide F, Rieping I. Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 1996:369-376. doi:<a href=\"https://doi.org/10.1007/bfb0024725\">10.1007/bfb0024725</a>","ieee":"A. Bäumker, W. Dittrich, F. Meyer auf der Heide, and I. Rieping, “Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 1996, pp. 369–376.","chicago":"Bäumker, Armin, Wolfgang Dittrich, Friedhelm Meyer auf der Heide, and Ingo Rieping. “Realistic Parallel Algorithms: Priority Queue Operations and Selection for the BSP* Model.” In <i>Lecture Notes in Computer Science</i>, 369–76. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/bfb0024725\">https://doi.org/10.1007/bfb0024725</a>."},"date_updated":"2022-01-06T06:53:15Z","date_created":"2020-08-03T13:11:02Z","author":[{"first_name":"Armin","last_name":"Bäumker","full_name":"Bäumker, Armin"},{"first_name":"Wolfgang","full_name":"Dittrich, Wolfgang","last_name":"Dittrich"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Rieping, Ingo","last_name":"Rieping","first_name":"Ingo"}],"title":"Realistic parallel algorithms: Priority queue operations and selection for the BSP* Model","doi":"10.1007/bfb0024725"},{"citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2, 1996, pp. 245--281, doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>.","bibtex":"@article{Meyer auf der Heide_Scheideler_Stemann_1996, title={Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations}, DOI={<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>}, number={2}, journal={Theor. Comput. Sci.}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian and Stemann, Volker}, year={1996}, pages={245--281} }","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, Theor. Comput. Sci. (1996) 245--281.","apa":"Meyer auf der Heide, F., Scheideler, C., &#38; Stemann, V. (1996). Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor. Comput. Sci.</i>, (2), 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>","ieee":"F. Meyer auf der Heide, C. Scheideler, and V. Stemann, “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations,” <i>Theor. Comput. Sci.</i>, no. 2, pp. 245--281, 1996.","chicago":"Meyer auf der Heide, Friedhelm, Christian Scheideler, and Volker Stemann. “Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations.” <i>Theor. Comput. Sci.</i>, no. 2 (1996): 245--281. <a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">https://doi.org/10.1016/0304-3975(96)00032-1</a>.","ama":"Meyer auf der Heide F, Scheideler C, Stemann V. Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations. <i>Theor Comput Sci</i>. 1996;(2):245--281. doi:<a href=\"https://doi.org/10.1016/0304-3975(96)00032-1\">10.1016/0304-3975(96)00032-1</a>"},"page":"245--281","year":"1996","issue":"2","doi":"10.1016/0304-3975(96)00032-1","title":"Exploiting Storage Redundancy to Speed up Randomized Shared Memory Simulations","date_created":"2018-04-03T09:30:20Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"},{"first_name":"Volker","full_name":"Stemann, Volker","last_name":"Stemann"}],"date_updated":"2022-01-06T06:55:16Z","status":"public","type":"journal_article","publication":"Theor. Comput. Sci.","language":[{"iso":"eng"}],"user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"_id":"2182"},{"year":"1996","citation":{"apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In <i>FOCS</i> (pp. 370--379).","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, title={Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols}, booktitle={FOCS}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={370--379} }","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” <i>FOCS</i>, 1996, pp. 370--379.","short":"F. Meyer auf der Heide, C. Scheideler, in: FOCS, 1996, pp. 370--379.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols.” In <i>FOCS</i>, 370--379, 1996.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols,” in <i>FOCS</i>, 1996, pp. 370--379.","ama":"Meyer auf der Heide F, Scheideler C. Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols. In: <i>FOCS</i>. ; 1996:370--379."},"page":"370--379","has_accepted_license":"1","title":"Deterministic Routing with Bounded Buffers: Turning Offline into Online Protocols","date_updated":"2022-01-06T06:55:17Z","oa":"1","date_created":"2018-04-03T09:31:52Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"}],"urn":"21832","file":[{"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"2281","file_name":"FOCS96.pdf","file_size":248409,"creator":"florida","date_created":"2018-04-12T07:01:11Z","date_updated":"2018-04-12T07:10:17Z"}],"status":"public","type":"conference","publication":"FOCS","ddc":["040"],"file_date_updated":"2018-04-12T07:10:17Z","language":[{"iso":"eng"}],"_id":"2183","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}]},{"intvolume":"      1175","page":"16--33","citation":{"ama":"Meyer auf der Heide F, Scheideler C. Communication in Parallel Systems. In: <i>SOFSEM</i>. Vol 1175. Lecture Notes in Computer Science. Springer; 1996:16--33.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in <i>SOFSEM</i>, 1996, vol. 1175, pp. 16--33.","chicago":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” In <i>SOFSEM</i>, 1175:16--33. Lecture Notes in Computer Science. Springer, 1996.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Communication in Parallel Systems. In <i>SOFSEM</i> (Vol. 1175, pp. 16--33). Springer.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” <i>SOFSEM</i>, vol. 1175, Springer, 1996, pp. 16--33.","bibtex":"@inproceedings{Meyer auf der Heide_Scheideler_1996, series={Lecture Notes in Computer Science}, title={Communication in Parallel Systems}, volume={1175}, booktitle={SOFSEM}, publisher={Springer}, author={Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={1996}, pages={16--33}, collection={Lecture Notes in Computer Science} }","short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, pp. 16--33."},"year":"1996","has_accepted_license":"1","title":"Communication in Parallel Systems","volume":1175,"author":[{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christian","full_name":"Scheideler, Christian","id":"20792","last_name":"Scheideler"}],"date_created":"2018-04-03T09:32:47Z","publisher":"Springer","oa":"1","date_updated":"2022-01-06T06:55:17Z","status":"public","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:10:36Z","creator":"florida","date_created":"2018-04-12T07:01:59Z","file_size":597639,"file_id":"2282","file_name":"SOFSEM96.pdf","access_level":"open_access"}],"urn":"21840","publication":"SOFSEM","type":"conference","language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T07:10:36Z","ddc":["040"],"department":[{"_id":"79"},{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"14955","_id":"2184"},{"urn":"21868","status":"public","file":[{"creator":"florida","date_created":"2018-04-12T06:58:59Z","date_updated":"2018-04-12T07:11:03Z","file_name":"STOC96.pdf","file_id":"2280","access_level":"open_access","file_size":700595,"content_type":"application/pdf","relation":"main_file"}],"publication":"STOC","type":"conference","ddc":["040"],"file_date_updated":"2018-04-12T07:11:03Z","language":[{"iso":"eng"}],"_id":"2186","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","year":"1996","page":"356--365","citation":{"chicago":"Cypher, Robert, Friedhelm Meyer auf der Heide, Christian Scheideler, and Berthold Vöcking. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” In <i>STOC</i>, 356--365. ACM, 1996.","ieee":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, and B. Vöcking, “Universal Algorithms for Store-and-Forward and Wormhole Routing,” in <i>STOC</i>, 1996, pp. 356--365.","ama":"Cypher R, Meyer auf der Heide F, Scheideler C, Vöcking B. Universal Algorithms for Store-and-Forward and Wormhole Routing. In: <i>STOC</i>. ACM; 1996:356--365.","apa":"Cypher, R., Meyer auf der Heide, F., Scheideler, C., &#38; Vöcking, B. (1996). Universal Algorithms for Store-and-Forward and Wormhole Routing. In <i>STOC</i> (pp. 356--365). ACM.","bibtex":"@inproceedings{Cypher_Meyer auf der Heide_Scheideler_Vöcking_1996, title={Universal Algorithms for Store-and-Forward and Wormhole Routing}, booktitle={STOC}, publisher={ACM}, author={Cypher, Robert and Meyer auf der Heide, Friedhelm and Scheideler, Christian and Vöcking, Berthold}, year={1996}, pages={356--365} }","short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” <i>STOC</i>, ACM, 1996, pp. 356--365."},"has_accepted_license":"1","title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","publisher":"ACM","date_updated":"2022-01-06T06:55:18Z","oa":"1","author":[{"first_name":"Robert","full_name":"Cypher, Robert","last_name":"Cypher"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"},{"first_name":"Berthold","full_name":"Vöcking, Berthold","last_name":"Vöcking"}],"date_created":"2018-04-03T09:39:17Z"},{"date_created":"2020-04-16T11:40:05Z","author":[{"first_name":"Foued","full_name":"Ameur, Foued","last_name":"Ameur"},{"last_name":"Fischer","full_name":"Fischer, Paul","first_name":"Paul"},{"first_name":"Klaus -U.","last_name":"Höffgen","full_name":"Höffgen, Klaus -U."},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"date_updated":"2022-01-06T06:52:54Z","doi":"10.1007/bf03036467","title":"Trial and error. A new approach to space-bounded learning","publication_status":"published","publication_identifier":{"issn":["0001-5903","1432-0525"]},"citation":{"ama":"Ameur F, Fischer P, Höffgen K-U, Meyer auf der Heide F. Trial and error. A new approach to space-bounded learning. <i>Acta Informatica</i>. 1996:621-630. doi:<a href=\"https://doi.org/10.1007/bf03036467\">10.1007/bf03036467</a>","chicago":"Ameur, Foued, Paul Fischer, Klaus -U. Höffgen, and Friedhelm Meyer auf der Heide. “Trial and Error. A New Approach to Space-Bounded Learning.” <i>Acta Informatica</i>, 1996, 621–30. <a href=\"https://doi.org/10.1007/bf03036467\">https://doi.org/10.1007/bf03036467</a>.","ieee":"F. Ameur, P. Fischer, K.-U. Höffgen, and F. Meyer auf der Heide, “Trial and error. A new approach to space-bounded learning,” <i>Acta Informatica</i>, pp. 621–630, 1996.","apa":"Ameur, F., Fischer, P., Höffgen, K.-U., &#38; Meyer auf der Heide, F. (1996). Trial and error. A new approach to space-bounded learning. <i>Acta Informatica</i>, 621–630. <a href=\"https://doi.org/10.1007/bf03036467\">https://doi.org/10.1007/bf03036467</a>","mla":"Ameur, Foued, et al. “Trial and Error. A New Approach to Space-Bounded Learning.” <i>Acta Informatica</i>, 1996, pp. 621–30, doi:<a href=\"https://doi.org/10.1007/bf03036467\">10.1007/bf03036467</a>.","bibtex":"@article{Ameur_Fischer_Höffgen_Meyer auf der Heide_1996, title={Trial and error. A new approach to space-bounded learning}, DOI={<a href=\"https://doi.org/10.1007/bf03036467\">10.1007/bf03036467</a>}, journal={Acta Informatica}, author={Ameur, Foued and Fischer, Paul and Höffgen, Klaus -U. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={621–630} }","short":"F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630."},"page":"621-630","year":"1996","user_id":"15415","department":[{"_id":"63"}],"_id":"16698","language":[{"iso":"eng"}],"type":"journal_article","publication":"Acta Informatica","status":"public"},{"title":"Strongly adaptive token distribution","doi":"10.1007/bf01955042","date_updated":"2022-01-06T06:52:54Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Brigitte","last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte"},{"last_name":"Wanka","full_name":"Wanka, Rolf","first_name":"Rolf"}],"date_created":"2020-04-16T11:46:56Z","year":"1996","citation":{"apa":"Meyer auf der Heide, F., Oesterdiekhoff, B., &#38; Wanka, R. (1996). Strongly adaptive token distribution. <i>Algorithmica</i>, 413–427. <a href=\"https://doi.org/10.1007/bf01955042\">https://doi.org/10.1007/bf01955042</a>","mla":"Meyer auf der Heide, Friedhelm, et al. “Strongly Adaptive Token Distribution.” <i>Algorithmica</i>, 1996, pp. 413–27, doi:<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>.","bibtex":"@article{Meyer auf der Heide_Oesterdiekhoff_Wanka_1996, title={Strongly adaptive token distribution}, DOI={<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>}, journal={Algorithmica}, author={Meyer auf der Heide, Friedhelm and Oesterdiekhoff, Brigitte and Wanka, Rolf}, year={1996}, pages={413–427} }","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.","chicago":"Meyer auf der Heide, Friedhelm, Brigitte Oesterdiekhoff, and Rolf Wanka. “Strongly Adaptive Token Distribution.” <i>Algorithmica</i>, 1996, 413–27. <a href=\"https://doi.org/10.1007/bf01955042\">https://doi.org/10.1007/bf01955042</a>.","ieee":"F. Meyer auf der Heide, B. Oesterdiekhoff, and R. Wanka, “Strongly adaptive token distribution,” <i>Algorithmica</i>, pp. 413–427, 1996, doi: <a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>.","ama":"Meyer auf der Heide F, Oesterdiekhoff B, Wanka R. Strongly adaptive token distribution. <i>Algorithmica</i>. Published online 1996:413-427. doi:<a href=\"https://doi.org/10.1007/bf01955042\">10.1007/bf01955042</a>"},"page":"413-427","publication_status":"published","publication_identifier":{"issn":["0178-4617","1432-0541"]},"language":[{"iso":"eng"}],"_id":"16699","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"journal_article","publication":"Algorithmica"},{"type":"journal_article","publication":"Algorithmica","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16700","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0178-4617","1432-0541"]},"citation":{"apa":"Karp, R. M., Luby, M., &#38; Meyer auf der Heide, F. (1996). Efficient PRAM simulation on a distributed memory machine. <i>Algorithmica</i>, 517–542. <a href=\"https://doi.org/10.1007/bf01940878\">https://doi.org/10.1007/bf01940878</a>","short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.","bibtex":"@article{Karp_Luby_Meyer auf der Heide_1996, title={Efficient PRAM simulation on a distributed memory machine}, DOI={<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>}, journal={Algorithmica}, author={Karp, R. M. and Luby, M. and Meyer auf der Heide, Friedhelm}, year={1996}, pages={517–542} }","mla":"Karp, R. M., et al. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Algorithmica</i>, 1996, pp. 517–42, doi:<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>.","chicago":"Karp, R. M., M. Luby, and Friedhelm Meyer auf der Heide. “Efficient PRAM Simulation on a Distributed Memory Machine.” <i>Algorithmica</i>, 1996, 517–42. <a href=\"https://doi.org/10.1007/bf01940878\">https://doi.org/10.1007/bf01940878</a>.","ieee":"R. M. Karp, M. Luby, and F. Meyer auf der Heide, “Efficient PRAM simulation on a distributed memory machine,” <i>Algorithmica</i>, pp. 517–542, 1996.","ama":"Karp RM, Luby M, Meyer auf der Heide F. Efficient PRAM simulation on a distributed memory machine. <i>Algorithmica</i>. 1996:517-542. doi:<a href=\"https://doi.org/10.1007/bf01940878\">10.1007/bf01940878</a>"},"page":"517-542","year":"1996","author":[{"first_name":"R. M.","last_name":"Karp","full_name":"Karp, R. M."},{"first_name":"M.","last_name":"Luby","full_name":"Luby, M."},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"}],"date_created":"2020-04-16T11:50:27Z","date_updated":"2022-01-06T06:52:54Z","doi":"10.1007/bf01940878","title":"Efficient PRAM simulation on a distributed memory machine"},{"language":[{"iso":"eng"}],"_id":"16701","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"SIAM Journal on Computing","type":"journal_article","title":"The Tree Model for Hashing: Lower and Upper Bounds","doi":"10.1137/s0097539793255722","date_updated":"2022-01-06T06:52:54Z","author":[{"first_name":"Joseph","full_name":"Gil, Joseph","last_name":"Gil"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Wigderson","full_name":"Wigderson, Avi","first_name":"Avi"}],"date_created":"2020-04-16T11:53:57Z","year":"1996","page":"936-955","citation":{"ama":"Gil J, Meyer auf der Heide F, Wigderson A. The Tree Model for Hashing: Lower and Upper Bounds. <i>SIAM Journal on Computing</i>. 1996:936-955. doi:<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>","chicago":"Gil, Joseph, Friedhelm Meyer auf der Heide, and Avi Wigderson. “The Tree Model for Hashing: Lower and Upper Bounds.” <i>SIAM Journal on Computing</i>, 1996, 936–55. <a href=\"https://doi.org/10.1137/s0097539793255722\">https://doi.org/10.1137/s0097539793255722</a>.","ieee":"J. Gil, F. Meyer auf der Heide, and A. Wigderson, “The Tree Model for Hashing: Lower and Upper Bounds,” <i>SIAM Journal on Computing</i>, pp. 936–955, 1996.","short":"J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.","bibtex":"@article{Gil_Meyer auf der Heide_Wigderson_1996, title={The Tree Model for Hashing: Lower and Upper Bounds}, DOI={<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>}, journal={SIAM Journal on Computing}, author={Gil, Joseph and Meyer auf der Heide, Friedhelm and Wigderson, Avi}, year={1996}, pages={936–955} }","mla":"Gil, Joseph, et al. “The Tree Model for Hashing: Lower and Upper Bounds.” <i>SIAM Journal on Computing</i>, 1996, pp. 936–55, doi:<a href=\"https://doi.org/10.1137/s0097539793255722\">10.1137/s0097539793255722</a>.","apa":"Gil, J., Meyer auf der Heide, F., &#38; Wigderson, A. (1996). The Tree Model for Hashing: Lower and Upper Bounds. <i>SIAM Journal on Computing</i>, 936–955. <a href=\"https://doi.org/10.1137/s0097539793255722\">https://doi.org/10.1137/s0097539793255722</a>"},"publication_identifier":{"issn":["0097-5397","1095-7111"]},"publication_status":"published"},{"language":[{"iso":"eng"}],"_id":"16702","user_id":"15415","department":[{"_id":"63"}],"editor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Monien, Burkhard","last_name":"Monien","first_name":"Burkhard"}],"status":"public","type":"book_editor","title":"Automata, Languages and Programming, 23rd International Colloquium, ICALP96","doi":"10.1007/3-540-61440-0","date_updated":"2022-01-06T06:52:54Z","date_created":"2020-04-16T13:25:51Z","year":"1996","place":"Berlin, Heidelberg","citation":{"apa":"Meyer auf der Heide, F., &#38; Monien, B. (Eds.). (1996). <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-61440-0\">https://doi.org/10.1007/3-540-61440-0</a>","bibtex":"@book{Meyer auf der Heide_Monien_1996, place={Berlin, Heidelberg}, title={Automata, Languages and Programming, 23rd International Colloquium, ICALP96}, DOI={<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>}, year={1996} }","short":"F. Meyer auf der Heide, B. Monien, eds., Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Berlin, Heidelberg, 1996.","mla":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, editors. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. 1996, doi:<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>.","chicago":"Meyer auf der Heide, Friedhelm, and Burkhard Monien, eds. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-61440-0\">https://doi.org/10.1007/3-540-61440-0</a>.","ieee":"F. Meyer auf der Heide and B. Monien, Eds., <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996.","ama":"Meyer auf der Heide F, Monien B, eds. <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-61440-0\">10.1007/3-540-61440-0</a>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540614401","9783540685807"]}},{"citation":{"short":"P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 1996.","bibtex":"@inbook{Berenbrink_Meyer auf der Heide_Stemann_1996, place={Berlin, Heidelberg}, title={Fault-tolerant shared memory simulations}, DOI={<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>}, booktitle={STACS 96}, author={Berenbrink, Petra and Meyer auf der Heide, Friedhelm and Stemann, Volker}, year={1996} }","mla":"Berenbrink, Petra, et al. “Fault-Tolerant Shared Memory Simulations.” <i>STACS 96</i>, 1996, doi:<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>.","apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Stemann, V. (1996). Fault-tolerant shared memory simulations. In <i>STACS 96</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-60922-9_16\">https://doi.org/10.1007/3-540-60922-9_16</a>","ama":"Berenbrink P, Meyer auf der Heide F, Stemann V. Fault-tolerant shared memory simulations. In: <i>STACS 96</i>. Berlin, Heidelberg; 1996. doi:<a href=\"https://doi.org/10.1007/3-540-60922-9_16\">10.1007/3-540-60922-9_16</a>","chicago":"Berenbrink, Petra, Friedhelm Meyer auf der Heide, and Volker Stemann. “Fault-Tolerant Shared Memory Simulations.” In <i>STACS 96</i>. Berlin, Heidelberg, 1996. <a href=\"https://doi.org/10.1007/3-540-60922-9_16\">https://doi.org/10.1007/3-540-60922-9_16</a>.","ieee":"P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in <i>STACS 96</i>, Berlin, Heidelberg, 1996."},"place":"Berlin, Heidelberg","year":"1996","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540609223","9783540497233"]},"doi":"10.1007/3-540-60922-9_16","title":"Fault-tolerant shared memory simulations","author":[{"first_name":"Petra","last_name":"Berenbrink","full_name":"Berenbrink, Petra"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"date_created":"2020-04-16T13:32:22Z","date_updated":"2022-01-06T06:52:54Z","status":"public","type":"book_chapter","publication":"STACS 96","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16703"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"17482","language":[{"iso":"eng"}],"publication":"Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures","type":"conference","status":"public","date_created":"2020-07-30T14:09:45Z","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"date_updated":"2022-01-06T06:53:12Z","title":"Simulating shared memory in real time: On the computation power of reconfigurable meshes","page":"46--59","citation":{"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.","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).","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.","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."},"year":"1995"},{"urn":"21878","status":"public","file":[{"file_size":177256,"file_id":"2279","file_name":"ESA95.pdf","access_level":"open_access","date_updated":"2018-04-12T07:09:35Z","creator":"florida","date_created":"2018-04-12T06:57:17Z","relation":"main_file","content_type":"application/pdf"}],"publication":"ESA","type":"conference","ddc":["040"],"language":[{"iso":"eng"}],"file_date_updated":"2018-04-12T07:09:35Z","_id":"2187","department":[{"_id":"79"},{"_id":"63"}],"user_id":"14955","series_title":"Lecture Notes in Computer Science","year":"1995","page":"341--354","citation":{"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>","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} }","short":"F. Meyer auf der Heide, C. Scheideler, in: ESA, 1995, pp. 341--354.","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>.","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>","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>.","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."},"has_accepted_license":"1","title":"Routing with Bounded Buffers and Hot-Potato Routing in Vertex-Symmetric Networks","doi":"10.1007/3-540-60313-1_154","oa":"1","date_updated":"2022-01-06T06:55:18Z","author":[{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Scheideler","id":"20792","full_name":"Scheideler, Christian"}],"date_created":"2018-04-03T09:40:55Z"},{"year":"1995","citation":{"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} }","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.","short":"F. Meyer auf der Heide, C. Scheideler, in: SPAA, 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).","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.","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."},"page":"137--146","has_accepted_license":"1","title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","oa":"1","date_updated":"2022-01-06T06:55:24Z","date_created":"2018-04-04T12:43:41Z","author":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"first_name":"Christian","id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler"}],"urn":"22075","file":[{"content_type":"application/pdf","relation":"main_file","date_updated":"2018-04-12T07:09:52Z","date_created":"2018-04-12T06:56:32Z","creator":"florida","file_size":284222,"file_id":"2278","access_level":"open_access","file_name":"SPAA95.pdf"}],"status":"public","type":"conference","publication":"SPAA","ddc":["040"],"file_date_updated":"2018-04-12T07:09:52Z","language":[{"iso":"eng"}],"_id":"2207","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}]},{"has_accepted_license":"1","year":"1995","citation":{"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).","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} }","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.","short":"F. Meyer auf der Heide, C. Scheideler, V. Stemann, in: STACS, 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.","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.","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."},"page":"267--278","date_updated":"2022-01-06T06:55:24Z","oa":"1","date_created":"2018-04-04T12:44:26Z","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","type":"conference","publication":"STACS","urn":"22085","file":[{"content_type":"application/pdf","relation":"main_file","date_created":"2018-04-12T06:54:40Z","creator":"florida","date_updated":"2018-04-12T07:09:13Z","access_level":"open_access","file_name":"STACS95.pdf","file_id":"2277","file_size":407467}],"status":"public","_id":"2208","user_id":"14955","department":[{"_id":"79"},{"_id":"63"}],"ddc":["040"],"file_date_updated":"2018-04-12T07:09:13Z","language":[{"iso":"eng"}]},{"date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-15T11:28:35Z","author":[{"first_name":"Dany","last_name":"Breslauer","full_name":"Breslauer, Dany"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"full_name":"Dubhashi, Devdatt P.","last_name":"Dubhashi","first_name":"Devdatt P."},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"title":"Transforming comparison model lower bounds to the parallel-random-access-machine","doi":"10.1016/s0020-0190(97)00032-x","publication_identifier":{"issn":["0020-0190"]},"publication_status":"published","year":"1995","page":"103-110","citation":{"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>","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.","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>.","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>","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>.","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} }","short":"D. Breslauer, A. Czumaj, D.P. Dubhashi, F. Meyer auf der Heide, Information Processing Letters (1995) 103–110."},"_id":"16566","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Information Processing Letters","type":"journal_article","status":"public"},{"publication":"STACS 95","type":"book_chapter","status":"public","_id":"16704","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540590422","9783540491750"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"1995","place":"Berlin, Heidelberg","citation":{"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.","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>.","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>","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>","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.","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} }"},"date_updated":"2022-01-06T06:52:54Z","date_created":"2020-04-16T13:36:32Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"last_name":"Vöcking","full_name":"Vöcking, Berthold","first_name":"Berthold"}],"title":"A packet routing protocol for arbitrary networks","doi":"10.1007/3-540-59042-0_81"},{"language":[{"iso":"eng"}],"_id":"16705","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","title":"Shared memory simulations with triple-logarithmic delay","doi":"10.1007/3-540-60313-1_133","date_updated":"2022-01-06T06:52:54Z","date_created":"2020-04-16T13:40:52Z","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Volker","last_name":"Stemann","full_name":"Stemann, Volker"}],"year":"1995","place":"Berlin, Heidelberg","citation":{"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} }","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","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>.","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>","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>","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>.","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."},"publication_status":"published","publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]}},{"_id":"16706","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95","status":"public","date_updated":"2022-01-06T06:52:54Z","date_created":"2020-04-16T13:47:15Z","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Storch, Martin","last_name":"Storch","first_name":"Martin"},{"first_name":"Rolf","full_name":"Wanka, Rolf","last_name":"Wanka"}],"title":"Optimal trade-offs between size and slowdown for universal parallel networks","doi":"10.1145/215399.215430","publication_status":"published","publication_identifier":{"isbn":["0897917170"]},"year":"1995","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.","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>.","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>","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>.","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.","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} }","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>"}},{"publication_status":"published","publication_identifier":{"isbn":["0818669152"]},"citation":{"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>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings Third Israel Symposium on the Theory of Computing and Systems, 1995.","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} }","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>","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>","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>.","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>."},"year":"1995","date_created":"2020-04-16T13:49:13Z","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"last_name":"Stemann","full_name":"Stemann, Volker","first_name":"Volker"}],"date_updated":"2022-01-06T06:52:54Z","doi":"10.1109/istcs.1995.377051","title":"Improved optimal shared memory simulations, and the power of reconfiguration","type":"conference","publication":"Proceedings Third Israel Symposium on the Theory of Computing and Systems","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"16707","language":[{"iso":"eng"}]}]