[{"date_created":"2018-06-05T08:26:50Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"}],"date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/3-540-45537-x_26","title":"Key Revocation with Interval Cover Families","publication_status":"published","publication_identifier":{"isbn":["9783540430667","9783540455370"],"issn":["0302-9743"]},"citation":{"bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Key Revocation with Interval Cover Families}, DOI={<a href=\"https://doi.org/10.1007/3-540-45537-x_26\">10.1007/3-540-45537-x_26</a>}, booktitle={Selected Areas in Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={325–341} }","mla":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” <i>Selected Areas in Cryptography</i>, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:<a href=\"https://doi.org/10.1007/3-540-45537-x_26\">10.1007/3-540-45537-x_26</a>.","short":"J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.","apa":"Blömer, J., &#38; May, A. (2007). Key Revocation with Interval Cover Families. In <i>Selected Areas in Cryptography</i> (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45537-x_26\">https://doi.org/10.1007/3-540-45537-x_26</a>","ama":"Blömer J, May A. Key Revocation with Interval Cover Families. In: <i>Selected Areas in Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:325-341. doi:<a href=\"https://doi.org/10.1007/3-540-45537-x_26\">10.1007/3-540-45537-x_26</a>","ieee":"J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in <i>Selected Areas in Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.","chicago":"Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.” In <i>Selected Areas in Cryptography</i>, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-45537-x_26\">https://doi.org/10.1007/3-540-45537-x_26</a>."},"page":"325-341","year":"2007","place":"Berlin, Heidelberg","user_id":"25078","department":[{"_id":"64"}],"_id":"3021","type":"book_chapter","publication":"Selected Areas in Cryptography","status":"public"},{"citation":{"short":"A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.","bibtex":"@inbook{May_Silverman_2007, place={Berlin, Heidelberg}, title={Dimension Reduction Methods for Convolution Modular Lattices}, DOI={<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={May, Alexander and Silverman, Joseph H.}, year={2007}, pages={110–125} }","mla":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>.","apa":"May, A., &#38; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In <i>Lecture Notes in Computer Science</i> (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44670-2_10\">https://doi.org/10.1007/3-540-44670-2_10</a>","ama":"May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_10\">10.1007/3-540-44670-2_10</a>","chicago":"May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.” In <i>Lecture Notes in Computer Science</i>, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44670-2_10\">https://doi.org/10.1007/3-540-44670-2_10</a>.","ieee":"A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125."},"page":"110-125","year":"2007","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424888","9783540446705"]},"doi":"10.1007/3-540-44670-2_10","title":"Dimension Reduction Methods for Convolution Modular Lattices","author":[{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"},{"full_name":"Silverman, Joseph H.","last_name":"Silverman","first_name":"Joseph H."}],"date_created":"2018-06-05T08:27:10Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","user_id":"25078","department":[{"_id":"64"}],"_id":"3022"},{"_id":"3026","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Algorithms — ESA’ 98","type":"book_chapter","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","doi":"10.1007/3-540-68530-8_13","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"date_created":"2018-06-05T08:28:39Z","place":"Berlin, Heidelberg","year":"2007","page":"151-162","citation":{"mla":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” <i>Algorithms — ESA’ 98</i>, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>.","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.","bibtex":"@inbook{Blömer_2007, place={Berlin, Heidelberg}, title={A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}, DOI={<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>}, booktitle={Algorithms — ESA’ 98}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2007}, pages={151–162} }","apa":"Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In <i>Algorithms — ESA’ 98</i> (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-68530-8_13\">https://doi.org/10.1007/3-540-68530-8_13</a>","ieee":"J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.","chicago":"Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.” In <i>Algorithms — ESA’ 98</i>, 151–62. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-68530-8_13\">https://doi.org/10.1007/3-540-68530-8_13</a>.","ama":"Blömer J. A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:151-162. doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_13\">10.1007/3-540-68530-8_13</a>"},"publication_identifier":{"isbn":["9783540648482","9783540685302"],"issn":["0302-9743"]},"publication_status":"published"},{"language":[{"iso":"eng"}],"user_id":"5786","department":[{"_id":"76"}],"_id":"20949","status":"public","type":"conference","publication":"Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina","title":"Program evaluation using fuzzy logic with bad smells as inputs","date_created":"2021-01-13T10:18:05Z","author":[{"full_name":"Delic, A.","last_name":"Delic","first_name":"A."},{"first_name":"Z.","full_name":"Avdagic, Z.","last_name":"Avdagic"},{"first_name":"Wilhelm","last_name":"Schäfer","full_name":"Schäfer, Wilhelm"},{"first_name":"Dusanka","full_name":"Boskovic, Dusanka","last_name":"Boskovic"},{"full_name":"Meyer, Matthias","id":"683","last_name":"Meyer","first_name":"Matthias"}],"publisher":"Faculty of Electrical Engineering, University of Sarajevo","date_updated":"2022-01-06T06:54:42Z","citation":{"bibtex":"@inproceedings{Delic_Avdagic_Schäfer_Boskovic_Meyer_2007, title={Program evaluation using fuzzy logic with bad smells as inputs}, booktitle={Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina}, publisher={Faculty of Electrical Engineering, University of Sarajevo}, author={Delic, A. and Avdagic, Z. and Schäfer, Wilhelm and Boskovic, Dusanka and Meyer, Matthias}, year={2007} }","mla":"Delic, A., et al. “Program Evaluation Using Fuzzy Logic with Bad Smells as Inputs.” <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>, Faculty of Electrical Engineering, University of Sarajevo, 2007.","short":"A. Delic, Z. Avdagic, W. Schäfer, D. Boskovic, M. Meyer, in: Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina, Faculty of Electrical Engineering, University of Sarajevo, 2007.","apa":"Delic, A., Avdagic, Z., Schäfer, W., Boskovic, D., &#38; Meyer, M. (2007). Program evaluation using fuzzy logic with bad smells as inputs. <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>.","ama":"Delic A, Avdagic Z, Schäfer W, Boskovic D, Meyer M. Program evaluation using fuzzy logic with bad smells as inputs. In: <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>. Faculty of Electrical Engineering, University of Sarajevo; 2007.","ieee":"A. Delic, Z. Avdagic, W. Schäfer, D. Boskovic, and M. Meyer, “Program evaluation using fuzzy logic with bad smells as inputs,” 2007.","chicago":"Delic, A., Z. Avdagic, Wilhelm Schäfer, Dusanka Boskovic, and Matthias Meyer. “Program Evaluation Using Fuzzy Logic with Bad Smells as Inputs.” In <i>Proc. of the 21st International Symposium on Information, Communication and Automation Technologies (ICAT 2007), Sarajevo, Bosnia Herzegovina</i>. Faculty of Electrical Engineering, University of Sarajevo, 2007."},"year":"2007"},{"year":"2007","citation":{"bibtex":"@article{Leonardi_Mahlmann_Meyer auf der Heide_Spirakis_Weikum_2007, title={Guarding our digital society’s well-being}, volume={3-10–2007}, journal={e-Strategies, www.britishpublishers.com}, author={Leonardi, Stefano and Mahlmann, Peter and Meyer auf der Heide, Friedhelm and Spirakis, Paul G. and Weikum, Gerhard}, year={2007} }","mla":"Leonardi, Stefano, et al. “Guarding Our Digital Society’s Well-Being.” <i>E-Strategies, Www.Britishpublishers.Com</i>, vol. 3-10–2007, 2007.","short":"S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P.G. Spirakis, G. Weikum, E-Strategies, Www.Britishpublishers.Com 3-10–2007 (2007).","apa":"Leonardi, S., Mahlmann, P., Meyer auf der Heide, F., Spirakis, P. G., &#38; Weikum, G. (2007). Guarding our digital society’s well-being. <i>E-Strategies, Www.Britishpublishers.Com</i>, <i>3</i>-<i>10</i>–<i>2007</i>.","chicago":"Leonardi, Stefano, Peter Mahlmann, Friedhelm Meyer auf der Heide, Paul G. Spirakis, and Gerhard Weikum. “Guarding Our Digital Society’s Well-Being.” <i>E-Strategies, Www.Britishpublishers.Com</i> 3-10–2007 (2007).","ieee":"S. Leonardi, P. Mahlmann, F. Meyer auf der Heide, P. G. Spirakis, and G. Weikum, “Guarding our digital society’s well-being,” <i>e-Strategies, www.britishpublishers.com</i>, vol. 3-10–2007, 2007.","ama":"Leonardi S, Mahlmann P, Meyer auf der Heide F, Spirakis PG, Weikum G. Guarding our digital society’s well-being. <i>e-Strategies, www.britishpublishers.com</i>. 2007;3-10-2007."},"date_updated":"2022-01-06T06:53:15Z","author":[{"first_name":"Stefano","last_name":"Leonardi","full_name":"Leonardi, Stefano"},{"full_name":"Mahlmann, Peter","last_name":"Mahlmann","first_name":"Peter"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Paul G.","full_name":"Spirakis, Paul G.","last_name":"Spirakis"},{"last_name":"Weikum","full_name":"Weikum, Gerhard","first_name":"Gerhard"}],"date_created":"2020-08-03T14:26:31Z","volume":"3-10-2007","title":"Guarding our digital society's well-being","type":"journal_article","publication":"e-Strategies, www.britishpublishers.com","status":"public","_id":"17567","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"year":"2007","citation":{"mla":"Dynia, Miroslaw, et al. “Why Robots Need Maps.” <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2007, pp. 37-- 46, doi:<a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">10.1007/978-3-540-72951-8_5</a>.","bibtex":"@inproceedings{Dynia_Łopuszański_Schindelhauer_2007, title={Why Robots Need Maps}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">10.1007/978-3-540-72951-8_5</a>}, booktitle={Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)}, author={Dynia, Miroslaw and Łopuszański, Jakub and Schindelhauer, Christian}, year={2007}, pages={37-- 46} }","short":"M. Dynia, J. Łopuszański, C. Schindelhauer, in: Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2007, pp. 37-- 46.","apa":"Dynia, M., Łopuszański, J., &#38; Schindelhauer, C. (2007). Why Robots Need Maps. In <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i> (pp. 37-- 46). <a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">https://doi.org/10.1007/978-3-540-72951-8_5</a>","ama":"Dynia M, Łopuszański J, Schindelhauer C. Why Robots Need Maps. In: <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>. ; 2007:37-- 46. doi:<a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">10.1007/978-3-540-72951-8_5</a>","chicago":"Dynia, Miroslaw, Jakub Łopuszański, and Christian Schindelhauer. “Why Robots Need Maps.” In <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 37-- 46, 2007. <a href=\"https://doi.org/10.1007/978-3-540-72951-8_5\">https://doi.org/10.1007/978-3-540-72951-8_5</a>.","ieee":"M. Dynia, J. Łopuszański, and C. Schindelhauer, “Why Robots Need Maps,” in <i>Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)</i>, 2007, pp. 37-- 46."},"page":"37-- 46","publication_status":"published","publication_identifier":{"isbn":["9783540729181","9783540729518"]},"title":"Why Robots Need Maps","doi":"10.1007/978-3-540-72951-8_5","date_updated":"2022-01-06T06:53:54Z","date_created":"2020-09-03T10:24:29Z","author":[{"first_name":"Miroslaw","full_name":"Dynia, Miroslaw","last_name":"Dynia"},{"last_name":"Łopuszański","full_name":"Łopuszański, Jakub","first_name":"Jakub"},{"full_name":"Schindelhauer, Christian","last_name":"Schindelhauer","first_name":"Christian"}],"status":"public","type":"conference","publication":"Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO)","language":[{"iso":"eng"}],"_id":"18928","user_id":"15415","department":[{"_id":"63"}]},{"doi":"10.1007/978-3-540-69507-3_21","title":"Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs","author":[{"last_name":"Dynia","full_name":"Dynia, Miroslaw","first_name":"Miroslaw"},{"first_name":"Miroslaw","full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski"},{"full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski","first_name":"Jarosław"}],"date_created":"2020-09-03T10:29:52Z","volume":4362,"date_updated":"2022-01-06T06:53:54Z","citation":{"apa":"Dynia, M., Korzeniowski, M., &#38; Kutyłowski, J. (2007). Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. In <i>Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i> (Vol. 4362, pp. 260--271). <a href=\"https://doi.org/10.1007/978-3-540-69507-3_21\">https://doi.org/10.1007/978-3-540-69507-3_21</a>","short":"M. Dynia, M. Korzeniowski, J. Kutyłowski, in: Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 2007, pp. 260--271.","bibtex":"@inproceedings{Dynia_Korzeniowski_Kutyłowski_2007, title={Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs}, volume={4362}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-69507-3_21\">10.1007/978-3-540-69507-3_21</a>}, booktitle={Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)}, author={Dynia, Miroslaw and Korzeniowski, Miroslaw and Kutyłowski, Jarosław}, year={2007}, pages={260--271} }","mla":"Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.” <i>Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>, vol. 4362, 2007, pp. 260--271, doi:<a href=\"https://doi.org/10.1007/978-3-540-69507-3_21\">10.1007/978-3-540-69507-3_21</a>.","ieee":"M. Dynia, M. Korzeniowski, and J. Kutyłowski, “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs,” in <i>Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>, 2007, vol. 4362, pp. 260--271.","chicago":"Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosław Kutyłowski. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.” In <i>Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>, 4362:260--271, 2007. <a href=\"https://doi.org/10.1007/978-3-540-69507-3_21\">https://doi.org/10.1007/978-3-540-69507-3_21</a>.","ama":"Dynia M, Korzeniowski M, Kutyłowski J. Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs. In: <i>Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07)</i>. Vol 4362. ; 2007:260--271. doi:<a href=\"https://doi.org/10.1007/978-3-540-69507-3_21\">10.1007/978-3-540-69507-3_21</a>"},"page":"260--271","intvolume":"      4362","year":"2007","publication_status":"published","publication_identifier":{"isbn":["9783540695066","9783540695073"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18929","status":"public","type":"conference","publication":"Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)"},{"related_material":{"link":[{"relation":"confirmation","url":"http://nbn-resolving.de/urn:nbn:de:hbz:466-20080225023"}]},"place":"Universität Paderborn","year":"2007","citation":{"short":"J. Kutylowski, Using Mobile Relays for Ensuring Connectivity in Sparse Networks, Universität Paderborn, 2007.","mla":"Kutylowski, Jaroslaw. <i>Using Mobile Relays for Ensuring Connectivity in Sparse Networks</i>. 2007.","bibtex":"@book{Kutylowski_2007, place={Universität Paderborn}, title={Using Mobile Relays for Ensuring Connectivity in Sparse Networks}, author={Kutylowski, Jaroslaw}, year={2007} }","apa":"Kutylowski, J. (2007). <i>Using Mobile Relays for Ensuring Connectivity in Sparse Networks</i>.","ama":"Kutylowski J. <i>Using Mobile Relays for Ensuring Connectivity in Sparse Networks</i>.; 2007.","ieee":"J. Kutylowski, <i>Using Mobile Relays for Ensuring Connectivity in Sparse Networks</i>. Universität Paderborn, 2007.","chicago":"Kutylowski, Jaroslaw. <i>Using Mobile Relays for Ensuring Connectivity in Sparse Networks</i>. Universität Paderborn, 2007."},"date_updated":"2022-01-06T06:53:54Z","author":[{"full_name":"Kutylowski, Jaroslaw","last_name":"Kutylowski","first_name":"Jaroslaw"}],"date_created":"2020-09-03T10:51:14Z","title":"Using Mobile Relays for Ensuring Connectivity in Sparse Networks","type":"dissertation","status":"public","_id":"18931","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}]},{"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-09-03T10:59:07Z","_id":"18933","user_id":"15415","department":[{"_id":"63"}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-09-03T10:59:07Z","creator":"koala","date_created":"2020-09-03T10:59:07Z","file_size":229166,"file_id":"18934","file_name":"pub-hni-2854.pdf","access_level":"closed"}],"status":"public","type":"preprint","title":"Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries","date_updated":"2022-01-06T06:53:55Z","author":[{"first_name":"Jaroslaw","full_name":"Kutylowski, Jaroslaw","last_name":"Kutylowski"}],"date_created":"2020-09-03T10:59:51Z","year":"2007","citation":{"short":"J. Kutylowski, (2007).","mla":"Kutylowski, Jaroslaw. <i>Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries</i>. 2007.","bibtex":"@article{Kutylowski_2007, title={Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries}, author={Kutylowski, Jaroslaw}, year={2007} }","apa":"Kutylowski, J. (2007). Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries.","ama":"Kutylowski J. Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries. 2007.","ieee":"J. Kutylowski, “Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries.” 2007.","chicago":"Kutylowski, Jaroslaw. “Competitive Maintenance of Minimum Spanning Trees under Stochastic Adversaries,” 2007."},"has_accepted_license":"1"},{"status":"public","report_number":"TIK-Report 272","type":"report","user_id":"24135","department":[{"_id":"27"},{"_id":"518"}],"_id":"2394","citation":{"bibtex":"@book{Beutel_Plessl_Woehrle_2007, place={Computer Engineering and Networks Laboratory, ETH Zurich}, title={Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework}, author={Beutel, Jan and Plessl, Christian and Woehrle, Matthias}, year={2007} }","short":"J. Beutel, C. Plessl, M. Woehrle, Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework, Computer Engineering and Networks Laboratory, ETH Zurich, 2007.","mla":"Beutel, Jan, et al. <i>Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework</i>. 2007.","apa":"Beutel, J., Plessl, C., &#38; Woehrle, M. (2007). <i>Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework</i>. Computer Engineering and Networks Laboratory, ETH Zurich.","chicago":"Beutel, Jan, Christian Plessl, and Matthias Woehrle. <i>Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework</i>. Computer Engineering and Networks Laboratory, ETH Zurich, 2007.","ieee":"J. Beutel, C. Plessl, and M. Woehrle, <i>Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework</i>. Computer Engineering and Networks Laboratory, ETH Zurich, 2007.","ama":"Beutel J, Plessl C, Woehrle M. <i>Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework</i>. Computer Engineering and Networks Laboratory, ETH Zurich; 2007."},"place":"Computer Engineering and Networks Laboratory, ETH Zurich","year":"2007","title":"Increasing the Reliability of Wireless Sensor Networks with a Unit Testing Framework","date_created":"2018-04-17T13:36:38Z","author":[{"full_name":"Beutel, Jan","last_name":"Beutel","first_name":"Jan"},{"first_name":"Christian","orcid":"0000-0001-5728-9982","last_name":"Plessl","full_name":"Plessl, Christian","id":"16153"},{"first_name":"Matthias","full_name":"Woehrle, Matthias","last_name":"Woehrle"}],"date_updated":"2022-01-06T06:56:04Z"},{"status":"public","type":"conference","publication":"IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20374","citation":{"short":"M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, Y. Shi, in: IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5, IEEE Press, 2007, pp. 310--315.","bibtex":"@inproceedings{Dorigo_Hamann_Szymanski_Wörn_Shi_2007, title={Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics}, DOI={<a href=\"https://doi.org/10.1109/SIS.2007.367953\">10.1109/SIS.2007.367953</a>}, booktitle={IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5}, publisher={IEEE Press}, author={Dorigo, Marco and Hamann, Heiko and Szymanski, Marc and Wörn, Heinz and Shi, Yuhui}, year={2007}, pages={310--315} }","mla":"Dorigo, Marco, et al. “Orientation in a Trail Network by Exploiting Its Geometry for Swarm Robotics.” <i>IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5</i>, IEEE Press, 2007, pp. 310--315, doi:<a href=\"https://doi.org/10.1109/SIS.2007.367953\">10.1109/SIS.2007.367953</a>.","apa":"Dorigo, M., Hamann, H., Szymanski, M., Wörn, H., &#38; Shi, Y. (2007). Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics. In <i>IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5</i> (pp. 310--315). IEEE Press. <a href=\"https://doi.org/10.1109/SIS.2007.367953\">https://doi.org/10.1109/SIS.2007.367953</a>","ama":"Dorigo M, Hamann H, Szymanski M, Wörn H, Shi Y. Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics. In: <i>IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5</i>. IEEE Press; 2007:310--315. doi:<a href=\"https://doi.org/10.1109/SIS.2007.367953\">10.1109/SIS.2007.367953</a>","ieee":"M. Dorigo, H. Hamann, M. Szymanski, H. Wörn, and Y. Shi, “Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics,” in <i>IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5</i>, 2007, pp. 310--315.","chicago":"Dorigo, Marco, Heiko Hamann, Marc Szymanski, Heinz Wörn, and Yuhui Shi. “Orientation in a Trail Network by Exploiting Its Geometry for Swarm Robotics.” In <i>IEEE Swarm Intelligence Symposium, Honolulu, USA, April 1-5</i>, 310--315. IEEE Press, 2007. <a href=\"https://doi.org/10.1109/SIS.2007.367953\">https://doi.org/10.1109/SIS.2007.367953</a>."},"page":"310--315","year":"2007","doi":"10.1109/SIS.2007.367953","title":"Orientation in a Trail Network by Exploiting its Geometry for Swarm Robotics","date_created":"2020-11-17T14:59:51Z","author":[{"full_name":"Dorigo, Marco","last_name":"Dorigo","first_name":"Marco"},{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"first_name":"Marc","full_name":"Szymanski, Marc","last_name":"Szymanski"},{"full_name":"Wörn, Heinz","last_name":"Wörn","first_name":"Heinz"},{"full_name":"Shi, Yuhui","last_name":"Shi","first_name":"Yuhui"}],"date_updated":"2022-01-06T06:54:26Z","publisher":"IEEE Press"},{"doi":"10.1007/978-3-540-71541-2_4","title":"An analytical and spatial model of foraging in a swarm of robots","author":[{"last_name":"Hamann","full_name":"Hamann, Heiko","first_name":"Heiko"},{"last_name":"Wörn","full_name":"Wörn, Heinz","first_name":"Heinz"},{"full_name":"Sahin, Erol","last_name":"Sahin","first_name":"Erol"},{"last_name":"Spears","full_name":"Spears, Winfield","first_name":"Winfield"},{"last_name":"Winfield","full_name":"Winfield, Winfield","first_name":"Winfield"}],"date_created":"2020-11-19T11:22:26Z","volume":4433,"date_updated":"2022-01-06T06:54:27Z","citation":{"ieee":"H. Hamann, H. Wörn, E. Sahin, W. Spears, and W. Winfield, “An analytical and spatial model of foraging in a swarm of robots,” in <i>Swarm Robotics - Second SAB 2006 International Workshop</i>, 2007, vol. 4433, pp. 43--55.","chicago":"Hamann, Heiko, Heinz Wörn, Erol Sahin, Winfield Spears, and Winfield Winfield. “An Analytical and Spatial Model of Foraging in a Swarm of Robots.” In <i>Swarm Robotics - Second SAB 2006 International Workshop</i>, 4433:43--55, 2007. <a href=\"https://doi.org/10.1007/978-3-540-71541-2_4\">https://doi.org/10.1007/978-3-540-71541-2_4</a>.","ama":"Hamann H, Wörn H, Sahin E, Spears W, Winfield W. An analytical and spatial model of foraging in a swarm of robots. In: <i>Swarm Robotics - Second SAB 2006 International Workshop</i>. Vol 4433. ; 2007:43--55. doi:<a href=\"https://doi.org/10.1007/978-3-540-71541-2_4\">10.1007/978-3-540-71541-2_4</a>","bibtex":"@inproceedings{Hamann_Wörn_Sahin_Spears_Winfield_2007, title={An analytical and spatial model of foraging in a swarm of robots}, volume={4433}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-71541-2_4\">10.1007/978-3-540-71541-2_4</a>}, booktitle={Swarm Robotics - Second SAB 2006 International Workshop}, author={Hamann, Heiko and Wörn, Heinz and Sahin, Erol and Spears, Winfield and Winfield, Winfield}, year={2007}, pages={43--55} }","short":"H. Hamann, H. Wörn, E. Sahin, W. Spears, W. Winfield, in: Swarm Robotics - Second SAB 2006 International Workshop, 2007, pp. 43--55.","mla":"Hamann, Heiko, et al. “An Analytical and Spatial Model of Foraging in a Swarm of Robots.” <i>Swarm Robotics - Second SAB 2006 International Workshop</i>, vol. 4433, 2007, pp. 43--55, doi:<a href=\"https://doi.org/10.1007/978-3-540-71541-2_4\">10.1007/978-3-540-71541-2_4</a>.","apa":"Hamann, H., Wörn, H., Sahin, E., Spears, W., &#38; Winfield, W. (2007). An analytical and spatial model of foraging in a swarm of robots. In <i>Swarm Robotics - Second SAB 2006 International Workshop</i> (Vol. 4433, pp. 43--55). <a href=\"https://doi.org/10.1007/978-3-540-71541-2_4\">https://doi.org/10.1007/978-3-540-71541-2_4</a>"},"intvolume":"      4433","page":"43--55","year":"2007","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20431","status":"public","type":"conference","publication":"Swarm Robotics - Second SAB 2006 International Workshop"},{"author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"full_name":"Wörn, Heinz","last_name":"Wörn","first_name":"Heinz"}],"date_created":"2020-11-19T11:24:11Z","date_updated":"2022-01-06T06:54:27Z","doi":"10.1109/saso.2007.3","title":"A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support","publication_identifier":{"isbn":["0769529062"]},"publication_status":"published","page":"23--31","citation":{"chicago":"Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support.” In <i>First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)</i>, 23--31, 2007. <a href=\"https://doi.org/10.1109/saso.2007.3\">https://doi.org/10.1109/saso.2007.3</a>.","ieee":"H. Hamann and H. Wörn, “A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support,” in <i>First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)</i>, 2007, pp. 23--31.","ama":"Hamann H, Wörn H. A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support. In: <i>First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)</i>. ; 2007:23--31. doi:<a href=\"https://doi.org/10.1109/saso.2007.3\">10.1109/saso.2007.3</a>","short":"H. Hamann, H. Wörn, in: First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007), 2007, pp. 23--31.","mla":"Hamann, Heiko, and Heinz Wörn. “A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support.” <i>First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)</i>, 2007, pp. 23--31, doi:<a href=\"https://doi.org/10.1109/saso.2007.3\">10.1109/saso.2007.3</a>.","bibtex":"@inproceedings{Hamann_Wörn_2007, title={A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support}, DOI={<a href=\"https://doi.org/10.1109/saso.2007.3\">10.1109/saso.2007.3</a>}, booktitle={First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)}, author={Hamann, Heiko and Wörn, Heinz}, year={2007}, pages={23--31} }","apa":"Hamann, H., &#38; Wörn, H. (2007). A Space- and Time-Continuous Model of Self-Organizing Robot Swarms for Design Support. In <i>First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)</i> (pp. 23--31). <a href=\"https://doi.org/10.1109/saso.2007.3\">https://doi.org/10.1109/saso.2007.3</a>"},"year":"2007","department":[{"_id":"63"},{"_id":"238"}],"user_id":"15415","_id":"20432","language":[{"iso":"eng"}],"publication":"First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)","type":"conference","status":"public","abstract":[{"lang":"eng","text":"Designing and implementing artificial self-organizing systems is a challenging task since they typically behave non- intuitive and only little theoretical foundations exist. Predicting a system of many components with a huge amount of interactions is beyond human skills. The currently common use of simulations for design support is not satisfying, as it is time-consuming and the results are most likely sub- optimal. In this work, we present the derivation of an analytical, time-, and space-continuous model for a swarm of autonomous robots based on the Fokker-Planck equation. While the motion model is in most parts physically motivated, the communication model is based on a heuristic approach. A showcase application to a recently proposed scenario of collective perception in a huge swarm of robots with very limited abilities is given and the simulation results are compared to the model. Despite the high level of abstraction, the prediction discrepancies are small and the parameters can be mapped one-to-one from the model to the control algorithm. Finally, we give an outlook on the capabilities of the proposed model, discuss its limitations, and suggest an improvement that could reduce the number of empirically determined parameters."}]},{"type":"journal_article","publication":"Parallel Processing Letters","status":"public","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"_id":"20433","language":[{"iso":"eng"}],"issue":"3","citation":{"mla":"Hamann, Heiko, et al. “Embodied Computation.” <i>Parallel Processing Letters</i>, vol. 17, no. 3, 2007, pp. 287--298.","bibtex":"@article{Hamann_Wörn_Nagy_Nagy_2007, title={Embodied Computation}, volume={17}, number={3}, journal={Parallel Processing Letters}, author={Hamann, Heiko and Wörn, Heinz and Nagy, Marius and Nagy, Naya}, year={2007}, pages={287--298} }","short":"H. Hamann, H. Wörn, M. Nagy, N. Nagy, Parallel Processing Letters 17 (2007) 287--298.","apa":"Hamann, H., Wörn, H., Nagy, M., &#38; Nagy, N. (2007). Embodied Computation. <i>Parallel Processing Letters</i>, <i>17</i>(3), 287--298.","ama":"Hamann H, Wörn H, Nagy M, Nagy N. Embodied Computation. <i>Parallel Processing Letters</i>. 2007;17(3):287--298.","chicago":"Hamann, Heiko, Heinz Wörn, Marius Nagy, and Naya Nagy. “Embodied Computation.” <i>Parallel Processing Letters</i> 17, no. 3 (2007): 287--298.","ieee":"H. Hamann, H. Wörn, M. Nagy, and N. Nagy, “Embodied Computation,” <i>Parallel Processing Letters</i>, vol. 17, no. 3, pp. 287--298, 2007."},"page":"287--298","intvolume":"        17","year":"2007","date_created":"2020-11-19T11:32:32Z","author":[{"full_name":"Hamann, Heiko","last_name":"Hamann","first_name":"Heiko"},{"first_name":"Heinz","last_name":"Wörn","full_name":"Wörn, Heinz"},{"full_name":"Nagy, Marius","last_name":"Nagy","first_name":"Marius"},{"first_name":"Naya","full_name":"Nagy, Naya","last_name":"Nagy"}],"volume":17,"date_updated":"2022-01-06T06:54:27Z","title":"Embodied Computation"},{"title":"From Micro to Nano and Swarm Robotics","doi":"10.1142/9789812770189_0003","date_updated":"2022-01-06T06:54:27Z","author":[{"first_name":"Heiko","full_name":"Hamann, Heiko","last_name":"Hamann"},{"first_name":"Marc","full_name":"Szymanski, Marc","last_name":"Szymanski"},{"last_name":"Wörn","full_name":"Wörn, Heinz","first_name":"Heinz"},{"last_name":"Estana","full_name":"Estana, Ramon","first_name":"Ramon"},{"last_name":"Xie","full_name":"Xie, Ming","first_name":"Ming"},{"full_name":"Dubowsky, Steven","last_name":"Dubowsky","first_name":"Steven"}],"date_created":"2020-11-19T11:37:49Z","year":"2007","citation":{"bibtex":"@inproceedings{Hamann_Szymanski_Wörn_Estana_Xie_Dubowsky_2007, title={From Micro to Nano and Swarm Robotics}, DOI={<a href=\"https://doi.org/10.1142/9789812770189_0003\">10.1142/9789812770189_0003</a>}, booktitle={Advances in Climbing and walking robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18}, author={Hamann, Heiko and Szymanski, Marc and Wörn, Heinz and Estana, Ramon and Xie, Ming and Dubowsky, Steven}, year={2007}, pages={15--24} }","short":"H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, S. Dubowsky, in: Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18, 2007, pp. 15--24.","mla":"Hamann, Heiko, et al. “From Micro to Nano and Swarm Robotics.” <i>Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18</i>, 2007, pp. 15--24, doi:<a href=\"https://doi.org/10.1142/9789812770189_0003\">10.1142/9789812770189_0003</a>.","apa":"Hamann, H., Szymanski, M., Wörn, H., Estana, R., Xie, M., &#38; Dubowsky, S. (2007). From Micro to Nano and Swarm Robotics. In <i>Advances in Climbing and walking robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18</i> (pp. 15--24). <a href=\"https://doi.org/10.1142/9789812770189_0003\">https://doi.org/10.1142/9789812770189_0003</a>","ama":"Hamann H, Szymanski M, Wörn H, Estana R, Xie M, Dubowsky S. From Micro to Nano and Swarm Robotics. In: <i>Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18</i>. ; 2007:15--24. doi:<a href=\"https://doi.org/10.1142/9789812770189_0003\">10.1142/9789812770189_0003</a>","ieee":"H. Hamann, M. Szymanski, H. Wörn, R. Estana, M. Xie, and S. Dubowsky, “From Micro to Nano and Swarm Robotics,” in <i>Advances in Climbing and walking robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18</i>, 2007, pp. 15--24.","chicago":"Hamann, Heiko, Marc Szymanski, Heinz Wörn, Ramon Estana, Ming Xie, and Steven Dubowsky. “From Micro to Nano and Swarm Robotics.” In <i>Advances in Climbing and Walking Robots. Proceedings of 10th International Conference (CLAWAR’07), Singapore, July 16-18</i>, 15--24, 2007. <a href=\"https://doi.org/10.1142/9789812770189_0003\">https://doi.org/10.1142/9789812770189_0003</a>."},"page":"15--24","language":[{"iso":"eng"}],"_id":"20434","user_id":"15415","department":[{"_id":"63"},{"_id":"238"}],"abstract":[{"lang":"eng","text":"Current research in Micro, Nano and Swarm Robots as results of the European projects Miniman, MiCRoN and I-SWARM will be presented. First, the design and the control of 5 to 10cm3 sized mobile micro robots with five degrees of freedom will be shown. They can handle miniaturized parts as for example an optical component or a biological cell with a size in the micrometre-area with an accuracy of 100nm under a microscope or a raster-electron microscope. Second, the design and the control of a 1cm3-sized mobile untethered micro robot will be demonstrated. Here, the robot consists of five parts: the Piezzo locomotion module, the micro control unit, the communication unit, the navigation system and the micro gripper. The mobile robot can be guided and positioned in an arena with an accuracy of 5 micrometre and can be programmed and controlled over the wireless communication unit. Third, the design and the control of 3 × 3 × 3 mm3 sized micro-/nanorobots with 2 degrees of freedom will be presented. The transmission of energy and the communication between the robots is realized via infrared. The robot controller is fully integrated and has limited functionalities. Via basic sensors communication functions and elementary rules and behaviours the micro robot can act in a swarm consisting of hundreds and thousands of robots. Future applications could be monitoring-, inspection-, exploring-tasks etc. of big areas or objects."}],"status":"public","type":"conference","publication":"Advances in Climbing and walking robots. Proceedings of 10th International Conference (CLAWAR'07), Singapore, July 16-18"},{"status":"public","publication":"Electronic Notes in Theoretical Computer Science","type":"journal_article","language":[{"iso":"eng"}],"_id":"17980","department":[{"_id":"63"}],"user_id":"15415","year":"2007","page":"255-274","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>.","ieee":"M. Ziegler, “Revising Type-2 Computation and Degrees of Discontinuity,” <i>Electronic Notes in Theoretical Computer Science</i>, pp. 255–274, 2007.","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>","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} }","short":"M. Ziegler, Electronic Notes in Theoretical Computer Science (2007) 255–274.","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>.","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>"},"publication_identifier":{"issn":["1571-0661"]},"publication_status":"published","title":"Revising Type-2 Computation and Degrees of Discontinuity","doi":"10.1016/j.entcs.2006.08.015","date_updated":"2022-01-06T06:53:24Z","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_created":"2020-08-14T13:30:00Z"},{"date_created":"2020-08-14T13:32:37Z","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:24Z","doi":"10.1007/s00224-006-1343-6","title":"Real Hypercomputation and Continuity","publication_status":"published","publication_identifier":{"issn":["1432-4350","1433-0490"]},"citation":{"chicago":"Ziegler, Martin. “Real Hypercomputation and Continuity.” <i>Theory of Computing Systems</i>, 2007, 177–206. <a href=\"https://doi.org/10.1007/s00224-006-1343-6\">https://doi.org/10.1007/s00224-006-1343-6</a>.","ieee":"M. Ziegler, “Real Hypercomputation and Continuity,” <i>Theory of Computing Systems</i>, pp. 177–206, 2007.","ama":"Ziegler M. Real Hypercomputation and Continuity. <i>Theory of Computing Systems</i>. 2007:177-206. doi:<a href=\"https://doi.org/10.1007/s00224-006-1343-6\">10.1007/s00224-006-1343-6</a>","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>.","bibtex":"@article{Ziegler_2007, title={Real Hypercomputation and Continuity}, DOI={<a href=\"https://doi.org/10.1007/s00224-006-1343-6\">10.1007/s00224-006-1343-6</a>}, journal={Theory of Computing Systems}, author={Ziegler, Martin}, year={2007}, pages={177–206} }","short":"M. Ziegler, Theory of Computing Systems (2007) 177–206.","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>"},"page":"177-206","year":"2007","user_id":"15415","department":[{"_id":"63"}],"_id":"17981","language":[{"iso":"eng"}],"type":"journal_article","publication":"Theory of Computing Systems","status":"public"},{"date_updated":"2022-01-06T06:53:24Z","date_created":"2020-08-14T13:33:50Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"title":"(Short) Survey of Real Hypercomputation","doi":"10.1007/978-3-540-73001-9_86","publication_status":"published","publication_identifier":{"isbn":["9783540730002","9783540730019"],"issn":["0302-9743","1611-3349"]},"year":"2007","place":"Berlin, Heidelberg","citation":{"ieee":"M. Ziegler, “(Short) Survey of Real Hypercomputation,” in <i>Lecture Notes in Computer Science</i>, 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>.","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>","short":"M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","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>.","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} }","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>"},"_id":"17982","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public"},{"_id":"17983","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Mathematical Foundations of Computer Science 2007","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:53:24Z","author":[{"last_name":"Meer","full_name":"Meer, Klaus","first_name":"Klaus"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_created":"2020-08-14T13:35:56Z","title":"Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation","doi":"10.1007/978-3-540-74456-6_64","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540744559","9783540744566"]},"publication_status":"published","year":"2007","place":"Berlin, Heidelberg","citation":{"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>","short":"K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.","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>.","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>","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.","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>."}},{"abstract":[{"lang":"eng","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."}],"status":"public","type":"preprint","publication":"arXiv:0709.0624","language":[{"iso":"eng"}],"_id":"17984","user_id":"15415","department":[{"_id":"63"}],"year":"2007","citation":{"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} }","apa":"Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2007). On Faster Integer Calculations using Non-Arithmetic Primitives. <i>ArXiv:0709.0624</i>.","ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations using Non-Arithmetic Primitives. <i>arXiv:07090624</i>. 2007.","ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations using Non-Arithmetic Primitives,” <i>arXiv:0709.0624</i>. 2007.","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>ArXiv:0709.0624</i>, 2007."},"title":"On Faster Integer Calculations using Non-Arithmetic Primitives","date_updated":"2022-01-06T06:53:24Z","author":[{"first_name":"Katharina","last_name":"Lürwer-Brüggemeier","full_name":"Lürwer-Brüggemeier, Katharina"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-14T13:36:55Z"}]