[{"publication_status":"published","date_updated":"2022-01-06T06:53:24Z","year":"2007","title":"Revising Type-2 Computation and Degrees of Discontinuity","status":"public","author":[{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"publication_identifier":{"issn":["1571-0661"]},"user_id":"15415","doi":"10.1016/j.entcs.2006.08.015","page":"255-274","_id":"17980","language":[{"iso":"eng"}],"publication":"Electronic Notes in Theoretical Computer Science","citation":{"chicago":"Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.” <i>Electronic Notes in Theoretical Computer Science</i>, 2007, 255–74. <a href=\"https://doi.org/10.1016/j.entcs.2006.08.015\">https://doi.org/10.1016/j.entcs.2006.08.015</a>.","short":"M. Ziegler, Electronic Notes in Theoretical Computer Science (2007) 255–274.","ieee":"M. Ziegler, “Revising Type-2 Computation and Degrees of Discontinuity,” <i>Electronic Notes in Theoretical Computer Science</i>, pp. 255–274, 2007.","apa":"Ziegler, M. (2007). Revising Type-2 Computation and Degrees of Discontinuity. <i>Electronic Notes in Theoretical Computer Science</i>, 255–274. <a href=\"https://doi.org/10.1016/j.entcs.2006.08.015\">https://doi.org/10.1016/j.entcs.2006.08.015</a>","bibtex":"@article{Ziegler_2007, title={Revising Type-2 Computation and Degrees of Discontinuity}, DOI={<a href=\"https://doi.org/10.1016/j.entcs.2006.08.015\">10.1016/j.entcs.2006.08.015</a>}, journal={Electronic Notes in Theoretical Computer Science}, author={Ziegler, Martin}, year={2007}, pages={255–274} }","ama":"Ziegler M. Revising Type-2 Computation and Degrees of Discontinuity. <i>Electronic Notes in Theoretical Computer Science</i>. 2007:255-274. doi:<a href=\"https://doi.org/10.1016/j.entcs.2006.08.015\">10.1016/j.entcs.2006.08.015</a>","mla":"Ziegler, Martin. “Revising Type-2 Computation and Degrees of Discontinuity.” <i>Electronic Notes in Theoretical Computer Science</i>, 2007, pp. 255–74, doi:<a href=\"https://doi.org/10.1016/j.entcs.2006.08.015\">10.1016/j.entcs.2006.08.015</a>."},"type":"journal_article","department":[{"_id":"63"}],"date_created":"2020-08-14T13:30:00Z"},{"author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"publication_identifier":{"issn":["1432-4350","1433-0490"]},"title":"Real Hypercomputation and Continuity","year":"2007","status":"public","publication_status":"published","date_updated":"2022-01-06T06:53:24Z","_id":"17981","language":[{"iso":"eng"}],"page":"177-206","user_id":"15415","doi":"10.1007/s00224-006-1343-6","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} }","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>.","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>","short":"M. Ziegler, Theory of Computing Systems (2007) 177–206.","ieee":"M. Ziegler, “Real Hypercomputation and Continuity,” <i>Theory of Computing Systems</i>, pp. 177–206, 2007.","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>","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>."},"publication":"Theory of Computing Systems","date_created":"2020-08-14T13:32:37Z","department":[{"_id":"63"}],"type":"journal_article"},{"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-14T13:33:50Z","place":"Berlin, Heidelberg","publication":"Lecture Notes in Computer Science","citation":{"apa":"Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-73001-9_86\">https://doi.org/10.1007/978-3-540-73001-9_86</a>","ieee":"M. Ziegler, “(Short) Survey of Real Hypercomputation,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2007.","short":"M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","chicago":"Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73001-9_86\">https://doi.org/10.1007/978-3-540-73001-9_86</a>.","mla":"Ziegler, Martin. “(Short) Survey of Real Hypercomputation.” <i>Lecture Notes in Computer Science</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-73001-9_86\">10.1007/978-3-540-73001-9_86</a>.","ama":"Ziegler M. (Short) Survey of Real Hypercomputation. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-73001-9_86\">10.1007/978-3-540-73001-9_86</a>","bibtex":"@inbook{Ziegler_2007, place={Berlin, Heidelberg}, title={(Short) Survey of Real Hypercomputation}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73001-9_86\">10.1007/978-3-540-73001-9_86</a>}, booktitle={Lecture Notes in Computer Science}, author={Ziegler, Martin}, year={2007} }"},"user_id":"15415","doi":"10.1007/978-3-540-73001-9_86","language":[{"iso":"eng"}],"_id":"17982","publication_status":"published","date_updated":"2022-01-06T06:53:24Z","title":"(Short) Survey of Real Hypercomputation","year":"2007","status":"public","publication_identifier":{"isbn":["9783540730002","9783540730019"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}]},{"title":"Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation","status":"public","year":"2007","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540744559","9783540744566"]},"author":[{"first_name":"Klaus","last_name":"Meer","full_name":"Meer, Klaus"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"date_updated":"2022-01-06T06:53:24Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"17983","doi":"10.1007/978-3-540-74456-6_64","user_id":"15415","publication":"Mathematical Foundations of Computer Science 2007","citation":{"bibtex":"@inbook{Meer_Ziegler_2007, place={Berlin, Heidelberg}, title={Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">10.1007/978-3-540-74456-6_64</a>}, booktitle={Mathematical Foundations of Computer Science 2007}, author={Meer, Klaus and Ziegler, Martin}, year={2007} }","ama":"Meer K, Ziegler M. Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In: <i>Mathematical Foundations of Computer Science 2007</i>. Berlin, Heidelberg; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">10.1007/978-3-540-74456-6_64</a>","mla":"Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” <i>Mathematical Foundations of Computer Science 2007</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">10.1007/978-3-540-74456-6_64</a>.","short":"K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.","chicago":"Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.” In <i>Mathematical Foundations of Computer Science 2007</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">https://doi.org/10.1007/978-3-540-74456-6_64</a>.","ieee":"K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation,” in <i>Mathematical Foundations of Computer Science 2007</i>, Berlin, Heidelberg, 2007.","apa":"Meer, K., &#38; Ziegler, M. (2007). Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In <i>Mathematical Foundations of Computer Science 2007</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-74456-6_64\">https://doi.org/10.1007/978-3-540-74456-6_64</a>"},"place":"Berlin, Heidelberg","date_created":"2020-08-14T13:35:56Z","type":"book_chapter","department":[{"_id":"63"}]},{"date_created":"2020-08-14T13:36:55Z","type":"preprint","department":[{"_id":"63"}],"publication":"arXiv:0709.0624","citation":{"ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations using Non-Arithmetic Primitives,” <i>arXiv:0709.0624</i>. 2007.","apa":"Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2007). On Faster Integer Calculations using Non-Arithmetic Primitives. <i>ArXiv:0709.0624</i>.","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>ArXiv:0709.0624</i>, 2007.","short":"K. Lürwer-Brüggemeier, M. Ziegler, ArXiv:0709.0624 (2007).","mla":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>ArXiv:0709.0624</i>, 2007.","bibtex":"@article{Lürwer-Brüggemeier_Ziegler_2007, title={On Faster Integer Calculations using Non-Arithmetic Primitives}, journal={arXiv:0709.0624}, author={Lürwer-Brüggemeier, Katharina and Ziegler, Martin}, year={2007} }","ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations using Non-Arithmetic Primitives. <i>arXiv:07090624</i>. 2007."},"abstract":[{"text":"The unit cost model is both convenient and largely realistic for describing\r\ninteger decision algorithms over (+,*). Additional operations like division\r\nwith remainder or bitwise conjunction, although equally supported by computing\r\nhardware, may lead to a considerable drop in complexity. We show a variety of\r\nconcrete problems to benefit from such NON-arithmetic primitives by presenting\r\nand analyzing corresponding fast algorithms.","lang":"eng"}],"_id":"17984","language":[{"iso":"eng"}],"user_id":"15415","year":"2007","title":"On Faster Integer Calculations using Non-Arithmetic Primitives","status":"public","author":[{"full_name":"Lürwer-Brüggemeier, Katharina","first_name":"Katharina","last_name":"Lürwer-Brüggemeier"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"date_updated":"2022-01-06T06:53:24Z"},{"department":[{"_id":"63"}],"type":"report","date_created":"2020-08-25T13:11:38Z","file":[{"file_id":"18286","content_type":"application/pdf","success":1,"file_name":"real-comp-2007.pdf","access_level":"closed","file_size":2157961,"relation":"main_file","date_updated":"2020-08-25T13:11:15Z","date_created":"2020-08-25T13:11:15Z","creator":"koala"}],"report_number":" tr-ri-07-285","citation":{"mla":"Ziegler, Martin. <i>Real Computability and Hypercomputation</i>. 2007.","bibtex":"@book{Ziegler_2007, title={Real Computability and Hypercomputation}, author={Ziegler, Martin}, year={2007} }","ama":"Ziegler M. <i>Real Computability and Hypercomputation</i>.; 2007.","ieee":"M. Ziegler, <i>Real Computability and Hypercomputation</i>. 2007.","apa":"Ziegler, M. (2007). <i>Real Computability and Hypercomputation</i>.","chicago":"Ziegler, Martin. <i>Real Computability and Hypercomputation</i>, 2007.","short":"M. Ziegler, Real Computability and Hypercomputation, 2007."},"file_date_updated":"2020-08-25T13:11:15Z","user_id":"15415","ddc":["000"],"_id":"18285","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:53:28Z","author":[{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"status":"public","year":"2007","title":"Real Computability and Hypercomputation"},{"status":"public","title":"Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment","year":"2007","author":[{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"first_name":"Christoph ","last_name":"Laroque","full_name":"Laroque, Christoph "},{"full_name":"Huber, Daniel ","first_name":"Daniel ","last_name":"Huber"},{"first_name":"Jens ","last_name":"Krokowski","full_name":"Krokowski, Jens "},{"full_name":"Mueck, Bengt ","last_name":"Mueck","first_name":"Bengt "},{"first_name":"Michael ","last_name":"Kortenjan","full_name":"Kortenjan, Michael "},{"last_name":"Aufenanger","first_name":"Mark","full_name":"Aufenanger, Mark"},{"full_name":" Dangelmaier, Wilhelm","last_name":" Dangelmaier","first_name":"Wilhelm"}],"date_updated":"2022-01-06T06:53:29Z","has_accepted_license":"1","page":"499--505","_id":"18347","language":[{"iso":"eng"}],"ddc":["004"],"user_id":"15415","publication":"European Simulation and Modelling Conference (ESM 2007)","file_date_updated":"2020-08-26T09:22:47Z","citation":{"short":"M. Fischer, C. Laroque, D. Huber, J. Krokowski, B. Mueck, M. Kortenjan, M. Aufenanger, W.  Dangelmaier, in: European Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.","chicago":"Fischer, Matthias, Christoph  Laroque, Daniel  Huber, Jens  Krokowski, Bengt  Mueck, Michael  Kortenjan, Mark Aufenanger, and Wilhelm  Dangelmaier. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” In <i>European Simulation and Modelling Conference (ESM 2007)</i>, 499--505, 2007.","ieee":"M. Fischer <i>et al.</i>, “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment,” in <i>European Simulation and Modelling Conference (ESM 2007)</i>, 2007, pp. 499--505.","apa":"Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M., …  Dangelmaier, W. (2007). Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In <i>European Simulation and Modelling Conference (ESM 2007)</i> (pp. 499--505).","bibtex":"@inproceedings{Fischer_Laroque_Huber_Krokowski_Mueck_Kortenjan_Aufenanger_ Dangelmaier_2007, title={Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment}, booktitle={European Simulation and Modelling Conference (ESM 2007)}, author={Fischer, Matthias and Laroque, Christoph  and Huber, Daniel  and Krokowski, Jens  and Mueck, Bengt  and Kortenjan, Michael  and Aufenanger, Mark and  Dangelmaier, Wilhelm}, year={2007}, pages={499--505} }","ama":"Fischer M, Laroque C, Huber D, et al. Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In: <i>European Simulation and Modelling Conference (ESM 2007)</i>. ; 2007:499--505.","mla":"Fischer, Matthias, et al. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” <i>European Simulation and Modelling Conference (ESM 2007)</i>, 2007, pp. 499--505."},"abstract":[{"text":"The validation of material flow models as well as the selection of promising strategies for the generation of a successful experiment plan is a time-consuming process. A new approach is presented, which supports the simulation expert in his working process by giving him the opportunity to modify the simulated simulation run and afterwards compare the effects of his modification with the original setting, online and in one user interface, implemented by switching the visualizations between the simulation runs or opening up to 5 parallel 3D windows. The method developed therefore clones existing simulation runs online and allows the navigation within these existing simulation runs. The method has been implemented and is validated by a test model, which describes in detail the new working process of a modeler. New research questions are derived from this work, which will define following working steps.\r\n","lang":"eng"}],"file":[{"creator":"koala","date_created":"2020-08-26T09:22:47Z","date_updated":"2020-08-26T09:22:47Z","relation":"main_file","file_size":389588,"access_level":"closed","file_name":"ESM07_final.pdf","content_type":"application/pdf","success":1,"file_id":"18348"}],"date_created":"2020-08-26T09:23:24Z","type":"conference","department":[{"_id":"63"}]},{"volume":209,"user_id":"5786","_id":"18349","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"95-110","intvolume":"       209","date_updated":"2022-01-06T06:53:29Z","author":[{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"last_name":" Laroque","first_name":"Christoph ","full_name":" Laroque, Christoph "},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"}],"status":"public","title":"Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik","year":"2007","department":[{"_id":"63"},{"_id":"26"}],"type":"conference","date_created":"2020-08-26T09:30:58Z","citation":{"short":"W. Dangelmaier, C.  Laroque, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110.","chicago":"Dangelmaier, Wilhelm, Christoph   Laroque, and Matthias Fischer. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 209:95–110. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007.","ieee":"W. Dangelmaier, C.  Laroque, and M. Fischer, “Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2007, vol. 209, pp. 95–110.","apa":"Dangelmaier, W.,  Laroque, C., &#38; Fischer, M. (2007). Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>209</i>, 95–110.","bibtex":"@inproceedings{Dangelmaier_ Laroque_Fischer_2007, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik}, volume={209}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dangelmaier, Wilhelm and  Laroque, Christoph  and Fischer, Matthias}, year={2007}, pages={95–110}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Dangelmaier W,  Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 209. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2007:95-110.","mla":"Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110."},"publication":"Augmented & Virtual Reality in der Produktentstehung"},{"date_created":"2020-08-28T12:46:05Z","type":"conference","department":[{"_id":"63"}],"publication":"Proceedings of the 15th European Symposium on Algorithms (ESA)","abstract":[{"lang":"eng","text":"We present random sampling algorithms that with probability at least 1 − δ compute a (1 ±ε)-approximation of the clustering coefficient and of the number of bipartite clique subgraphs of a graph given as an incidence stream of edges. The space used by our algorithm to estimate the clustering coefficient is inversely related to the clustering coefficient of the network itself. The space used by our algorithm to compute the number K 3,3 of bipartite cliques is proportional to the ratio between the number of K 1,3 and K 3,3 in the graph.\r\n\r\nSince the space complexity depends only on the structure of the input graph and not on the number of nodes, our algorithms scale very well with increasing graph size. Therefore they provide a basic tool to analyze the structure of dense clusters in large graphs and have many applications in the discovery of web communities, the analysis of the structure of large social networks and the probing of frequent patterns in large graphs.\r\n\r\nWe implemented both algorithms and evaluated their performance on networks from different application domains and of different size; The largest instance is a webgraph consisting of more than 135 million nodes and 1 billion edges. Both algorithms compute accurate results in reasonable time on the tested instances."}],"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","doi":"10.1007/978-3-540-75520-3_55","title":"Estimating Clustering Indexes in Data Streams","year":"2007","publication_identifier":{"isbn":["9783540755197"]},"author":[{"last_name":"Buriol","first_name":"Luciana S.","full_name":"Buriol, Luciana S."},{"full_name":"Frahling, Gereon","last_name":"Frahling","first_name":"Gereon"},{"full_name":"Leonardi, Stefano","last_name":"Leonardi","first_name":"Stefano"},{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"}],"date_updated":"2022-01-06T06:53:40Z","publication_status":"published","intvolume":"      4698","place":"Berlin, Heidelberg","citation":{"short":"L.S. Buriol, G. Frahling, S. Leonardi, C. Sohler, in: Proceedings of the 15th European Symposium on Algorithms (ESA), Springer, Berlin, Heidelberg, 2007, pp. 618–632.","chicago":"Buriol, Luciana S., Gereon Frahling, Stefano Leonardi, and Christian Sohler. “Estimating Clustering Indexes in Data Streams.” In <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>, 4698:618–32. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">https://doi.org/10.1007/978-3-540-75520-3_55</a>.","apa":"Buriol, L. S., Frahling, G., Leonardi, S., &#38; Sohler, C. (2007). Estimating Clustering Indexes in Data Streams. In <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i> (Vol. 4698, pp. 618–632). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">https://doi.org/10.1007/978-3-540-75520-3_55</a>","ieee":"L. S. Buriol, G. Frahling, S. Leonardi, and C. Sohler, “Estimating Clustering Indexes in Data Streams,” in <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>, 2007, vol. 4698, pp. 618–632.","ama":"Buriol LS, Frahling G, Leonardi S, Sohler C. Estimating Clustering Indexes in Data Streams. In: <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>. Vol 4698. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2007:618-632. doi:<a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">10.1007/978-3-540-75520-3_55</a>","bibtex":"@inproceedings{Buriol_Frahling_Leonardi_Sohler_2007, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Estimating Clustering Indexes in Data Streams}, volume={4698}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">10.1007/978-3-540-75520-3_55</a>}, booktitle={Proceedings of the 15th European Symposium on Algorithms (ESA)}, publisher={Springer}, author={Buriol, Luciana S. and Frahling, Gereon and Leonardi, Stefano and Sohler, Christian}, year={2007}, pages={618–632}, collection={Lecture Notes in Computer Science} }","mla":"Buriol, Luciana S., et al. “Estimating Clustering Indexes in Data Streams.” <i>Proceedings of the 15th European Symposium on Algorithms (ESA)</i>, vol. 4698, Springer, 2007, pp. 618–32, doi:<a href=\"https://doi.org/10.1007/978-3-540-75520-3_55\">10.1007/978-3-540-75520-3_55</a>."},"page":"618-632","_id":"18572","publisher":"Springer","user_id":"15415","volume":4698,"status":"public"},{"citation":{"mla":"Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 2007, pp. 494–501.","bibtex":"@inproceedings{Sohler_Czumaj_2007, title={On Testable Properties in Bounded Degree Graphs}, booktitle={Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={494–501} }","ama":"Sohler C, Czumaj A. On Testable Properties in Bounded Degree Graphs. In: <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>. ; 2007:494-501.","ieee":"C. Sohler and A. Czumaj, “On Testable Properties in Bounded Degree Graphs,” in <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 2007, pp. 494–501.","apa":"Sohler, C., &#38; Czumaj, A. (2007). On Testable Properties in Bounded Degree Graphs. In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i> (pp. 494–501).","short":"C. Sohler, A. Czumaj, in: Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07), 2007, pp. 494–501.","chicago":"Sohler, Christian, and Artur Czumaj. “On Testable Properties in Bounded Degree Graphs.” In <i>Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’07)</i>, 494–501, 2007."},"publication":"Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA'07)","abstract":[{"text":"We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined graph property and graphs that are far from every graph having that property. It is believed that almost all, even very simple graph properties require a large complexity to be tested for arbitrary (bounded degree) graphs. Therefore in this paper we focus our attention on testing graph properties for special classes of graphs. We call a graph family non-expanding if every graph in this family is not a weak expander (its expansion is O(1/log2 n), where n is the graph size). A graph family is hereditary if it is closed under vertex removal. Similarly, a graph property is hereditary if it is closed under vertex removal. Next, we call a graph property Π to be testable for a graph family F if for every graph G ε F, in time independent of the size of G we can distinguish between the case when G satisfies property Π and when it is far from every graph satisfying property Π. In this paper we prove thatIn the bounded degree graph model, any hereditary property is testable if the input graph belongs to a hereditary and non-expanding family of graphs.As an application, our result implies that, for example, any hereditary property (e.g., k-colorability, H-freeness, etc.) is testable in the bounded degree graph model for planar graphs, graphs with bounded genus, interval graphs, etc. No such results have been known before and prior to our work, in the bounded degree graph model very few graph properties have been known to be testable for any graph classes.","lang":"eng"}],"date_created":"2020-08-31T07:40:36Z","department":[{"_id":"63"}],"type":"conference","author":[{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"publication_identifier":{"isbn":["9780898716245"]},"year":"2007","title":"On Testable Properties in Bounded Degree Graphs","status":"public","date_updated":"2022-01-06T06:53:50Z","language":[{"iso":"eng"}],"_id":"18655","page":"494-501","user_id":"15415"},{"title":"StrSort Algorithms for Geometric Problems","year":"2007","status":"public","author":[{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"},{"last_name":"Lammersen","first_name":"Christiane","full_name":"Lammersen, Christiane"}],"date_updated":"2022-01-06T06:53:50Z","page":"69-72","language":[{"iso":"eng"}],"_id":"18656","user_id":"15415","publication":"Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)","citation":{"apa":"Sohler, C., &#38; Lammersen, C. (2007). StrSort Algorithms for Geometric Problems. In <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i> (pp. 69–72).","ieee":"C. Sohler and C. Lammersen, “StrSort Algorithms for Geometric Problems,” in <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>, 2007, pp. 69–72.","short":"C. Sohler, C. Lammersen, in: Proceedings of the 23rd European Workshop on Computational Geometry (EWCG), 2007, pp. 69–72.","chicago":"Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” In <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>, 69–72, 2007.","mla":"Sohler, Christian, and Christiane Lammersen. “StrSort Algorithms for Geometric Problems.” <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>, 2007, pp. 69–72.","ama":"Sohler C, Lammersen C. StrSort Algorithms for Geometric Problems. In: <i>Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)</i>. ; 2007:69-72.","bibtex":"@inproceedings{Sohler_Lammersen_2007, title={StrSort Algorithms for Geometric Problems}, booktitle={Proceedings of the 23rd European Workshop on Computational Geometry (EWCG)}, author={Sohler, Christian and Lammersen, Christiane}, year={2007}, pages={69–72} }"},"abstract":[{"lang":"eng","text":"In the StrSort model [2], the input is given as a stream, e.g. a sequence of points, and an algorithm can perform (a) streaming and (b) sorting passes to process the stream. A streaming pass reads the input stream from left to right and writes an output stream, which is the input of the next pass. A sorting pass is a black box operation that sorts a stream according to some partial order. In this paper, we develop algorithms for two basic geometric problems in the StrSort model. At first, we propose a divide-and-conquer algorithm that computes the convex hull of a point set in 2D in O(log2 n) passes using O(1) memory. Then we give a StrSort algorithm to compute a (1+ε)-spanner for a point set in Rd for constant d and constant epsilon that uses O(logd-1 n) passes and O(log n) space. This result implies a (1+ε)-approximation of the Euclidean minimum spanning tree in Rd, for constant d and ε."}],"date_created":"2020-08-31T07:49:02Z","type":"conference","department":[{"_id":"63"}]},{"year":"2007","title":"Testing Expansion in Bounded-Degree Graphs","status":"public","author":[{"full_name":"Sohler, Christian ","last_name":"Sohler","first_name":"Christian "},{"full_name":"Czumaj, Artur","first_name":"Artur","last_name":"Czumaj"}],"date_updated":"2022-01-06T06:53:50Z","page":"570 - 578","language":[{"iso":"eng"}],"_id":"18660","user_id":"15415","publication":"Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","citation":{"bibtex":"@inproceedings{Sohler_Czumaj_2007, title={Testing Expansion in Bounded-Degree Graphs}, booktitle={Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)}, author={Sohler, Christian  and Czumaj, Artur}, year={2007}, pages={570–578} }","ama":"Sohler C, Czumaj A. Testing Expansion in Bounded-Degree Graphs. In: <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>. ; 2007:570-578.","mla":"Sohler, Christian, and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>, 2007, pp. 570–78.","short":"C. Sohler, A. Czumaj, in: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2007, pp. 570–578.","chicago":"Sohler, Christian , and Artur Czumaj. “Testing Expansion in Bounded-Degree Graphs.” In <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>, 570–78, 2007.","ieee":"C. Sohler and A. Czumaj, “Testing Expansion in Bounded-Degree Graphs,” in <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i>, 2007, pp. 570–578.","apa":"Sohler, C., &#38; Czumaj, A. (2007). Testing Expansion in Bounded-Degree Graphs. In <i>Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS)</i> (pp. 570–578)."},"date_created":"2020-08-31T07:55:45Z","type":"conference","department":[{"_id":"63"}]},{"citation":{"short":"C. Sohler, A. Czumaj, in: Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07), 2007, pp. 536–548.","chicago":"Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” In <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>, 536–48, 2007.","ieee":"C. Sohler and A. Czumaj, “Small Space Representations for Metric Min-Sum k-Clustering and their Applications,” in <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>, 2007, pp. 536–548.","apa":"Sohler, C., &#38; Czumaj, A. (2007). Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i> (pp. 536–548).","bibtex":"@inproceedings{Sohler_Czumaj_2007, title={Small Space Representations for Metric Min-Sum k-Clustering and their Applications}, booktitle={Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={536–548} }","ama":"Sohler C, Czumaj A. Small Space Representations for Metric Min-Sum k-Clustering and their Applications. In: <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>. ; 2007:536-548.","mla":"Sohler, Christian, and Artur Czumaj. “Small Space Representations for Metric Min-Sum k-Clustering and Their Applications.” <i>Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS’07)</i>, 2007, pp. 536–48."},"publication":"Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science (STACS'07)","department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-31T07:59:05Z","date_updated":"2022-01-06T06:53:50Z","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"last_name":"Czumaj","first_name":"Artur","full_name":"Czumaj, Artur"}],"title":"Small Space Representations for Metric Min-Sum k-Clustering and their Applications","year":"2007","status":"public","user_id":"15415","_id":"18662","language":[{"iso":"eng"}],"page":"536-548"},{"title":"Sublinear-time approximation algorithms for clustering via random sampling","status":"public","year":"2007","author":[{"first_name":"Christian","last_name":"Sohler","full_name":"Sohler, Christian"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"}],"date_updated":"2022-01-06T06:53:50Z","intvolume":"        30","page":"226 -- 256","_id":"18665","language":[{"iso":"eng"}],"user_id":"15415","volume":30,"issue":"1-2","publication":"Random Structures & Algorithms","citation":{"mla":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” <i>Random Structures &#38; Algorithms</i>, vol. 30, no. 1–2, 2007, pp. 226-- 256.","ama":"Sohler C, Czumaj A. Sublinear-time approximation algorithms for clustering via random sampling. <i>Random Structures &#38; Algorithms</i>. 2007;30(1-2):226-- 256.","bibtex":"@article{Sohler_Czumaj_2007, title={Sublinear-time approximation algorithms for clustering via random sampling}, volume={30}, number={1–2}, journal={Random Structures &#38; Algorithms}, author={Sohler, Christian and Czumaj, Artur}, year={2007}, pages={226-- 256} }","apa":"Sohler, C., &#38; Czumaj, A. (2007). Sublinear-time approximation algorithms for clustering via random sampling. <i>Random Structures &#38; Algorithms</i>, <i>30</i>(1–2), 226-- 256.","ieee":"C. Sohler and A. Czumaj, “Sublinear-time approximation algorithms for clustering via random sampling,” <i>Random Structures &#38; Algorithms</i>, vol. 30, no. 1–2, pp. 226-- 256, 2007.","chicago":"Sohler, Christian, and Artur Czumaj. “Sublinear-Time Approximation Algorithms for Clustering via Random Sampling.” <i>Random Structures &#38; Algorithms</i> 30, no. 1–2 (2007): 226-- 256.","short":"C. Sohler, A. Czumaj, Random Structures &#38; Algorithms 30 (2007) 226-- 256."},"abstract":[{"lang":"eng","text":"We present a novel analysis of a random sampling approach for four clustering problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced k-median. For all these problems, we consider the following simple sampling scheme: select a small sample set of input points uniformly at random and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems.The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach, we obtain for these problems the first time approximation algorithms that have running time independent of the input size, and depending on k and the diameter of the metric space only. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007A preliminary extended abstract of this work appeared in Proceedings of the 31st Annual International Colloquium on Automata, Languages and Programming (ICALP), pp. 396407, 2004."}],"date_created":"2020-08-31T08:03:52Z","type":"journal_article","department":[{"_id":"63"}]},{"date_created":"2020-08-31T08:10:11Z","department":[{"_id":"63"}],"type":"conference","citation":{"short":"C. Sohler, M. Monemizahdeh, D. Feldman, in: Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07), 2007, pp. 11–18.","chicago":"Sohler, Christian, Morteza Monemizahdeh, and Dan Feldman. “A PTAS for K-Means Clustering Based on Weak Coresets.” In <i>Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07)</i>, 11–18, 2007.","ieee":"C. Sohler, M. Monemizahdeh, and D. Feldman, “A PTAS for k-means clustering based on weak coresets,” in <i>Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)</i>, 2007, pp. 11–18.","apa":"Sohler, C., Monemizahdeh, M., &#38; Feldman, D. (2007). A PTAS for k-means clustering based on weak coresets. In <i>Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)</i> (pp. 11–18).","bibtex":"@inproceedings{Sohler_Monemizahdeh_Feldman_2007, title={A PTAS for k-means clustering based on weak coresets}, booktitle={Proceedings of the 23rd annual symposium on computational geometry (SoCG’07)}, author={Sohler, Christian and Monemizahdeh, Morteza and Feldman, Dan}, year={2007}, pages={11–18} }","ama":"Sohler C, Monemizahdeh M, Feldman D. A PTAS for k-means clustering based on weak coresets. In: <i>Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07)</i>. ; 2007:11-18.","mla":"Sohler, Christian, et al. “A PTAS for K-Means Clustering Based on Weak Coresets.” <i>Proceedings of the 23rd Annual Symposium on Computational Geometry (SoCG’07)</i>, 2007, pp. 11–18."},"publication":"Proceedings of the 23rd annual symposium on computational geometry (SoCG'07)","_id":"18668","language":[{"iso":"eng"}],"page":"11-18","user_id":"15415","author":[{"full_name":"Sohler, Christian","first_name":"Christian","last_name":"Sohler"},{"full_name":"Monemizahdeh, Morteza","first_name":"Morteza","last_name":"Monemizahdeh"},{"full_name":"Feldman, Dan","first_name":"Dan","last_name":"Feldman"}],"title":"A PTAS for k-means clustering based on weak coresets","year":"2007","status":"public","date_updated":"2022-01-06T06:53:50Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-31T08:12:53Z","publication":"Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)","citation":{"bibtex":"@inproceedings{Sohler_Czumaj_Frahling_2007, title={Efficient kinetic data structures for MaxCut}, booktitle={Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)}, author={Sohler, Christian and Czumaj, Artur and Frahling, Gereon}, year={2007}, pages={157–160} }","chicago":"Sohler, Christian, Artur Czumaj, and Gereon Frahling. “Efficient Kinetic Data Structures for MaxCut.” In <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>, 157–60, 2007.","short":"C. Sohler, A. Czumaj, G. Frahling, in: Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG), 2007, pp. 157–160.","ama":"Sohler C, Czumaj A, Frahling G. Efficient kinetic data structures for MaxCut. In: <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>. ; 2007:157-160.","ieee":"C. Sohler, A. Czumaj, and G. Frahling, “Efficient kinetic data structures for MaxCut,” in <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>, 2007, pp. 157–160.","mla":"Sohler, Christian, et al. “Efficient Kinetic Data Structures for MaxCut.” <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i>, 2007, pp. 157–60.","apa":"Sohler, C., Czumaj, A., &#38; Frahling, G. (2007). Efficient kinetic data structures for MaxCut. In <i>Proceedings of the 19th Canadian Conference on Computational Geometry (CCCG)</i> (pp. 157–160)."},"user_id":"15415","page":"157-160","language":[{"iso":"eng"}],"_id":"18669","date_updated":"2022-01-06T06:53:50Z","title":"Efficient kinetic data structures for MaxCut","status":"public","year":"2007","author":[{"last_name":"Sohler","first_name":"Christian","full_name":"Sohler, Christian"},{"first_name":"Artur","last_name":"Czumaj","full_name":"Czumaj, Artur"},{"last_name":"Frahling","first_name":"Gereon","full_name":"Frahling, Gereon"}]},{"department":[{"_id":"79"},{"_id":"63"}],"oa":"1","type":"conference","date_created":"2018-04-05T07:08:35Z","file":[{"creator":"florida","date_created":"2018-04-13T10:01:42Z","file_size":164121,"access_level":"open_access","file_name":"ICDCS07.pdf","date_updated":"2018-04-13T10:01:42Z","relation":"main_file","content_type":"application/pdf","file_id":"2339"}],"abstract":[{"lang":"eng","text":"We present a randomized block-level storage virtualization for arbitrary heterogeneous storage systems that can distribute data in a fair and redundant way and can adapt this distribution in an efficient way as storage devices enter or leave the system. More precisely, our virtualization strategies can distribute a set of data blocks among a set of storage devices of arbitrary non-uniform capacities so that a storage device representing x% of the capacity in the system will get x% of the data (as long as this is in principle possible) and the different copies of each data block are stored so that no two copies of a data block are located in the same device. Achieving these two properties is not easy, and no virtualization strategy has been presented so far that has been formally shown to satisfy fairness and redundancy while being time- and space-eflcient and allowing an efficient adaptation to a changing set of devices."}],"citation":{"chicago":"Brinkmann, André, Sascha Effert, Friedhelm Meyer auf der Heide, and Christian Scheideler. “Dynamic and Redundant Data Placement.” In <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007.","short":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, C. Scheideler, in: IEEE International Conference on Distributed Computing Systems (ICDCS), 2007.","apa":"Brinkmann, A., Effert, S., Meyer auf der Heide, F., &#38; Scheideler, C. (2007). Dynamic and redundant data placement. <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>.","ieee":"A. Brinkmann, S. Effert, F. Meyer auf der Heide, and C. Scheideler, “Dynamic and redundant data placement,” 2007.","ama":"Brinkmann A, Effert S, Meyer auf der Heide F, Scheideler C. Dynamic and redundant data placement. In: <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>. ; 2007.","bibtex":"@inproceedings{Brinkmann_Effert_Meyer auf der Heide_Scheideler_2007, title={Dynamic and redundant data placement}, booktitle={IEEE International Conference on Distributed Computing Systems (ICDCS)}, author={Brinkmann, André and Effert, Sascha and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2007} }","mla":"Brinkmann, André, et al. “Dynamic and Redundant Data Placement.” <i>IEEE International Conference on Distributed Computing Systems (ICDCS)</i>, 2007."},"file_date_updated":"2018-04-13T10:01:42Z","publication":"IEEE International Conference on Distributed Computing Systems (ICDCS)","user_id":"15415","ddc":["040"],"urn":"22147","_id":"2214","language":[{"iso":"eng"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:55:27Z","author":[{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"first_name":"Sascha","last_name":"Effert","full_name":"Effert, Sascha"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"}],"title":"Dynamic and redundant data placement","status":"public","year":"2007"},{"date_created":"2019-02-21T11:56:39Z","place":"Buenos Aires, Argentina","department":[{"_id":"66"},{"_id":"600"},{"_id":"63"}],"type":"conference","citation":{"ama":"Arens S, Buss A, Deck H, et al. Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In: <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.","bibtex":"@inproceedings{Arens_Buss_Deck_Dynia_Fischer_Hagedorn_Isaak_Kutylowski_Meyer auf der Heide_Nesterow_et al._2007, place={Buenos Aires, Argentina}, title={Smart Teams: Simulating Large Robotic Swarms in Vast Environments}, booktitle={Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}, publisher={Heinz Nixdorf Institut, University of Paderborn}, author={Arens, Stephan and Buss, Alexander and Deck, Helena and Dynia, Miroslaw and Fischer, Matthias and Hagedorn, Holger and Isaak, Peter and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Nesterow, Viktor and et al.}, year={2007}, pages={215–222} }","mla":"Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22.","chicago":"Arens, Stephan, Alexander Buss, Helena Deck, Miroslaw Dynia, Matthias Fischer, Holger Hagedorn, Peter Isaak, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 215–22. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn, 2007.","short":"S. Arens, A. Buss, H. Deck, M. Dynia, M. Fischer, H. Hagedorn, P. Isaak, J. Kutylowski, F. Meyer auf der Heide, V. Nesterow, A. Ogiermann, B. Stobbe, T. Storm, H. Wachsmuth, in: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, Buenos Aires, Argentina, 2007, pp. 215–222.","apa":"Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i> (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.","ieee":"S. Arens <i>et al.</i>, “Smart Teams: Simulating Large Robotic Swarms in Vast Environments,” in <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 2007, pp. 215–222."},"publication":"Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment","abstract":[{"lang":"eng","text":"We consider the problem of exploring an unknown environment using a swarm of autonomous robots with collective behavior emerging from their local rules. Each robot has only a very restricted view on the environment which makes cooperation difficult. We introduce a software system which is capable of simulating a large number of such robots (e.g. 1000) on highly complex terrains with millions of obstacles. Its main purpose is to easily integrate and evaluate any kind of algorithm for controlling the robot behavior. The simulation may be observed in real-time via a visualization that displays both the individual and the collective progress of the robots. We present the system design, its main features and underlying concepts."}],"publisher":"Heinz Nixdorf Institut, University of Paderborn","_id":"7970","language":[{"iso":"eng"}],"page":"215-222","main_file_link":[{"url":"https://webis.de/downloads/publications/papers/arens_2007.pdf"}],"user_id":"15415","author":[{"full_name":"Arens, Stephan","first_name":"Stephan","last_name":"Arens"},{"full_name":"Buss, Alexander","last_name":"Buss","first_name":"Alexander"},{"full_name":"Deck, Helena","last_name":"Deck","first_name":"Helena"},{"last_name":"Dynia","first_name":"Miroslaw","full_name":"Dynia, Miroslaw"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Holger","last_name":"Hagedorn","full_name":"Hagedorn, Holger"},{"last_name":"Isaak","first_name":"Peter","full_name":"Isaak, Peter"},{"full_name":"Kutylowski, Jaroslaw","last_name":"Kutylowski","first_name":"Jaroslaw"},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"full_name":"Nesterow, Viktor","first_name":"Viktor","last_name":"Nesterow"},{"first_name":"Adrian","last_name":"Ogiermann","full_name":"Ogiermann, Adrian"},{"last_name":"Stobbe","first_name":"Boris","full_name":"Stobbe, Boris"},{"full_name":"Storm, Thomas","first_name":"Thomas","last_name":"Storm"},{"id":"3900","full_name":"Wachsmuth, Henning","first_name":"Henning","last_name":"Wachsmuth"}],"year":"2007","status":"public","title":"Smart Teams: Simulating Large Robotic Swarms in Vast Environments","date_updated":"2022-01-06T07:03:48Z"},{"user_id":"15415","doi":"10.1145/1248377.1248420","_id":"16467","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","status":"public","year":"2007","title":"Local strategies for maintaining a chain of relay stations between an explorer and a base station","author":[{"full_name":"Dynia, Miroslaw","last_name":"Dynia","first_name":"Miroslaw"},{"first_name":"Jaroslaw","last_name":"Kutylowski","full_name":"Kutylowski, Jaroslaw"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Jonas","last_name":"Schrieb","full_name":"Schrieb, Jonas"}],"publication_identifier":{"isbn":["9781595936677"]},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-08T08:58:19Z","publication":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA '07","citation":{"short":"M. Dynia, J. Kutylowski, F. Meyer auf der Heide, J. Schrieb, in: Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07, 2007.","ama":"Dynia M, Kutylowski J, Meyer auf der Heide F, Schrieb J. Local strategies for maintaining a chain of relay stations between an explorer and a base station. In: <i>Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07</i>. ; 2007. doi:<a href=\"https://doi.org/10.1145/1248377.1248420\">10.1145/1248377.1248420</a>","chicago":"Dynia, Miroslaw, Jaroslaw Kutylowski, Friedhelm Meyer auf der Heide, and Jonas Schrieb. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.” In <i>Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07</i>, 2007. <a href=\"https://doi.org/10.1145/1248377.1248420\">https://doi.org/10.1145/1248377.1248420</a>.","bibtex":"@inproceedings{Dynia_Kutylowski_Meyer auf der Heide_Schrieb_2007, title={Local strategies for maintaining a chain of relay stations between an explorer and a base station}, DOI={<a href=\"https://doi.org/10.1145/1248377.1248420\">10.1145/1248377.1248420</a>}, booktitle={Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07}, author={Dynia, Miroslaw and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Schrieb, Jonas}, year={2007} }","apa":"Dynia, M., Kutylowski, J., Meyer auf der Heide, F., &#38; Schrieb, J. (2007). Local strategies for maintaining a chain of relay stations between an explorer and a base station. In <i>Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07</i>. <a href=\"https://doi.org/10.1145/1248377.1248420\">https://doi.org/10.1145/1248377.1248420</a>","mla":"Dynia, Miroslaw, et al. “Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station.” <i>Proceedings of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures  - SPAA ’07</i>, 2007, doi:<a href=\"https://doi.org/10.1145/1248377.1248420\">10.1145/1248377.1248420</a>.","ieee":"M. Dynia, J. Kutylowski, F. Meyer auf der Heide, and J. Schrieb, “Local strategies for maintaining a chain of relay stations between an explorer and a base station,” in <i>Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures  - SPAA ’07</i>, 2007."}},{"author":[{"full_name":"Klein, Jan","first_name":"Jan","last_name":"Klein"}],"publication_identifier":{"isbn":["3-939350-05-2"]},"status":"public","year":"2006","title":"Efficient Collision Detection for Point and Polygon Based Models","intvolume":"       186","date_updated":"2022-01-06T06:54:08Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"19612","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"volume":186,"user_id":"5786","supervisor":[{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"citation":{"apa":"Klein, J. (2006). <i>Efficient Collision Detection for Point and Polygon Based Models</i> (Vol. 186). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","ieee":"J. Klein, <i>Efficient Collision Detection for Point and Polygon Based Models</i>, vol. 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","short":"J. Klein, Efficient Collision Detection for Point and Polygon Based Models, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","chicago":"Klein, Jan. <i>Efficient Collision Detection for Point and Polygon Based Models</i>. Vol. 186. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","mla":"Klein, Jan. <i>Efficient Collision Detection for Point and Polygon Based Models</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2006.","ama":"Klein J. <i>Efficient Collision Detection for Point and Polygon Based Models</i>. Vol 186. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2006.","bibtex":"@book{Klein_2006, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Efficient Collision Detection for Point and Polygon Based Models}, volume={186}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Klein, Jan}, year={2006}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }"},"related_material":{"link":[{"url":"http://digital.ub.uni-paderborn.de/ubpb/urn/urn:nbn:de:hbz:466-20050101248","relation":"confirmation"}]},"date_created":"2020-09-22T07:48:45Z","department":[{"_id":"63"},{"_id":"26"}],"type":"dissertation"}]