[{"title":"Real Hypercomputation and Continuity","doi":"10.1007/s00224-006-1343-6","date_updated":"2022-01-06T06:53:24Z","date_created":"2020-08-14T13:32:37Z","author":[{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"year":"2007","citation":{"bibtex":"@article{Ziegler_2007, title={Real Hypercomputation and Continuity}, DOI={<a href=\"https://doi.org/10.1007/s00224-006-1343-6\">10.1007/s00224-006-1343-6</a>}, journal={Theory of Computing Systems}, author={Ziegler, Martin}, year={2007}, pages={177–206} }","short":"M. Ziegler, Theory of Computing Systems (2007) 177–206.","mla":"Ziegler, Martin. “Real Hypercomputation and Continuity.” <i>Theory of Computing Systems</i>, 2007, pp. 177–206, doi:<a href=\"https://doi.org/10.1007/s00224-006-1343-6\">10.1007/s00224-006-1343-6</a>.","apa":"Ziegler, M. (2007). Real Hypercomputation and Continuity. <i>Theory of Computing Systems</i>, 177–206. <a href=\"https://doi.org/10.1007/s00224-006-1343-6\">https://doi.org/10.1007/s00224-006-1343-6</a>","chicago":"Ziegler, Martin. “Real Hypercomputation and Continuity.” <i>Theory of Computing Systems</i>, 2007, 177–206. <a href=\"https://doi.org/10.1007/s00224-006-1343-6\">https://doi.org/10.1007/s00224-006-1343-6</a>.","ieee":"M. Ziegler, “Real Hypercomputation and Continuity,” <i>Theory of Computing Systems</i>, pp. 177–206, 2007.","ama":"Ziegler M. Real Hypercomputation and Continuity. <i>Theory of Computing Systems</i>. 2007:177-206. doi:<a href=\"https://doi.org/10.1007/s00224-006-1343-6\">10.1007/s00224-006-1343-6</a>"},"page":"177-206","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"language":[{"iso":"eng"}],"_id":"17981","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems"},{"title":"Congestion, Dilation, and Energy in Radio Networks","doi":"10.1007/s00224-004-1124-z","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"full_name":"Volbert, Klaus","last_name":"Volbert","first_name":"Klaus"},{"first_name":"Matthias","last_name":"Grünewald","full_name":"Grünewald, Matthias"}],"date_created":"2020-04-08T11:17:35Z","year":"2004","citation":{"bibtex":"@article{Meyer auf der Heide_Schindelhauer_Volbert_Grünewald_2004, title={Congestion, Dilation, and Energy in Radio Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-004-1124-z\">10.1007/s00224-004-1124-z</a>}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Schindelhauer, Christian and Volbert, Klaus and Grünewald, Matthias}, year={2004}, pages={343–370} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Congestion, Dilation, and Energy in Radio Networks.” <i>Theory of Computing Systems</i>, 2004, pp. 343–70, doi:<a href=\"https://doi.org/10.1007/s00224-004-1124-z\">10.1007/s00224-004-1124-z</a>.","short":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, M. Grünewald, Theory of Computing Systems (2004) 343–370.","apa":"Meyer auf der Heide, F., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2004). Congestion, Dilation, and Energy in Radio Networks. <i>Theory of Computing Systems</i>, 343–370. <a href=\"https://doi.org/10.1007/s00224-004-1124-z\">https://doi.org/10.1007/s00224-004-1124-z</a>","chicago":"Meyer auf der Heide, Friedhelm, Christian Schindelhauer, Klaus Volbert, and Matthias Grünewald. “Congestion, Dilation, and Energy in Radio Networks.” <i>Theory of Computing Systems</i>, 2004, 343–70. <a href=\"https://doi.org/10.1007/s00224-004-1124-z\">https://doi.org/10.1007/s00224-004-1124-z</a>.","ieee":"F. Meyer auf der Heide, C. Schindelhauer, K. Volbert, and M. Grünewald, “Congestion, Dilation, and Energy in Radio Networks,” <i>Theory of Computing Systems</i>, pp. 343–370, 2004.","ama":"Meyer auf der Heide F, Schindelhauer C, Volbert K, Grünewald M. Congestion, Dilation, and Energy in Radio Networks. <i>Theory of Computing Systems</i>. 2004:343-370. doi:<a href=\"https://doi.org/10.1007/s00224-004-1124-z\">10.1007/s00224-004-1124-z</a>"},"page":"343-370","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"language":[{"iso":"eng"}],"_id":"16477","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems"},{"year":"2002","citation":{"bibtex":"@article{Krick_Meyer auf der Heide_Räcke_Vöcking_Westermann_2002, title={Data Management in Networks: Experimental Evaluation of a Provably Good Strategy}, DOI={<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>}, journal={Theory of Computing Systems}, author={Krick, Christof and Meyer auf der Heide, Friedhelm and Räcke, Harald and Vöcking, Bernhard and Westermann, Matthias’ }, year={2002}, pages={217–245} }","mla":"Krick, Christof, et al. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Theory of Computing Systems</i>, 2002, pp. 217–45, doi:<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>.","short":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, M. Westermann, Theory of Computing Systems (2002) 217–245.","apa":"Krick, C., Meyer auf der Heide, F., Räcke, H., Vöcking, B., &#38; Westermann, M. (2002). Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. <i>Theory of Computing Systems</i>, 217–245. <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">https://doi.org/10.1007/s00224-001-1045-z</a>","ama":"Krick C, Meyer auf der Heide F, Räcke H, Vöcking B, Westermann M. Data Management in Networks: Experimental Evaluation of a Provably Good Strategy. <i>Theory of Computing Systems</i>. Published online 2002:217-245. doi:<a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>","ieee":"C. Krick, F. Meyer auf der Heide, H. Räcke, B. Vöcking, and M. Westermann, “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy,” <i>Theory of Computing Systems</i>, pp. 217–245, 2002, doi: <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">10.1007/s00224-001-1045-z</a>.","chicago":"Krick, Christof, Friedhelm Meyer auf der Heide, Harald Räcke, Bernhard Vöcking, and Matthias’  Westermann. “Data Management in Networks: Experimental Evaluation of a Provably Good Strategy.” <i>Theory of Computing Systems</i>, 2002, 217–45. <a href=\"https://doi.org/10.1007/s00224-001-1045-z\">https://doi.org/10.1007/s00224-001-1045-z</a>."},"page":"217-245","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"title":"Data Management in Networks: Experimental Evaluation of a Provably Good Strategy","doi":"10.1007/s00224-001-1045-z","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:03:55Z","author":[{"first_name":"Christof","last_name":"Krick","full_name":"Krick, Christof"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Räcke","full_name":"Räcke, Harald","first_name":"Harald"},{"full_name":"Vöcking, Bernhard","last_name":"Vöcking","first_name":"Bernhard"},{"first_name":"Matthias' ","full_name":"Westermann, Matthias' ","last_name":"Westermann"}],"status":"public","type":"journal_article","publication":"Theory of Computing Systems","language":[{"iso":"eng"}],"_id":"16489","user_id":"15415","department":[{"_id":"63"}]},{"type":"journal_article","publication":"Theory of Computing Systems","status":"public","_id":"16586","user_id":"15701","department":[{"_id":"101"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"year":"2002","citation":{"bibtex":"@article{Elsässer_Monien_Preis_2002, title={Diffusion Schemes for Load Balancing on Heterogeneous Networks}, DOI={<a href=\"https://doi.org/10.1007/s00224-002-1056-4\">10.1007/s00224-002-1056-4</a>}, journal={Theory of Computing Systems}, author={Elsässer, Robert and Monien, Burkhard and Preis, Robert}, year={2002}, pages={305–320} }","mla":"Elsässer, Robert, et al. “Diffusion Schemes for Load Balancing on Heterogeneous Networks.” <i>Theory of Computing Systems</i>, 2002, pp. 305–20, doi:<a href=\"https://doi.org/10.1007/s00224-002-1056-4\">10.1007/s00224-002-1056-4</a>.","short":"R. Elsässer, B. Monien, R. Preis, Theory of Computing Systems (2002) 305–320.","apa":"Elsässer, R., Monien, B., &#38; Preis, R. (2002). Diffusion Schemes for Load Balancing on Heterogeneous Networks. <i>Theory of Computing Systems</i>, 305–320. <a href=\"https://doi.org/10.1007/s00224-002-1056-4\">https://doi.org/10.1007/s00224-002-1056-4</a>","ieee":"R. Elsässer, B. Monien, and R. Preis, “Diffusion Schemes for Load Balancing on Heterogeneous Networks,” <i>Theory of Computing Systems</i>, pp. 305–320, 2002.","chicago":"Elsässer, Robert, Burkhard Monien, and Robert Preis. “Diffusion Schemes for Load Balancing on Heterogeneous Networks.” <i>Theory of Computing Systems</i>, 2002, 305–20. <a href=\"https://doi.org/10.1007/s00224-002-1056-4\">https://doi.org/10.1007/s00224-002-1056-4</a>.","ama":"Elsässer R, Monien B, Preis R. Diffusion Schemes for Load Balancing on Heterogeneous Networks. <i>Theory of Computing Systems</i>. 2002:305-320. doi:<a href=\"https://doi.org/10.1007/s00224-002-1056-4\">10.1007/s00224-002-1056-4</a>"},"page":"305-320","date_updated":"2022-01-06T06:52:52Z","author":[{"first_name":"Robert","last_name":"Elsässer","full_name":"Elsässer, Robert"},{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"first_name":"Robert","full_name":"Preis, Robert","last_name":"Preis"}],"date_created":"2020-04-16T05:45:42Z","title":"Diffusion Schemes for Load Balancing on Heterogeneous Networks","doi":"10.1007/s00224-002-1056-4"},{"publication_identifier":{"issn":["1432-4350","1433-0490"]},"publication_status":"published","year":"1999","page":"281-300","citation":{"short":"P. Berenbrink, F. Meyer auf der Heide, K. Schröder, Theory of Computing Systems (1999) 281–300.","mla":"Berenbrink, P., et al. “Allocating Weighted Jobs in Parallel.” <i>Theory of Computing Systems</i>, 1999, pp. 281–300, doi:<a href=\"https://doi.org/10.1007/s002240000119\">10.1007/s002240000119</a>.","bibtex":"@article{Berenbrink_Meyer auf der Heide_Schröder_1999, title={Allocating Weighted Jobs in Parallel}, DOI={<a href=\"https://doi.org/10.1007/s002240000119\">10.1007/s002240000119</a>}, journal={Theory of Computing Systems}, author={Berenbrink, P. and Meyer auf der Heide, Friedhelm and Schröder, K.}, year={1999}, pages={281–300} }","apa":"Berenbrink, P., Meyer auf der Heide, F., &#38; Schröder, K. (1999). Allocating Weighted Jobs in Parallel. <i>Theory of Computing Systems</i>, 281–300. <a href=\"https://doi.org/10.1007/s002240000119\">https://doi.org/10.1007/s002240000119</a>","ama":"Berenbrink P, Meyer auf der Heide F, Schröder K. Allocating Weighted Jobs in Parallel. <i>Theory of Computing Systems</i>. 1999:281-300. doi:<a href=\"https://doi.org/10.1007/s002240000119\">10.1007/s002240000119</a>","ieee":"P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, “Allocating Weighted Jobs in Parallel,” <i>Theory of Computing Systems</i>, pp. 281–300, 1999.","chicago":"Berenbrink, P., Friedhelm Meyer auf der Heide, and K. Schröder. “Allocating Weighted Jobs in Parallel.” <i>Theory of Computing Systems</i>, 1999, 281–300. <a href=\"https://doi.org/10.1007/s002240000119\">https://doi.org/10.1007/s002240000119</a>."},"date_updated":"2022-01-06T06:52:52Z","author":[{"first_name":"P.","last_name":"Berenbrink","full_name":"Berenbrink, P."},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"first_name":"K.","last_name":"Schröder","full_name":"Schröder, K."}],"date_created":"2020-04-14T12:00:32Z","title":"Allocating Weighted Jobs in Parallel","doi":"10.1007/s002240000119","publication":"Theory of Computing Systems","type":"journal_article","status":"public","_id":"16502","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"user_id":"15415","department":[{"_id":"63"}],"_id":"16567","language":[{"iso":"eng"}],"type":"journal_article","publication":"Theory of Computing Systems","status":"public","author":[{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Storch, M.","last_name":"Storch","first_name":"M."},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"date_created":"2020-04-15T11:31:05Z","date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/s002240000071","title":"Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"citation":{"mla":"Meyer auf der Heide, Friedhelm, et al. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” <i>Theory of Computing Systems</i>, 1997, pp. 627–44, doi:<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>.","short":"F. Meyer auf der Heide, M. Storch, R. Wanka, Theory of Computing Systems (1997) 627–644.","bibtex":"@article{Meyer auf der Heide_Storch_Wanka_1997, title={Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks}, DOI={<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>}, journal={Theory of Computing Systems}, author={Meyer auf der Heide, Friedhelm and Storch, M. and Wanka, Rolf}, year={1997}, pages={627–644} }","apa":"Meyer auf der Heide, F., Storch, M., &#38; Wanka, R. (1997). Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. <i>Theory of Computing Systems</i>, 627–644. <a href=\"https://doi.org/10.1007/s002240000071\">https://doi.org/10.1007/s002240000071</a>","ama":"Meyer auf der Heide F, Storch M, Wanka R. Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks. <i>Theory of Computing Systems</i>. Published online 1997:627-644. doi:<a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>","ieee":"F. Meyer auf der Heide, M. Storch, and R. Wanka, “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks,” <i>Theory of Computing Systems</i>, pp. 627–644, 1997, doi: <a href=\"https://doi.org/10.1007/s002240000071\">10.1007/s002240000071</a>.","chicago":"Meyer auf der Heide, Friedhelm, M. Storch, and Rolf Wanka. “Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks.” <i>Theory of Computing Systems</i>, 1997, 627–44. <a href=\"https://doi.org/10.1007/s002240000071\">https://doi.org/10.1007/s002240000071</a>."},"page":"627-644","year":"1997"}]