[{"page":"16--33","publisher":"Springer","_id":"2184","urn":"21840","user_id":"14955","ddc":["040"],"volume":1175,"status":"public","has_accepted_license":"1","oa":"1","file_date_updated":"2018-04-12T07:10:36Z","citation":{"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} }","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.","mla":"Meyer auf der Heide, Friedhelm, and Christian Scheideler. “Communication in Parallel Systems.” <i>SOFSEM</i>, vol. 1175, Springer, 1996, pp. 16--33.","short":"F. Meyer auf der Heide, C. Scheideler, in: SOFSEM, Springer, 1996, 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.","ieee":"F. Meyer auf der Heide and C. Scheideler, “Communication in Parallel Systems,” in <i>SOFSEM</i>, 1996, vol. 1175, pp. 16--33.","apa":"Meyer auf der Heide, F., &#38; Scheideler, C. (1996). Communication in Parallel Systems. In <i>SOFSEM</i> (Vol. 1175, pp. 16--33). Springer."},"series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"year":"1996","title":"Communication in Parallel Systems","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"id":"20792","first_name":"Christian","last_name":"Scheideler","full_name":"Scheideler, Christian"}],"date_updated":"2022-01-06T06:55:17Z","intvolume":"      1175","file":[{"content_type":"application/pdf","file_id":"2282","access_level":"open_access","file_size":597639,"file_name":"SOFSEM96.pdf","date_updated":"2018-04-12T07:10:36Z","relation":"main_file","date_created":"2018-04-12T07:01:59Z","creator":"florida"}],"date_created":"2018-04-03T09:32:47Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"publication":"SOFSEM"},{"has_accepted_license":"1","status":"public","user_id":"14955","ddc":["040"],"page":"356--365","_id":"2186","publisher":"ACM","urn":"21868","file_date_updated":"2018-04-12T07:11:03Z","citation":{"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} }","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.","mla":"Cypher, Robert, et al. “Universal Algorithms for Store-and-Forward and Wormhole Routing.” <i>STOC</i>, ACM, 1996, pp. 356--365.","short":"R. Cypher, F. Meyer auf der Heide, C. Scheideler, B. Vöcking, in: STOC, ACM, 1996, pp. 356--365.","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.","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."},"oa":"1","date_updated":"2022-01-06T06:55:18Z","year":"1996","title":"Universal Algorithms for Store-and-Forward and Wormhole Routing","author":[{"full_name":"Cypher, Robert","first_name":"Robert","last_name":"Cypher"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"first_name":"Berthold","last_name":"Vöcking","full_name":"Vöcking, Berthold"}],"language":[{"iso":"eng"}],"publication":"STOC","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"file":[{"date_updated":"2018-04-12T07:11:03Z","relation":"main_file","file_size":700595,"access_level":"open_access","file_name":"STOC96.pdf","content_type":"application/pdf","file_id":"2280","creator":"florida","date_created":"2018-04-12T06:58:59Z"}],"date_created":"2018-04-03T09:39:17Z"},{"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","publication_identifier":{"issn":["0001-5903","1432-0525"]},"author":[{"first_name":"Foued","last_name":"Ameur","full_name":"Ameur, Foued"},{"first_name":"Paul","last_name":"Fischer","full_name":"Fischer, Paul"},{"first_name":"Klaus -U.","last_name":"Höffgen","full_name":"Höffgen, Klaus -U."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"}],"title":"Trial and error. A new approach to space-bounded learning","status":"public","year":"1996","user_id":"15415","doi":"10.1007/bf03036467","language":[{"iso":"eng"}],"_id":"16698","page":"621-630","citation":{"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} }","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>","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>.","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>.","short":"F. Ameur, P. Fischer, K.-U. Höffgen, F. Meyer auf der Heide, Acta Informatica (1996) 621–630.","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>"},"publication":"Acta Informatica","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-16T11:40:05Z"},{"publication":"Algorithmica","citation":{"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>.","short":"F. Meyer auf der Heide, B. Oesterdiekhoff, R. Wanka, Algorithmica (1996) 413–427.","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>","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>","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} }","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>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-04-16T11:46:56Z","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","year":"1996","title":"Strongly adaptive token distribution","status":"public","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Brigitte","last_name":"Oesterdiekhoff","full_name":"Oesterdiekhoff, Brigitte"},{"last_name":"Wanka","first_name":"Rolf","full_name":"Wanka, Rolf"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"user_id":"15415","doi":"10.1007/bf01955042","page":"413-427","_id":"16699","language":[{"iso":"eng"}]},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-16T11:50:27Z","citation":{"short":"R.M. Karp, M. Luby, F. Meyer auf der Heide, Algorithmica (1996) 517–542.","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>.","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>","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>","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>."},"publication":"Algorithmica","user_id":"15415","doi":"10.1007/bf01940878","_id":"16700","language":[{"iso":"eng"}],"page":"517-542","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","author":[{"full_name":"Karp, R. M.","first_name":"R. M.","last_name":"Karp"},{"full_name":"Luby, M.","first_name":"M.","last_name":"Luby"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0178-4617","1432-0541"]},"status":"public","title":"Efficient PRAM simulation on a distributed memory machine","year":"1996"},{"user_id":"15415","doi":"10.1137/s0097539793255722","language":[{"iso":"eng"}],"_id":"16701","page":"936-955","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","author":[{"last_name":"Gil","first_name":"Joseph","full_name":"Gil, Joseph"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Wigderson, Avi","first_name":"Avi","last_name":"Wigderson"}],"publication_identifier":{"issn":["0097-5397","1095-7111"]},"status":"public","title":"The Tree Model for Hashing: Lower and Upper Bounds","year":"1996","department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-16T11:53:57Z","citation":{"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} }","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>","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>.","short":"J. Gil, F. Meyer auf der Heide, A. Wigderson, SIAM Journal on Computing (1996) 936–955.","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.","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":"SIAM Journal on Computing"},{"doi":"10.1007/3-540-61440-0","user_id":"15415","editor":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"}],"_id":"16702","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:54Z","publication_status":"published","year":"1996","title":"Automata, Languages and Programming, 23rd International Colloquium, ICALP96","status":"public","publication_identifier":{"isbn":["9783540614401","9783540685807"],"issn":["0302-9743","1611-3349"]},"type":"book_editor","department":[{"_id":"63"}],"place":"Berlin, Heidelberg","date_created":"2020-04-16T13:25:51Z","citation":{"ieee":"F. Meyer auf der Heide and B. Monien, Eds., <i>Automata, Languages and Programming, 23rd International Colloquium, ICALP96</i>. Berlin, Heidelberg, 1996.","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>","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>.","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>.","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} }","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>"}},{"_id":"16703","language":[{"iso":"eng"}],"doi":"10.1007/3-540-60922-9_16","user_id":"15415","title":"Fault-tolerant shared memory simulations","status":"public","year":"1996","author":[{"full_name":"Berenbrink, Petra","first_name":"Petra","last_name":"Berenbrink"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Stemann","first_name":"Volker","full_name":"Stemann, Volker"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540609223","9783540497233"]},"date_updated":"2022-01-06T06:52:54Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-16T13:32:22Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"STACS 96","citation":{"ieee":"P. Berenbrink, F. Meyer auf der Heide, and V. Stemann, “Fault-tolerant shared memory simulations,” in <i>STACS 96</i>, Berlin, Heidelberg, 1996.","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>","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>.","short":"P. Berenbrink, F. Meyer auf der Heide, V. Stemann, in: STACS 96, Berlin, Heidelberg, 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>.","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} }","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>"}},{"citation":{"apa":"Stemann, V. (1995). <i>Contention Resolution in Hashing Based Shared Memory Simulations</i> (Vol. 3). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"V. Stemann, <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>, vol. 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","short":"V. Stemann, Contention Resolution in Hashing Based Shared Memory Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","chicago":"Stemann, Volker. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Vol. 3. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","mla":"Stemann, Volker. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","ama":"Stemann V. <i>Contention Resolution in Hashing Based Shared Memory Simulations</i>. Vol 3. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","bibtex":"@book{Stemann_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Contention Resolution in Hashing Based Shared Memory Simulations}, volume={3}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Stemann, Volker}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","date_created":"2020-09-22T12:28:47Z","intvolume":"         3","date_updated":"2022-01-06T06:54:08Z","publication_identifier":{"isbn":["3-931466-02-7"]},"author":[{"first_name":"Volker","last_name":"Stemann","full_name":"Stemann, Volker"}],"year":"1995","title":"Contention Resolution in Hashing Based Shared Memory Simulations","status":"public","volume":3,"user_id":"5786","language":[{"iso":"eng"}],"_id":"19623","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","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":"Czumaj, Artur. <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>. Vol. 8. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","ama":"Czumaj A. <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>. Vol 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 1995.","short":"A. Czumaj, Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","bibtex":"@book{Czumaj_1995, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations}, volume={8}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Czumaj, Artur}, year={1995}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Czumaj, Artur. <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","apa":"Czumaj, A. (1995). <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i> (Vol. 8). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"A. Czumaj, <i>Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations</i>, vol. 8. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995."},"file_date_updated":"2020-09-22T12:38:15Z","has_accepted_license":"1","status":"public","volume":8,"ddc":["000"],"user_id":"5786","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19627","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","date_created":"2020-09-22T12:38:29Z","file":[{"file_size":801624,"access_level":"closed","file_name":"pub-hni-441.pdf","date_updated":"2020-09-22T12:38:15Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"19629","creator":"koala","date_created":"2020-09-22T12:38:15Z"}],"intvolume":"         8","date_updated":"2022-01-06T06:54:09Z","publication_identifier":{"isbn":["3-931466-07-8"]},"author":[{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"}],"year":"1995","title":"Parallel Algorithmic Techniques: PRAM Algorithms and PRAM Simulations","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}]},{"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","date_updated":"2022-01-06T06:54:09Z","intvolume":"         6","year":"1995","title":"Eine Bibliothek von Basisdiensten für Parallelrechner: Routing, Synchronisation, gemeinsamer Speicher","status":"public","author":[{"full_name":"Wachsmann, Alf","first_name":"Alf","last_name":"Wachsmann"}],"publication_identifier":{"isbn":["3-931466-05-1"]},"type":"dissertation","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-09-22T12:40:46Z","citation":{"short":"A. Wachsmann, Eine Bibliothek von Basisdiensten Für Parallelrechner: Routing, Synchronisation, Gemeinsamer Speicher, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 1995.","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.","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."},"supervisor":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}]},{"volume":10,"user_id":"5786","_id":"19634","language":[{"iso":"eng"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","intvolume":"        10","date_updated":"2022-01-06T06:54:09Z","author":[{"last_name":"Ameur","first_name":"Foued","full_name":"Ameur, Foued"}],"publication_identifier":{"isbn":["3-931466-09-4"]},"title":"Space-Bounded Learning Algorithms","year":"1995","status":"public","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation","date_created":"2020-09-22T12:50:36Z","supervisor":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"citation":{"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.","mla":"Ameur, Foued. <i>Space-Bounded Learning Algorithms</i>. 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.","short":"F. Ameur, Space-Bounded Learning Algorithms, 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."}},{"page":"46--59","_id":"17482","language":[{"iso":"eng"}],"user_id":"15415","year":"1995","status":"public","title":"Simulating shared memory in real time: On the computation power of reconfigurable meshes","author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"date_updated":"2022-01-06T06:53:12Z","date_created":"2020-07-30T14:09:45Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures","citation":{"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.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Proceedings of the 2nd IEEE Workshop on Reconfigurable Architectures, 1995, 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.","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."}},{"status":"public","has_accepted_license":"1","_id":"2187","urn":"21878","page":"341--354","user_id":"14955","ddc":["040"],"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","author":[{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"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","date_updated":"2022-01-06T06:55:18Z","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"10.1007/3-540-60313-1_154","publication":"ESA","date_created":"2018-04-03T09:40:55Z","file":[{"access_level":"open_access","file_size":177256,"file_name":"ESA95.pdf","date_updated":"2018-04-12T07:09:35Z","relation":"main_file","content_type":"application/pdf","file_id":"2279","creator":"florida","date_created":"2018-04-12T06:57:17Z"}],"department":[{"_id":"79"},{"_id":"63"}],"type":"conference"},{"file_date_updated":"2018-04-12T07:09:52Z","publication":"SPAA","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} }","ama":"Meyer auf der Heide F, Scheideler C. Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract). In: <i>SPAA</i>. ; 1995: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.","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.","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)."},"file":[{"creator":"florida","date_created":"2018-04-12T06:56:32Z","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"}],"date_created":"2018-04-04T12:43:41Z","type":"conference","department":[{"_id":"79"},{"_id":"63"}],"oa":"1","status":"public","year":"1995","title":"Space-Efficient Routing in Vertex-Symmetric Networks (Extended Abstract)","author":[{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"date_updated":"2022-01-06T06:55:24Z","has_accepted_license":"1","page":"137--146","_id":"2207","urn":"22075","language":[{"iso":"eng"}],"user_id":"14955","ddc":["040"]},{"date_created":"2018-04-04T12:44:26Z","file":[{"date_updated":"2018-04-12T07:09:13Z","relation":"main_file","access_level":"open_access","file_size":407467,"file_name":"STACS95.pdf","content_type":"application/pdf","file_id":"2277","creator":"florida","date_created":"2018-04-12T06:54:40Z"}],"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","language":[{"iso":"eng"}],"_id":"2208","urn":"22085","page":"267--278","user_id":"14955","ddc":["040"],"author":[{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"id":"20792","full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"title":"Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations","status":"public","year":"1995","has_accepted_license":"1","date_updated":"2022-01-06T06:55:24Z"},{"department":[{"_id":"63"}],"type":"journal_article","date_created":"2020-04-15T11:28:35Z","citation":{"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.","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} }","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>.","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>"},"publication":"Information Processing Letters","user_id":"15415","doi":"10.1016/s0020-0190(97)00032-x","_id":"16566","language":[{"iso":"eng"}],"page":"103-110","publication_status":"published","date_updated":"2022-01-06T06:52:52Z","publication_identifier":{"issn":["0020-0190"]},"author":[{"full_name":"Breslauer, Dany","first_name":"Dany","last_name":"Breslauer"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Dubhashi","first_name":"Devdatt P.","full_name":"Dubhashi, Devdatt P."},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"}],"status":"public","title":"Transforming comparison model lower bounds to the parallel-random-access-machine","year":"1995"},{"department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-16T13:36:32Z","place":"Berlin, Heidelberg","citation":{"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>.","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>","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>","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>.","short":"F. Meyer auf der Heide, B. Vöcking, in: STACS 95, Berlin, Heidelberg, 1995."},"publication":"STACS 95","user_id":"15415","doi":"10.1007/3-540-59042-0_81","language":[{"iso":"eng"}],"_id":"16704","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540590422","9783540491750"]},"author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Vöcking","first_name":"Berthold","full_name":"Vöcking, Berthold"}],"year":"1995","title":"A packet routing protocol for arbitrary networks","status":"public"},{"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} }","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>.","short":"A. Czumaj, F. Meyer auf der Heide, V. Stemann, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 1995.","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>","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.","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>."},"publication":"Lecture Notes in Computer Science","date_created":"2020-04-16T13:40:52Z","place":"Berlin, Heidelberg","department":[{"_id":"63"}],"type":"book_chapter","publication_identifier":{"isbn":["9783540603139","9783540449133"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Stemann, Volker","last_name":"Stemann","first_name":"Volker"}],"title":"Shared memory simulations with triple-logarithmic delay","year":"1995","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:54Z","language":[{"iso":"eng"}],"_id":"16705","user_id":"15415","doi":"10.1007/3-540-60313-1_133"},{"user_id":"15415","doi":"10.1145/215399.215430","_id":"16706","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:54Z","status":"public","year":"1995","title":"Optimal trade-offs between size and slowdown for universal parallel networks","author":[{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"},{"last_name":"Storch","first_name":"Martin","full_name":"Storch, Martin"},{"full_name":"Wanka, Rolf","first_name":"Rolf","last_name":"Wanka"}],"publication_identifier":{"isbn":["0897917170"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-16T13:47:15Z","publication":"Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures  - SPAA '95","citation":{"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>.","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>","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>","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>."}}]