[{"abstract":[{"text":"Multi-evaluation of the Coulomb potential induced by N particles is a central part of N-body simulations. In 3D, known subquadratic time algorithms return approximations up to given ABSOLUTE precision. By combining data structures from Computational Geometry with fast polynomial arithmetic, the present work obtains approximations of prescribable RELATIVE error e>0 in time O(1/e*N*polylog N).","lang":"eng"}],"publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"corporate_editor":["Algorithms and Data Structures. WADS 2003"],"year":"2003","title":"Fast Relative Approximation of Potential Fields","date_created":"2020-08-25T10:15:14Z","publisher":"Springer","status":"public","editor":[{"full_name":"Dehne, F.","last_name":"Dehne","first_name":"F."},{"first_name":"JR.","last_name":"Sack","full_name":"Sack, JR."},{"first_name":"M.","last_name":"Smid","full_name":"Smid, M."}],"type":"book_chapter","series_title":"Lecture Notes in Computer Science","user_id":"15415","department":[{"_id":"63"}],"_id":"18258","citation":{"mla":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” <i>Lecture Notes in Computer Science</i>, edited by F. Dehne et al., vol. 2748, Springer, 2003, doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>.","bibtex":"@inbook{Ziegler_2003, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Fast Relative Approximation of Potential Fields}, volume={2748}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer}, author={Ziegler, Martin}, editor={Dehne, F. and Sack, JR. and Smid, M. and Algorithms and Data Structures. WADS 2003Editors}, year={2003}, collection={Lecture Notes in Computer Science} }","short":"M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2003.","apa":"Ziegler, M. (2003). Fast Relative Approximation of Potential Fields. In F. Dehne, J. Sack, M. Smid, &#38; Algorithms and Data Structures. WADS 2003 (Eds.), <i>Lecture Notes in Computer Science</i> (Vol. 2748). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>","chicago":"Ziegler, Martin. “Fast Relative Approximation of Potential Fields.” In <i>Lecture Notes in Computer Science</i>, edited by F. Dehne, JR. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Vol. 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">https://doi.org/10.1007/978-3-540-45078-8_13</a>.","ieee":"M. Ziegler, “Fast Relative Approximation of Potential Fields,” in <i>Lecture Notes in Computer Science</i>, vol. 2748, F. Dehne, J. Sack, M. Smid, and Algorithms and Data Structures. WADS 2003, Eds. Berlin, Heidelberg: Springer, 2003.","ama":"Ziegler M. Fast Relative Approximation of Potential Fields. In: Dehne F, Sack J, Smid M, Algorithms and Data Structures. WADS 2003, eds. <i>Lecture Notes in Computer Science</i>. Vol 2748. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2003. doi:<a href=\"https://doi.org/10.1007/978-3-540-45078-8_13\">10.1007/978-3-540-45078-8_13</a>"},"intvolume":"      2748","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"isbn":["9783540405450","9783540450788"],"issn":["0302-9743","1611-3349"]},"doi":"10.1007/978-3-540-45078-8_13","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"volume":2748,"date_updated":"2022-01-06T06:53:28Z"},{"date_created":"2020-04-15T08:50:07Z","author":[{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"},{"full_name":"Preis, Robert","last_name":"Preis","first_name":"Robert"}],"date_updated":"2022-01-06T06:52:52Z","doi":"10.1007/3-540-45084-x_8","title":"Congestion and Almost Invariant Sets in Dynamical Systems","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540405542","9783540450849"]},"citation":{"mla":"Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-45084-x_8\">10.1007/3-540-45084-x_8</a>.","short":"M. Dellnitz, R. Preis, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.","bibtex":"@inbook{Dellnitz_Preis_2003, place={Berlin, Heidelberg}, title={Congestion and Almost Invariant Sets in Dynamical Systems}, DOI={<a href=\"https://doi.org/10.1007/3-540-45084-x_8\">10.1007/3-540-45084-x_8</a>}, booktitle={Lecture Notes in Computer Science}, author={Dellnitz, Michael and Preis, Robert}, year={2003} }","apa":"Dellnitz, M., &#38; Preis, R. (2003). Congestion and Almost Invariant Sets in Dynamical Systems. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45084-x_8\">https://doi.org/10.1007/3-540-45084-x_8</a>","chicago":"Dellnitz, Michael, and Robert Preis. “Congestion and Almost Invariant Sets in Dynamical Systems.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/3-540-45084-x_8\">https://doi.org/10.1007/3-540-45084-x_8</a>.","ieee":"M. Dellnitz and R. Preis, “Congestion and Almost Invariant Sets in Dynamical Systems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003.","ama":"Dellnitz M, Preis R. Congestion and Almost Invariant Sets in Dynamical Systems. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a href=\"https://doi.org/10.1007/3-540-45084-x_8\">10.1007/3-540-45084-x_8</a>"},"place":"Berlin, Heidelberg","year":"2003","user_id":"15701","department":[{"_id":"101"}],"_id":"16543","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public"},{"place":"Berlin, Heidelberg","year":"2003","citation":{"short":"O. Schütze, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.","mla":"Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_36\">10.1007/3-540-36970-8_36</a>.","bibtex":"@inbook{Schütze_2003, place={Berlin, Heidelberg}, title={A New Data Structure for the Nondominance Problem in Multi-objective Optimization}, DOI={<a href=\"https://doi.org/10.1007/3-540-36970-8_36\">10.1007/3-540-36970-8_36</a>}, booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver}, year={2003} }","apa":"Schütze, O. (2003). A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36970-8_36\">https://doi.org/10.1007/3-540-36970-8_36</a>","ama":"Schütze O. A New Data Structure for the Nondominance Problem in Multi-objective Optimization. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_36\">10.1007/3-540-36970-8_36</a>","chicago":"Schütze, Oliver. “A New Data Structure for the Nondominance Problem in Multi-Objective Optimization.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/3-540-36970-8_36\">https://doi.org/10.1007/3-540-36970-8_36</a>.","ieee":"O. Schütze, “A New Data Structure for the Nondominance Problem in Multi-objective Optimization,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003."},"publication_status":"published","publication_identifier":{"isbn":["9783540018698","9783540369707"],"issn":["0302-9743"]},"title":"A New Data Structure for the Nondominance Problem in Multi-objective Optimization","doi":"10.1007/3-540-36970-8_36","date_updated":"2022-01-06T06:52:54Z","author":[{"full_name":"Schütze, Oliver","last_name":"Schütze","first_name":"Oliver"}],"date_created":"2020-04-16T09:57:05Z","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"_id":"16664","user_id":"15701","department":[{"_id":"101"}]},{"user_id":"15701","department":[{"_id":"101"}],"_id":"16665","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","date_created":"2020-04-16T09:58:10Z","author":[{"first_name":"Oliver","full_name":"Schütze, Oliver","last_name":"Schütze"},{"last_name":"Mostaghim","full_name":"Mostaghim, Sanaz","first_name":"Sanaz"},{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"},{"first_name":"Jürgen","last_name":"Teich","full_name":"Teich, Jürgen"}],"date_updated":"2022-01-06T06:52:54Z","doi":"10.1007/3-540-36970-8_9","title":"Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques","publication_status":"published","publication_identifier":{"isbn":["9783540018698","9783540369707"],"issn":["0302-9743"]},"citation":{"apa":"Schütze, O., Mostaghim, S., Dellnitz, M., &#38; Teich, J. (2003). Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36970-8_9\">https://doi.org/10.1007/3-540-36970-8_9</a>","mla":"Schütze, Oliver, et al. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” <i>Lecture Notes in Computer Science</i>, 2003, doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_9\">10.1007/3-540-36970-8_9</a>.","bibtex":"@inbook{Schütze_Mostaghim_Dellnitz_Teich_2003, place={Berlin, Heidelberg}, title={Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques}, DOI={<a href=\"https://doi.org/10.1007/3-540-36970-8_9\">10.1007/3-540-36970-8_9</a>}, booktitle={Lecture Notes in Computer Science}, author={Schütze, Oliver and Mostaghim, Sanaz and Dellnitz, Michael and Teich, Jürgen}, year={2003} }","short":"O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.","chicago":"Schütze, Oliver, Sanaz Mostaghim, Michael Dellnitz, and Jürgen Teich. “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/3-540-36970-8_9\">https://doi.org/10.1007/3-540-36970-8_9</a>.","ieee":"O. Schütze, S. Mostaghim, M. Dellnitz, and J. Teich, “Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2003.","ama":"Schütze O, Mostaghim S, Dellnitz M, Teich J. Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2003. doi:<a href=\"https://doi.org/10.1007/3-540-36970-8_9\">10.1007/3-540-36970-8_9</a>"},"place":"Berlin, Heidelberg","year":"2003"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540200475","9783540394037"]},"publication_status":"published","year":"2003","page":"400-410","citation":{"chicago":"Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.” In <i>Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003</i>, 400–410. Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-39403-7_30\">https://doi.org/10.1007/978-3-540-39403-7_30</a>.","ieee":"S. Böttcher and R. Steinmetz, “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients,” in <i>Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003</i>, 2003, pp. 400–410.","ama":"Böttcher S, Steinmetz R. Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients. In: <i>Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003</i>. Springer; 2003:400-410. doi:<a href=\"https://doi.org/10.1007/978-3-540-39403-7_30\">10.1007/978-3-540-39403-7_30</a>","short":"S. Böttcher, R. Steinmetz, in: Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–410.","bibtex":"@inproceedings{Böttcher_Steinmetz_2003, title={Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-39403-7_30\">10.1007/978-3-540-39403-7_30</a>}, booktitle={Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2003}, pages={400–410} }","mla":"Böttcher, Stefan, and Rita Steinmetz. “Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients.” <i>Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003</i>, Springer, 2003, pp. 400–10, doi:<a href=\"https://doi.org/10.1007/978-3-540-39403-7_30\">10.1007/978-3-540-39403-7_30</a>.","apa":"Böttcher, S., &#38; Steinmetz, R. (2003). Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients. In <i>Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003</i> (pp. 400–410). Springer. <a href=\"https://doi.org/10.1007/978-3-540-39403-7_30\">https://doi.org/10.1007/978-3-540-39403-7_30</a>"},"publisher":"Springer","date_updated":"2022-01-06T06:52:15Z","author":[{"first_name":"Stefan","last_name":"Böttcher","full_name":"Böttcher, Stefan","id":"624"},{"last_name":"Steinmetz","full_name":"Steinmetz, Rita","id":"14961","first_name":"Rita"}],"date_created":"2019-11-21T14:33:56Z","title":"Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients","doi":"10.1007/978-3-540-39403-7_30","publication":"Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003","type":"conference","status":"public","_id":"15077","department":[{"_id":"69"}],"user_id":"14961","language":[{"iso":"eng"}]},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540200550","9783540394297"]},"publication_status":"published","year":"2003","place":"Berlin, Heidelberg","page":"85-99","citation":{"ieee":"S. Böttcher and R. Steinmetz, “A DTD Graph Based XPath Query Subsumption Test,” in <i>Database and XML Technologies, First International XML Database Symposium, XSym 2003</i>, 2003, pp. 85–99.","chicago":"Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.” In <i>Database and XML Technologies, First International XML Database Symposium, XSym 2003</i>, 85–99. Berlin, Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-39429-7_6\">https://doi.org/10.1007/978-3-540-39429-7_6</a>.","ama":"Böttcher S, Steinmetz R. A DTD Graph Based XPath Query Subsumption Test. In: <i>Database and XML Technologies, First International XML Database Symposium, XSym 2003</i>. Berlin, Heidelberg; 2003:85-99. doi:<a href=\"https://doi.org/10.1007/978-3-540-39429-7_6\">10.1007/978-3-540-39429-7_6</a>","mla":"Böttcher, Stefan, and Rita Steinmetz. “A DTD Graph Based XPath Query Subsumption Test.” <i>Database and XML Technologies, First International XML Database Symposium, XSym 2003</i>, 2003, pp. 85–99, doi:<a href=\"https://doi.org/10.1007/978-3-540-39429-7_6\">10.1007/978-3-540-39429-7_6</a>.","bibtex":"@inproceedings{Böttcher_Steinmetz_2003, place={Berlin, Heidelberg}, title={A DTD Graph Based XPath Query Subsumption Test}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-39429-7_6\">10.1007/978-3-540-39429-7_6</a>}, booktitle={Database and XML Technologies, First International XML Database Symposium, XSym 2003}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2003}, pages={85–99} }","short":"S. Böttcher, R. Steinmetz, in: Database and XML Technologies, First International XML Database Symposium, XSym 2003, Berlin, Heidelberg, 2003, pp. 85–99.","apa":"Böttcher, S., &#38; Steinmetz, R. (2003). A DTD Graph Based XPath Query Subsumption Test. In <i>Database and XML Technologies, First International XML Database Symposium, XSym 2003</i> (pp. 85–99). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-39429-7_6\">https://doi.org/10.1007/978-3-540-39429-7_6</a>"},"date_updated":"2022-01-06T06:52:15Z","date_created":"2019-11-21T14:39:48Z","author":[{"first_name":"Stefan","full_name":"Böttcher, Stefan","id":"624","last_name":"Böttcher"},{"full_name":"Steinmetz, Rita","id":"14961","last_name":"Steinmetz","first_name":"Rita"}],"title":"A DTD Graph Based XPath Query Subsumption Test","doi":"10.1007/978-3-540-39429-7_6","publication":"Database and XML Technologies, First International XML Database Symposium, XSym 2003","type":"conference","status":"public","_id":"15078","department":[{"_id":"69"}],"user_id":"14961","language":[{"iso":"eng"}]},{"publication":"Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)","type":"conference","status":"public","department":[{"_id":"78"}],"user_id":"398","_id":"13615","extern":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540408222","9783540452348"]},"publication_status":"published","page":"575-584","citation":{"short":"C. Steiger, H. Walder, M. Platzner, in: Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin, Heidelberg, 2003, pp. 575–584.","bibtex":"@inproceedings{Steiger_Walder_Platzner_2003, place={Berlin, Heidelberg}, title={Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45234-8_56\">10.1007/978-3-540-45234-8_56</a>}, booktitle={Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)}, publisher={Springer}, author={Steiger, Christoph and Walder, Herbert and Platzner, Marco}, year={2003}, pages={575–584} }","mla":"Steiger, Christoph, et al. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.” <i>Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)</i>, Springer, 2003, pp. 575–84, doi:<a href=\"https://doi.org/10.1007/978-3-540-45234-8_56\">10.1007/978-3-540-45234-8_56</a>.","apa":"Steiger, C., Walder, H., &#38; Platzner, M. (2003). Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In <i>Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)</i> (pp. 575–584). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-45234-8_56\">https://doi.org/10.1007/978-3-540-45234-8_56</a>","ama":"Steiger C, Walder H, Platzner M. Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices. In: <i>Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)</i>. Berlin, Heidelberg: Springer; 2003:575-584. doi:<a href=\"https://doi.org/10.1007/978-3-540-45234-8_56\">10.1007/978-3-540-45234-8_56</a>","chicago":"Steiger, Christoph, Herbert Walder, and Marco Platzner. “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices.” In <i>Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)</i>, 575–84. Berlin, Heidelberg: Springer, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45234-8_56\">https://doi.org/10.1007/978-3-540-45234-8_56</a>.","ieee":"C. Steiger, H. Walder, and M. Platzner, “Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices,” in <i>Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL)</i>, 2003, pp. 575–584."},"year":"2003","place":"Berlin, Heidelberg","date_created":"2019-10-04T21:20:41Z","author":[{"last_name":"Steiger","full_name":"Steiger, Christoph","first_name":"Christoph"},{"first_name":"Herbert","full_name":"Walder, Herbert","last_name":"Walder"},{"first_name":"Marco","last_name":"Platzner","full_name":"Platzner, Marco","id":"398"}],"date_updated":"2022-01-06T06:51:40Z","publisher":"Springer","doi":"10.1007/978-3-540-45234-8_56","title":"Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices"},{"department":[{"_id":"63"}],"user_id":"15415","_id":"19850","language":[{"iso":"eng"}],"publication":"Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)","type":"conference","status":"public","author":[{"first_name":"Rolf","last_name":"Wanka","full_name":"Wanka, Rolf"}],"date_created":"2020-10-02T11:16:31Z","date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/3-540-36379-3_36","title":"Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540003311","9783540363798"]},"publication_status":"published","page":"413-420","citation":{"apa":"Wanka, R. (2002). Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i> (pp. 413–420). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-36379-3_36\">https://doi.org/10.1007/3-540-36379-3_36</a>","bibtex":"@inproceedings{Wanka_2002, place={Berlin, Heidelberg}, title={Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal}, DOI={<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>}, booktitle={Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, author={Wanka, Rolf}, year={2002}, pages={413–420} }","short":"R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.","mla":"Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 2002, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>.","ama":"Wanka R. Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal. In: <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>. Berlin, Heidelberg; 2002:413-420. doi:<a href=\"https://doi.org/10.1007/3-540-36379-3_36\">10.1007/3-540-36379-3_36</a>","chicago":"Wanka, Rolf. “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal.” In <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 413–20. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-36379-3_36\">https://doi.org/10.1007/3-540-36379-3_36</a>.","ieee":"R. Wanka, “Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal,” in <i>Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG)</i>, 2002, pp. 413–420."},"year":"2002","place":"Berlin, Heidelberg"},{"doi":"10.1007/3-540-45706-2_134","title":"Distributed Maintenance of Resource Efficient Wireless Network Topologies","author":[{"first_name":"Matthias","full_name":"Grünewald, Matthias","last_name":"Grünewald"},{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"},{"first_name":"Klaus","last_name":"Volbert","full_name":"Volbert, Klaus"}],"date_created":"2021-09-14T09:15:57Z","date_updated":"2022-01-06T06:56:18Z","citation":{"chicago":"Grünewald, Matthias, Tamás Lukovszki, Christian Schindelhauer, and Klaus Volbert. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” In <i>Proceedings of the 8th International Euro-Par Conference</i>. Paderborn, Germany, 2002. <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">https://doi.org/10.1007/3-540-45706-2_134</a>.","ieee":"M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,” 2002, doi: <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>.","ama":"Grünewald M, Lukovszki T, Schindelhauer C, Volbert K. Distributed Maintenance of Resource Efficient Wireless Network Topologies. In: <i>Proceedings of the 8th International Euro-Par Conference</i>. ; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>","short":"M. Grünewald, T. Lukovszki, C. Schindelhauer, K. Volbert, in: Proceedings of the 8th International Euro-Par Conference, Paderborn, Germany, 2002.","bibtex":"@inproceedings{Grünewald_Lukovszki_Schindelhauer_Volbert_2002, place={Paderborn, Germany}, title={Distributed Maintenance of Resource Efficient Wireless Network Topologies}, DOI={<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>}, booktitle={Proceedings of the 8th International Euro-Par Conference}, author={Grünewald, Matthias and Lukovszki, Tamás and Schindelhauer, Christian and Volbert, Klaus}, year={2002} }","mla":"Grünewald, Matthias, et al. “Distributed Maintenance of Resource Efficient Wireless Network Topologies.” <i>Proceedings of the 8th International Euro-Par Conference</i>, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_134\">10.1007/3-540-45706-2_134</a>.","apa":"Grünewald, M., Lukovszki, T., Schindelhauer, C., &#38; Volbert, K. (2002). Distributed Maintenance of Resource Efficient Wireless Network Topologies. <i>Proceedings of the 8th International Euro-Par Conference</i>. <a href=\"https://doi.org/10.1007/3-540-45706-2_134\">https://doi.org/10.1007/3-540-45706-2_134</a>"},"place":"Paderborn, Germany","year":"2002","publication_identifier":{"issn":["0302-9743"]},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"24338","status":"public","publication":"Proceedings of the 8th International Euro-Par Conference","type":"conference"},{"status":"public","abstract":[{"lang":"eng","text":"We analyze a randomized pursuit-evasion game on graphs. This game is played by two players, a hunter and a rabbit. Let G be any connected, undirected graph with n nodes. The game is played in rounds and in each round both the hunter and the rabbit are located at a node of the graph. Between rounds both the hunter and the rabbit can stay at the current node or move to another node. The hunter is assumed to be restricted to the graph G: in every round, the hunter can move using at most one edge. For the rabbit we investigate two models: in one model the rabbit is restricted to the same graph as the hunter, and in the other model the rabbit is unrestricted, i.e., it can jump to an arbitrary node in every round.\r\n\r\nWe say that the rabbit is caught as soon as hunter and rabbit are located at the same node in a round. The goal of the hunter is to catch the rabbit in as few rounds as possible, whereas the rabbit aims to maximize the number of rounds until it is caught. Given a randomized hunter strategy for G, the escape length for that strategy is the worst case expected number of rounds it takes the hunter to catch the rabbit, where the worst case is with regards to all (possibly randomized) rabbit strategies. Our main result is a hunter strategy for general graphs with an escape length of only O\r\n(n log (diam(G))) against restricted as well as unrestricted rabbits. This bound is close to optimal since Ω(n) is a trivial lower bound on the escape length in both models. Furthermore, we prove that our upper bound is optimal up to constant factors against unrestricted rabbits."}],"publication":"Proceedings of the 29th International Colloquium on Automata, Languages and Programming","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18566","citation":{"ama":"Adler M, Räcke H, Sivadasan N, Sohler C, Vöcking B. Randomized Pursuit-Evasion in Graphs. In: <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>","ieee":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>, 2002.","chicago":"Adler, Micah, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. “Randomized Pursuit-Evasion in Graphs.” In <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-45465-9_77\">https://doi.org/10.1007/3-540-45465-9_77</a>.","bibtex":"@inproceedings{Adler_Räcke_Sivadasan_Sohler_Vöcking_2002, place={Berlin, Heidelberg}, title={Randomized Pursuit-Evasion in Graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>}, booktitle={Proceedings of the 29th International Colloquium on Automata, Languages and Programming}, author={Adler, Micah and Räcke, Harald and Sivadasan, Naveen and Sohler, Christian and Vöcking, Berthold}, year={2002} }","short":"M. Adler, H. Räcke, N. Sivadasan, C. Sohler, B. Vöcking, in: Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Berlin, Heidelberg, 2002.","mla":"Adler, Micah, et al. “Randomized Pursuit-Evasion in Graphs.” <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45465-9_77\">10.1007/3-540-45465-9_77</a>.","apa":"Adler, M., Räcke, H., Sivadasan, N., Sohler, C., &#38; Vöcking, B. (2002). Randomized Pursuit-Evasion in Graphs. In <i>Proceedings of the 29th International Colloquium on Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45465-9_77\">https://doi.org/10.1007/3-540-45465-9_77</a>"},"year":"2002","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540438649","9783540454656"]},"publication_status":"published","doi":"10.1007/3-540-45465-9_77","title":"Randomized Pursuit-Evasion in Graphs","date_created":"2020-08-28T12:04:12Z","author":[{"last_name":"Adler","full_name":"Adler, Micah","first_name":"Micah"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"first_name":"Naveen","full_name":"Sivadasan, Naveen","last_name":"Sivadasan"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"},{"full_name":"Vöcking, Berthold","last_name":"Vöcking","first_name":"Berthold"}],"date_updated":"2022-01-06T06:53:40Z"},{"doi":"10.1007/3-540-45706-2_133","title":"Mobile Computing, Mobile Networks","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"},{"first_name":"Mohan","last_name":"Kumar","full_name":"Kumar, Mohan"},{"first_name":"Sotiris","full_name":"Nikoletseas, Sotiris","last_name":"Nikoletseas"},{"first_name":"Paul","full_name":"Spirakis, Paul","last_name":"Spirakis"}],"date_created":"2020-04-17T11:40:33Z","date_updated":"2022-01-06T06:52:55Z","citation":{"apa":"Meyer auf der Heide, F., Kumar, M., Nikoletseas, S., &#38; Spirakis, P. (2002). Mobile Computing, Mobile Networks. In <i>Euro-Par 2002 Parallel Processing</i> (Lecture Notes in Computer Science, vol 2400). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45706-2_133\">https://doi.org/10.1007/3-540-45706-2_133</a>","bibtex":"@inbook{Meyer auf der Heide_Kumar_Nikoletseas_Spirakis_2002, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science, vol 2400}, title={Mobile Computing, Mobile Networks}, DOI={<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>}, booktitle={Euro-Par 2002 Parallel Processing}, author={Meyer auf der Heide, Friedhelm and Kumar, Mohan and Nikoletseas, Sotiris and Spirakis, Paul}, year={2002} }","mla":"Meyer auf der Heide, Friedhelm, et al. “Mobile Computing, Mobile Networks.” <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400, 2002, doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>.","short":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, P. Spirakis, in: Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400, Berlin, Heidelberg, 2002.","ieee":"F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.","chicago":"Meyer auf der Heide, Friedhelm, Mohan Kumar, Sotiris Nikoletseas, and Paul Spirakis. “Mobile Computing, Mobile Networks.” In <i>Euro-Par 2002 Parallel Processing</i>, Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg, 2002. <a href=\"https://doi.org/10.1007/3-540-45706-2_133\">https://doi.org/10.1007/3-540-45706-2_133</a>.","ama":"Meyer auf der Heide F, Kumar M, Nikoletseas S, Spirakis P. Mobile Computing, Mobile Networks. In: <i>Euro-Par 2002 Parallel Processing</i>. Lecture Notes in Computer Science, vol 2400. Berlin, Heidelberg; 2002. doi:<a href=\"https://doi.org/10.1007/3-540-45706-2_133\">10.1007/3-540-45706-2_133</a>"},"year":"2002","place":"Berlin, Heidelberg","edition":"Lecture Notes in Computer Science, vol 2400","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540440499","9783540457060"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16723","status":"public","type":"book_chapter","publication":"Euro-Par 2002 Parallel Processing"},{"user_id":"15415","department":[{"_id":"63"}],"_id":"18749","language":[{"iso":"eng"}],"type":"journal_article","publication":"Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)","status":"public","date_created":"2020-09-01T10:48:38Z","author":[{"first_name":"Artur","full_name":"Czumaj, Artur","last_name":"Czumaj"},{"first_name":"Christian","full_name":"Sohler, Christian","last_name":"Sohler"}],"date_updated":"2022-01-06T06:53:51Z","doi":"10.1007/3-540-48224-5_41","title":"Testing Hypergraph Coloring","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422877","9783540482246"]},"citation":{"bibtex":"@article{Czumaj_Sohler_2001, title={Testing Hypergraph Coloring}, DOI={<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>}, journal={Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)}, author={Czumaj, Artur and Sohler, Christian}, year={2001}, pages={493–505} }","mla":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, pp. 493–505, doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>.","short":"A. Czumaj, C. Sohler, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP) (2001) 493–505.","apa":"Czumaj, A., &#38; Sohler, C. (2001). Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>","ama":"Czumaj A, Sohler C. Testing Hypergraph Coloring. <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>. 2001:493-505. doi:<a href=\"https://doi.org/10.1007/3-540-48224-5_41\">10.1007/3-540-48224-5_41</a>","chicago":"Czumaj, Artur, and Christian Sohler. “Testing Hypergraph Coloring.” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2001, 493–505. <a href=\"https://doi.org/10.1007/3-540-48224-5_41\">https://doi.org/10.1007/3-540-48224-5_41</a>.","ieee":"A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” <i>Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP)</i>, pp. 493–505, 2001."},"page":"493-505","year":"2001"},{"status":"public","publication":"Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS","type":"conference","language":[{"iso":"eng"}],"_id":"18964","department":[{"_id":"63"}],"user_id":"15415","year":"2001","citation":{"bibtex":"@inproceedings{Lukovszki_Maheshwari_Zeh_2001, title={I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems}, DOI={<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>}, booktitle={Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS}, author={Lukovszki, Tamás and Maheshwari, Anil and Zeh, Norbert}, year={2001} }","short":"T. Lukovszki, A. Maheshwari, N. Zeh, in: Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS, 2001.","mla":"Lukovszki, Tamás, et al. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>.","apa":"Lukovszki, T., Maheshwari, A., &#38; Zeh, N. (2001). I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>. <a href=\"https://doi.org/10.1007/3-540-45294-x_21\">https://doi.org/10.1007/3-540-45294-x_21</a>","ieee":"T. Lukovszki, A. Maheshwari, and N. Zeh, “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems,” in <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001.","chicago":"Lukovszki, Tamás, Anil Maheshwari, and Norbert Zeh. “I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems.” In <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>, 2001. <a href=\"https://doi.org/10.1007/3-540-45294-x_21\">https://doi.org/10.1007/3-540-45294-x_21</a>.","ama":"Lukovszki T, Maheshwari A, Zeh N. I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. In: <i>Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2001), LNCS</i>. ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45294-x_21\">10.1007/3-540-45294-x_21</a>"},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540430025","9783540452942"]},"publication_status":"published","title":"I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems","doi":"10.1007/3-540-45294-x_21","date_updated":"2022-01-06T06:53:55Z","date_created":"2020-09-03T13:26:01Z","author":[{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"full_name":"Maheshwari, Anil","last_name":"Maheshwari","first_name":"Anil"},{"last_name":"Zeh","full_name":"Zeh, Norbert","first_name":"Norbert"}]},{"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540421979","9783540453352"]},"citation":{"apa":"Ziegler, M., &#38; Brattka, V. (2001). A Computable Spectral Theorem. In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i> (Vol. 2064, pp. 378–388). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>","bibtex":"@inproceedings{Ziegler_Brattka_2001, place={Berlin, Heidelberg}, title={A Computable Spectral Theorem}, volume={2064}, DOI={<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>}, booktitle={Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)}, author={Ziegler, Martin and Brattka, Vasco}, year={2001}, pages={378–388} }","short":"M. Ziegler, V. Brattka, in: Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000), Berlin, Heidelberg, 2001, pp. 378–388.","mla":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, vol. 2064, 2001, pp. 378–88, doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>.","ama":"Ziegler M, Brattka V. A Computable Spectral Theorem. In: <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>. Vol 2064. Berlin, Heidelberg; 2001:378-388. doi:<a href=\"https://doi.org/10.1007/3-540-45335-0_23\">10.1007/3-540-45335-0_23</a>","ieee":"M. Ziegler and V. Brattka, “A Computable Spectral Theorem,” in <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2001, vol. 2064, pp. 378–388.","chicago":"Ziegler, Martin, and Vasco Brattka. “A Computable Spectral Theorem.” In <i>Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA’2000)</i>, 2064:378–88. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45335-0_23\">https://doi.org/10.1007/3-540-45335-0_23</a>."},"intvolume":"      2064","page":"378-388","year":"2001","place":"Berlin, Heidelberg","date_created":"2020-08-24T10:14:06Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"first_name":"Vasco","last_name":"Brattka","full_name":"Brattka, Vasco"}],"volume":2064,"date_updated":"2022-01-06T06:53:26Z","doi":"10.1007/3-540-45335-0_23","title":"A Computable Spectral Theorem","type":"conference","publication":"Proceedings of the 4th Workshop on Computability and Complexity in Analysis (CCA'2000)","status":"public","abstract":[{"text":"Computing the spectral decomposition of a normal matrix is among the most frequent tasks to numerical mathematics. A vast range of methods are employed to do so, but all of them suffer from instabilities when applied to degenerate matrices, i.e., those having multiple eigenvalues. We investigate the spectral representation's effectivity properties on the sound formal basis of computable analysis. It turns out that in general the eigenvectors cannot be computed from a given matrix. If however the size of the matrix' spectrum (=number of different eigenvalues) is known in advance, it can be diagonalized effectively. Thus, in principle the spectral decomposition can be computed under remarkably weak non-degeneracy conditions.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18152","language":[{"iso":"eng"}]},{"year":"2001","place":"Berlin, Heidelberg","citation":{"chicago":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” In <i>Graph-Theoretic Concepts in Computer Science</i>, Vol. 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>.","ieee":"F. Meyer auf der Heide, “Data Management in Networks,” in <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, Berlin, Heidelberg, 2001.","ama":"Meyer auf der Heide F. Data Management in Networks. In: <i>Graph-Theoretic Concepts in Computer Science</i>. Vol 2204.  Lecture Notes in Computer Science. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>","apa":"Meyer auf der Heide, F. (2001). Data Management in Networks. In <i>Graph-Theoretic Concepts in Computer Science</i> (Vol. 2204). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45477-2_2\">https://doi.org/10.1007/3-540-45477-2_2</a>","bibtex":"@inbook{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Data Management in Networks}, volume={2204}, DOI={<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>}, booktitle={Graph-Theoretic Concepts in Computer Science}, author={Meyer auf der Heide, Friedhelm}, year={2001}, collection={ Lecture Notes in Computer Science} }","mla":"Meyer auf der Heide, Friedhelm. “Data Management in Networks.” <i>Graph-Theoretic Concepts in Computer Science</i>, vol. 2204, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45477-2_2\">10.1007/3-540-45477-2_2</a>.","short":"F. Meyer auf der Heide, in: Graph-Theoretic Concepts in Computer Science, Berlin, Heidelberg, 2001."},"intvolume":"      2204","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540427070","9783540454779"]},"title":"Data Management in Networks","doi":"10.1007/3-540-45477-2_2","date_updated":"2022-01-06T06:52:51Z","date_created":"2020-04-09T10:40:48Z","author":[{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"volume":2204,"status":"public","type":"book_chapter","publication":"Graph-Theoretic Concepts in Computer Science","language":[{"iso":"eng"}],"_id":"16493","series_title":" Lecture Notes in Computer Science","user_id":"15415","department":[{"_id":"63"}]},{"_id":"16494","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Computational Science - ICCS 2001","status":"public","date_updated":"2022-01-06T06:52:51Z","author":[{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"}],"date_created":"2020-04-09T10:51:36Z","title":"Parallel Bridging Models and Their Impact on Algorithm Design","doi":"10.1007/3-540-45718-6_68","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540422334","9783540457183"]},"year":"2001","place":"Berlin, Heidelberg","citation":{"apa":"Meyer auf der Heide, F., &#38; Wanka, R. (2001). Parallel Bridging Models and Their Impact on Algorithm Design. In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>","short":"F. Meyer auf der Heide, R. Wanka, in: Computational Science - ICCS 2001, Berlin, Heidelberg, 2001.","mla":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” <i>Computational Science - ICCS 2001</i>, 2001, doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>.","bibtex":"@inbook{Meyer auf der Heide_Wanka_2001, place={Berlin, Heidelberg}, title={Parallel Bridging Models and Their Impact on Algorithm Design}, DOI={<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>}, booktitle={Computational Science - ICCS 2001}, author={Meyer auf der Heide, Friedhelm and Wanka, Rolf}, year={2001} }","chicago":"Meyer auf der Heide, Friedhelm, and Rolf Wanka. “Parallel Bridging Models and Their Impact on Algorithm Design.” In <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg, 2001. <a href=\"https://doi.org/10.1007/3-540-45718-6_68\">https://doi.org/10.1007/3-540-45718-6_68</a>.","ieee":"F. Meyer auf der Heide and R. Wanka, “Parallel Bridging Models and Their Impact on Algorithm Design,” in <i>Computational Science - ICCS 2001</i>, Berlin, Heidelberg, 2001.","ama":"Meyer auf der Heide F, Wanka R. Parallel Bridging Models and Their Impact on Algorithm Design. In: <i>Computational Science - ICCS 2001</i>. Berlin, Heidelberg; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-45718-6_68\">10.1007/3-540-45718-6_68</a>"}},{"editor":[{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"}],"status":"public","type":"book_editor","language":[{"iso":"eng"}],"_id":"16722","user_id":"15415","department":[{"_id":"63"}],"year":"2001","place":"Berlin, Heidelberg","citation":{"apa":"Meyer auf der Heide, F. (Ed.). (2001). <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i> (Lecture Notes in Computer Science (LNCS, volume 2161)). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>","bibtex":"@book{Meyer auf der Heide_2001, place={Berlin, Heidelberg}, edition={Lecture Notes in Computer Science (LNCS, volume 2161)}, title={Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark}, DOI={<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>}, publisher={Springer }, year={2001} }","mla":"Meyer auf der Heide, Friedhelm, editor. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161), Springer , 2001, doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>.","short":"F. Meyer auf der Heide, ed., Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark, Lecture Notes in Computer Science (LNCS, volume 2161), Springer , Berlin, Heidelberg, 2001.","ama":"Meyer auf der Heide F, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, volume 2161). Berlin, Heidelberg: Springer ; 2001. doi:<a href=\"https://doi.org/10.1007/3-540-44676-1\">10.1007/3-540-44676-1</a>","ieee":"F. Meyer auf der Heide, Ed., <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>, Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001.","chicago":"Meyer auf der Heide, Friedhelm, ed. <i>Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark</i>. Lecture Notes in Computer Science (LNCS, Volume 2161). Berlin, Heidelberg: Springer , 2001. <a href=\"https://doi.org/10.1007/3-540-44676-1\">https://doi.org/10.1007/3-540-44676-1</a>."},"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424932","9783540446767"]},"edition":"Lecture Notes in Computer Science (LNCS, volume 2161)","title":"Algorithms — ESA 2001, 9th Annual European Symposium Århus, Denmark","doi":"10.1007/3-540-44676-1","publisher":"Springer ","date_updated":"2022-01-06T06:52:55Z","date_created":"2020-04-17T10:59:08Z"},{"publication":"Automata, Languages and Programming","type":"book_chapter","status":"public","_id":"3023","department":[{"_id":"64"}],"user_id":"25078","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540677154","9783540450221"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2000","page":"248-259","citation":{"apa":"Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In <i>Automata, Languages and Programming</i> (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45022-x_22\">https://doi.org/10.1007/3-540-45022-x_22</a>","mla":"Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” <i>Automata, Languages and Programming</i>, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:<a href=\"https://doi.org/10.1007/3-540-45022-x_22\">10.1007/3-540-45022-x_22</a>.","bibtex":"@inbook{Blömer_2000, place={Berlin, Heidelberg}, title={Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}, DOI={<a href=\"https://doi.org/10.1007/3-540-45022-x_22\">10.1007/3-540-45022-x_22</a>}, booktitle={Automata, Languages and Programming}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2000}, pages={248–259} }","short":"J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.","ieee":"J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.","chicago":"Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In <i>Automata, Languages and Programming</i>, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. <a href=\"https://doi.org/10.1007/3-540-45022-x_22\">https://doi.org/10.1007/3-540-45022-x_22</a>.","ama":"Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:<a href=\"https://doi.org/10.1007/3-540-45022-x_22\">10.1007/3-540-45022-x_22</a>"},"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","date_created":"2018-06-05T08:27:28Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"title":"Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices","doi":"10.1007/3-540-45022-x_22"},{"volume":4698,"author":[{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"date_updated":"2022-01-06T06:53:24Z","doi":"10.1007/3-540-45253-2_15","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540410041","9783540452539"]},"publication_status":"published","page":"155-166","intvolume":"      4698","citation":{"short":"A. Czumaj, C. Sohler, M. Ziegler, in: Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00), Springer, Berlin, Heidelberg, 2000, pp. 155–166.","mla":"Czumaj, Artur, et al. “Property Testing in Computational Geometry.” <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, vol. 4698, Springer, 2000, pp. 155–66, doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>.","bibtex":"@inproceedings{Czumaj_Sohler_Ziegler_2000, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Property Testing in Computational Geometry}, volume={4698}, DOI={<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>}, booktitle={Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)}, publisher={Springer}, author={Czumaj, Artur and Sohler, Christian and Ziegler, Martin}, year={2000}, pages={155–166}, collection={Lecture Notes in Computer Science} }","apa":"Czumaj, A., Sohler, C., &#38; Ziegler, M. (2000). Property Testing in Computational Geometry. In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i> (Vol. 4698, pp. 155–166). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-45253-2_15\">https://doi.org/10.1007/3-540-45253-2_15</a>","ama":"Czumaj A, Sohler C, Ziegler M. Property Testing in Computational Geometry. In: <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>. Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2000:155-166. doi:<a href=\"https://doi.org/10.1007/3-540-45253-2_15\">10.1007/3-540-45253-2_15</a>","chicago":"Czumaj, Artur, Christian Sohler, and Martin Ziegler. “Property Testing in Computational Geometry.” In <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, 4698:155–66. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-45253-2_15\">https://doi.org/10.1007/3-540-45253-2_15</a>.","ieee":"A. Czumaj, C. Sohler, and M. Ziegler, “Property Testing in Computational Geometry,” in <i>Proceedings of the 8th Annual European Symposium on Algorithms (ESA’00)</i>, 2000, vol. 4698, pp. 155–166."},"place":"Berlin, Heidelberg","department":[{"_id":"63"}],"user_id":"15415","series_title":"Lecture Notes in Computer Science","_id":"17990","type":"conference","status":"public","date_created":"2020-08-14T13:48:54Z","publisher":"Springer","title":"Property Testing in Computational Geometry","year":"2000","language":[{"iso":"eng"}],"publication":"Proceedings of the 8th Annual European Symposium on Algorithms (ESA'00)","abstract":[{"text":"We consider the notion of Property Testing as applied to computational geometry. We aim at developing efficient algorithms which determine whether a given (geometrical) object has a predetermined property Q or is 'far' from any object having the property. We show that many basic geometric properties have very efficient testing algorithms, whose running time is significantly smaller than the object description size.","lang":"eng"}]},{"title":"Computing the Dimension of Linear Subspaces","publisher":"Springer","date_created":"2020-08-24T09:58:56Z","year":"2000","language":[{"iso":"eng"}],"abstract":[{"text":"Since its very beginning, linear algebra is a highly algorithmic subject. Let us just mention the famous Gauss Algorithm which was invented before the theory of algorithms has been developed. The purpose of this paper is to link linear algebra explicitly to computable analysis, that is the theory of computable real number functions. Especially, we will investigate in which sense the dimension of a given linear subspace can be computed. The answer highly depends on how the linear subspace is given: if it is given by a finite number of vectors whose linear span represents the space, then the dimension does not depend continuously on these vectors and consequently it cannot be computed. If the linear subspace is represented via its distance function, which is a standard way to represent closed subspaces in computable analysis, then the dimension does computably depend on the distance function.","lang":"eng"}],"publication":"SOFSEM 2000: Theory and Practice of Informatics","doi":"10.1007/3-540-44411-4_34","date_updated":"2022-01-06T06:53:26Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"last_name":"Brattka","full_name":"Brattka, Vasco","first_name":"Vasco"}],"volume":1963,"place":"Berlin, Heidelberg","citation":{"ama":"Ziegler M, Brattka V. Computing the Dimension of Linear Subspaces. In: <i>SOFSEM 2000: Theory and Practice of Informatics</i>. Vol 1963. Berlin, Heidelberg: Springer; 2000:450-458. doi:<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>","chicago":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” In <i>SOFSEM 2000: Theory and Practice of Informatics</i>, 1963:450–58. Berlin, Heidelberg: Springer, 2000. <a href=\"https://doi.org/10.1007/3-540-44411-4_34\">https://doi.org/10.1007/3-540-44411-4_34</a>.","ieee":"M. Ziegler and V. Brattka, “Computing the Dimension of Linear Subspaces,” in <i>SOFSEM 2000: Theory and Practice of Informatics</i>, 2000, vol. 1963, pp. 450–458.","bibtex":"@inproceedings{Ziegler_Brattka_2000, place={Berlin, Heidelberg}, title={Computing the Dimension of Linear Subspaces}, volume={1963}, DOI={<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>}, booktitle={SOFSEM 2000: Theory and Practice of Informatics}, publisher={Springer}, author={Ziegler, Martin and Brattka, Vasco}, year={2000}, pages={450–458} }","short":"M. Ziegler, V. Brattka, in: SOFSEM 2000: Theory and Practice of Informatics, Springer, Berlin, Heidelberg, 2000, pp. 450–458.","mla":"Ziegler, Martin, and Vasco Brattka. “Computing the Dimension of Linear Subspaces.” <i>SOFSEM 2000: Theory and Practice of Informatics</i>, vol. 1963, Springer, 2000, pp. 450–58, doi:<a href=\"https://doi.org/10.1007/3-540-44411-4_34\">10.1007/3-540-44411-4_34</a>.","apa":"Ziegler, M., &#38; Brattka, V. (2000). Computing the Dimension of Linear Subspaces. In <i>SOFSEM 2000: Theory and Practice of Informatics</i> (Vol. 1963, pp. 450–458). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/3-540-44411-4_34\">https://doi.org/10.1007/3-540-44411-4_34</a>"},"page":"450-458","intvolume":"      1963","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540413486","9783540444114"]},"_id":"18146","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"conference"}]