[{"doi":"10.1007/978-3-540-74456-6_64","user_id":"15415","_id":"17983","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:24Z","publication_status":"published","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","last_name":"Ziegler","first_name":"Martin"}],"year":"2007","title":"Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation","status":"public","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-08-14T13:35:56Z","citation":{"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>","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>."},"publication":"Mathematical Foundations of Computer Science 2007"},{"_id":"16640","doi":"10.1007/3-540-44683-4_46","user_id":"15701","title":"Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs","status":"public","year":"2007","publication_identifier":{"isbn":["9783540424963","9783540446835"],"issn":["0302-9743"]},"author":[{"first_name":"Burkhard","last_name":"Monien","full_name":"Monien, Burkhard"},{"full_name":"Preis, Robert","first_name":"Robert","last_name":"Preis"}],"date_updated":"2022-01-06T06:52:53Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-04-16T08:58:07Z","type":"book_chapter","department":[{"_id":"101"}],"publication":"Mathematical Foundations of Computer Science 2001","citation":{"ieee":"B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs,” in <i>Mathematical Foundations of Computer Science 2001</i>, Berlin, Heidelberg, 2007.","apa":"Monien, B., &#38; Preis, R. (2007). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In <i>Mathematical Foundations of Computer Science 2001</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44683-4_46\">https://doi.org/10.1007/3-540-44683-4_46</a>","chicago":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” In <i>Mathematical Foundations of Computer Science 2001</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44683-4_46\">https://doi.org/10.1007/3-540-44683-4_46</a>.","short":"B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.","mla":"Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.” <i>Mathematical Foundations of Computer Science 2001</i>, 2007, doi:<a href=\"https://doi.org/10.1007/3-540-44683-4_46\">10.1007/3-540-44683-4_46</a>.","bibtex":"@inbook{Monien_Preis_2007, place={Berlin, Heidelberg}, title={Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs}, DOI={<a href=\"https://doi.org/10.1007/3-540-44683-4_46\">10.1007/3-540-44683-4_46</a>}, booktitle={Mathematical Foundations of Computer Science 2001}, author={Monien, Burkhard and Preis, Robert}, year={2007} }","ama":"Monien B, Preis R. Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In: <i>Mathematical Foundations of Computer Science 2001</i>. Berlin, Heidelberg; 2007. doi:<a href=\"https://doi.org/10.1007/3-540-44683-4_46\">10.1007/3-540-44683-4_46</a>"}},{"doi":"10.1007/978-3-540-73390-4_10","user_id":"14961","page":"101-113","publisher":"Springer","_id":"15144","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:16Z","publication_status":"published","title":"Evaluating XPath Queries on XML Data Streams","status":"public","year":"2007","author":[{"full_name":"Böttcher, Stefan","first_name":"Stefan","last_name":"Böttcher","id":"624"},{"id":"14961","first_name":"Rita","last_name":"Steinmetz","full_name":"Steinmetz, Rita"}],"publication_identifier":{"isbn":["9783540733898","9783540733904"],"issn":["0302-9743","1611-3349"]},"type":"conference","department":[{"_id":"69"}],"date_created":"2019-11-22T08:59:56Z","publication":"Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24","citation":{"ieee":"S. Böttcher and R. Steinmetz, “Evaluating XPath Queries on XML Data Streams,” in <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>, 2007, pp. 101–113.","apa":"Böttcher, S., &#38; Steinmetz, R. (2007). Evaluating XPath Queries on XML Data Streams. In <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i> (pp. 101–113). Springer. <a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">https://doi.org/10.1007/978-3-540-73390-4_10</a>","short":"S. Böttcher, R. Steinmetz, in: Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–113.","chicago":"Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.” In <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>, 101–13. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">https://doi.org/10.1007/978-3-540-73390-4_10</a>.","mla":"Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.” <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>, Springer, 2007, pp. 101–13, doi:<a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">10.1007/978-3-540-73390-4_10</a>.","bibtex":"@inproceedings{Böttcher_Steinmetz_2007, title={Evaluating XPath Queries on XML Data Streams}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">10.1007/978-3-540-73390-4_10</a>}, booktitle={Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2007}, pages={101–113} }","ama":"Böttcher S, Steinmetz R. Evaluating XPath Queries on XML Data Streams. In: <i>Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24</i>. Springer; 2007:101-113. doi:<a href=\"https://doi.org/10.1007/978-3-540-73390-4_10\">10.1007/978-3-540-73390-4_10</a>"}},{"doi":"10.1007/978-3-540-74469-6_42","user_id":"14961","publisher":"Springer","_id":"15146","language":[{"iso":"eng"}],"page":"424-433","date_updated":"2022-01-06T06:52:16Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540744672","9783540744696"]},"author":[{"full_name":"Böttcher, Stefan","first_name":"Stefan","last_name":"Böttcher","id":"624"},{"full_name":"Steinmetz, Rita","first_name":"Rita","last_name":"Steinmetz","id":"14961"}],"title":"Data Management for Mobile Ajax Web 2.0 Applications","status":"public","year":"2007","department":[{"_id":"69"}],"type":"conference","date_created":"2019-11-22T09:06:45Z","citation":{"ama":"Böttcher S, Steinmetz R. Data Management for Mobile Ajax Web 2.0 Applications. In: <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>. Springer; 2007:424-433. doi:<a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">10.1007/978-3-540-74469-6_42</a>","bibtex":"@inproceedings{Böttcher_Steinmetz_2007, title={Data Management for Mobile Ajax Web 2.0 Applications}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">10.1007/978-3-540-74469-6_42</a>}, booktitle={Database and Expert Systems Applications, 18th International Conference, DEXA 2007}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2007}, pages={424–433} }","mla":"Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.” <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>, Springer, 2007, pp. 424–33, doi:<a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">10.1007/978-3-540-74469-6_42</a>.","short":"S. Böttcher, R. Steinmetz, in: Database and Expert Systems Applications, 18th International Conference, DEXA 2007, Springer, 2007, pp. 424–433.","chicago":"Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.” In <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>, 424–33. Springer, 2007. <a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">https://doi.org/10.1007/978-3-540-74469-6_42</a>.","apa":"Böttcher, S., &#38; Steinmetz, R. (2007). Data Management for Mobile Ajax Web 2.0 Applications. In <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i> (pp. 424–433). Springer. <a href=\"https://doi.org/10.1007/978-3-540-74469-6_42\">https://doi.org/10.1007/978-3-540-74469-6_42</a>","ieee":"S. Böttcher and R. Steinmetz, “Data Management for Mobile Ajax Web 2.0 Applications,” in <i>Database and Expert Systems Applications, 18th International Conference, DEXA 2007</i>, 2007, pp. 424–433."},"publication":"Database and Expert Systems Applications, 18th International Conference, DEXA 2007"},{"publication":"Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)","citation":{"mla":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>.","ama":"Rührup S, Schindelhauer C. Online Multi-path Routing in a Maze. In: <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>","bibtex":"@inproceedings{Rührup_Schindelhauer_2006, title={Online Multi-path Routing in a Maze}, DOI={<a href=\"https://doi.org/10.1007/11940128_65\">10.1007/11940128_65</a>}, booktitle={Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2006} }","apa":"Rührup, S., &#38; Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>","ieee":"S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006.","short":"S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.” In <i>Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)</i>, 2006. <a href=\"https://doi.org/10.1007/11940128_65\">https://doi.org/10.1007/11940128_65</a>."},"date_created":"2020-10-01T11:51:15Z","type":"conference","department":[{"_id":"63"}],"status":"public","year":"2006","title":"Online Multi-path Routing in a Maze","author":[{"last_name":"Rührup","first_name":"Stefan","full_name":"Rührup, Stefan"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"isbn":["9783540496946","9783540496960"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:54:13Z","publication_status":"published","_id":"19838","language":[{"iso":"eng"}],"doi":"10.1007/11940128_65","user_id":"15415"},{"user_id":"15415","doi":"10.1007/11611257_37","language":[{"iso":"eng"}],"_id":"24277","publication_status":"published","date_updated":"2022-01-06T06:56:13Z","author":[{"first_name":"Jarosław","last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław"},{"full_name":"Zagórski, Filip","first_name":"Filip","last_name":"Zagórski"}],"publication_identifier":{"issn":["0302-9743","1611-3349"]},"year":"2006","title":"Reliable Broadcasting Without Collision Detection","status":"public","department":[{"_id":"63"}],"type":"conference","date_created":"2021-09-13T13:28:29Z","place":"Berlin, Heidelberg","abstract":[{"text":"We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.\r\n\r\nOur goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.\r\n\r\nWe provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.\r\n\r\nOur contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.","lang":"eng"}],"citation":{"bibtex":"@inproceedings{Kutyłowski_Zagórski_2006, place={Berlin, Heidelberg}, title={Reliable Broadcasting Without Collision Detection}, DOI={<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>}, booktitle={SOFSEM 2006: Theory and Practice of Computer Science}, author={Kutyłowski, Jarosław and Zagórski, Filip}, year={2006} }","ama":"Kutyłowski J, Zagórski F. Reliable Broadcasting Without Collision Detection. In: <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. ; 2006. doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>","mla":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” <i>SOFSEM 2006: Theory and Practice of Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","chicago":"Kutyłowski, Jarosław, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.” In <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>.","short":"J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.","ieee":"J. Kutyłowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,” 2006, doi: <a href=\"https://doi.org/10.1007/11611257_37\">10.1007/11611257_37</a>.","apa":"Kutyłowski, J., &#38; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. <i>SOFSEM 2006: Theory and Practice of Computer Science</i>. <a href=\"https://doi.org/10.1007/11611257_37\">https://doi.org/10.1007/11611257_37</a>"},"publication":"SOFSEM 2006: Theory and Practice of Computer Science"},{"place":"Berlin, Heidelberg","date_created":"2018-06-05T08:14:42Z","department":[{"_id":"64"}],"type":"book_chapter","citation":{"chicago":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” In <i>Lecture Notes in Computer Science</i>, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>.","ama":"Blömer J, Krummel V. Fault Based Collision Attacks on AES. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:106-120. doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>","short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.","bibtex":"@inbook{Blömer_Krummel_2006, place={Berlin, Heidelberg}, title={Fault Based Collision Attacks on AES}, DOI={<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Krummel, Volker}, year={2006}, pages={106–120} }","mla":"Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:<a href=\"https://doi.org/10.1007/11889700_11\">10.1007/11889700_11</a>.","apa":"Blömer, J., &#38; Krummel, V. (2006). Fault Based Collision Attacks on AES. In <i>Lecture Notes in Computer Science</i> (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_11\">https://doi.org/10.1007/11889700_11</a>","ieee":"J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120."},"publication":"Lecture Notes in Computer Science","_id":"3004","publisher":"Springer Berlin Heidelberg","page":"106-120","doi":"10.1007/11889700_11","user_id":"25078","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"author":[{"id":"23","last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes"},{"last_name":"Krummel","first_name":"Volker","full_name":"Krummel, Volker"}],"year":"2006","title":"Fault Based Collision Attacks on AES","status":"public","date_updated":"2022-01-06T06:58:50Z","publication_status":"published"},{"publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"}],"title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","status":"public","year":"2006","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","_id":"3005","publisher":"Springer Berlin Heidelberg","page":"13-23","user_id":"25078","doi":"10.1007/11889700_2","citation":{"ieee":"J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.","apa":"Blömer, J., &#38; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In <i>Lecture Notes in Computer Science</i> (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>","chicago":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” In <i>Lecture Notes in Computer Science</i>, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_2\">https://doi.org/10.1007/11889700_2</a>.","short":"J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.","mla":"Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>.","bibtex":"@inbook{Blömer_Otto_2006, place={Berlin, Heidelberg}, title={Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}, DOI={<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin}, year={2006}, pages={13–23} }","ama":"Blömer J, Otto M. Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:13-23. doi:<a href=\"https://doi.org/10.1007/11889700_2\">10.1007/11889700_2</a>"},"publication":"Lecture Notes in Computer Science","date_created":"2018-06-05T08:15:48Z","place":"Berlin, Heidelberg","department":[{"_id":"64"}],"type":"book_chapter"},{"doi":"10.1007/11889700_4","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Otto, Martin","first_name":"Martin","last_name":"Otto"},{"full_name":"Seifert, Jean-Pierre","first_name":"Jean-Pierre","last_name":"Seifert"}],"title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","year":"2006","publication_status":"published","date_updated":"2022-01-06T06:58:50Z","date_created":"2018-06-05T08:17:12Z","file":[{"creator":"feidens","date_created":"2018-06-05T08:18:56Z","relation":"main_file","date_updated":"2018-06-05T08:18:56Z","file_name":"SignChangeFaultAttacksOnECC.pdf","access_level":"closed","file_size":259146,"file_id":"3009","success":1,"content_type":"application/pdf"}],"department":[{"_id":"64"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","_id":"3007","publisher":"Springer Berlin Heidelberg","page":"36-52","user_id":"25078","ddc":["000"],"status":"public","has_accepted_license":"1","place":"Berlin, Heidelberg","citation":{"mla":"Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>.","apa":"Blömer, J., Otto, M., &#38; Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In <i>Lecture Notes in Computer Science</i> (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11889700_4\">https://doi.org/10.1007/11889700_4</a>","ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.","ama":"Blömer J, Otto M, Seifert J-P. Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2006:36-52. doi:<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.” In <i>Lecture Notes in Computer Science</i>, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11889700_4\">https://doi.org/10.1007/11889700_4</a>.","bibtex":"@inbook{Blömer_Otto_Seifert_2006, place={Berlin, Heidelberg}, title={Sign Change Fault Attacks on Elliptic Curve Cryptosystems}, DOI={<a href=\"https://doi.org/10.1007/11889700_4\">10.1007/11889700_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2006}, pages={36–52} }"},"file_date_updated":"2018-06-05T08:18:56Z"},{"date_updated":"2022-01-06T06:53:54Z","publication_status":"published","publication_identifier":{"isbn":["9783540327653","9783540327660"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw","last_name":"Korzeniowski"},{"last_name":"Schindelhauer","first_name":"Christian","full_name":"Schindelhauer, Christian"}],"title":"Power-Aware Collective Tree Exploration","status":"public","year":"2006","doi":"10.1007/11682127_24","user_id":"15415","language":[{"iso":"eng"}],"_id":"18926","page":"341--351","citation":{"ieee":"M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in <i>Architecture of Computing Systems - ARCS</i>, 2006, no. 3894, pp. 341--351.","apa":"Dynia, M., Korzeniowski, M., &#38; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In <i>Architecture of Computing Systems - ARCS</i> (pp. 341--351). <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>","short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.","chicago":"Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.” In <i>Architecture of Computing Systems - ARCS</i>, 341--351, 2006. <a href=\"https://doi.org/10.1007/11682127_24\">https://doi.org/10.1007/11682127_24</a>.","mla":"Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.” <i>Architecture of Computing Systems - ARCS</i>, no. 3894, 2006, pp. 341--351, doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>.","bibtex":"@inproceedings{Dynia_Korzeniowski_Schindelhauer_2006, title={Power-Aware Collective Tree Exploration}, DOI={<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>}, number={3894}, booktitle={Architecture of Computing Systems - ARCS}, author={Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}, year={2006}, pages={341--351} }","ama":"Dynia M, Korzeniowski M, Schindelhauer C. Power-Aware Collective Tree Exploration. In: <i>Architecture of Computing Systems - ARCS</i>. ; 2006:341--351. doi:<a href=\"https://doi.org/10.1007/11682127_24\">10.1007/11682127_24</a>"},"issue":"3894","publication":"Architecture of Computing Systems - ARCS","department":[{"_id":"63"}],"type":"conference","date_created":"2020-09-03T10:13:56Z"},{"_id":"17987","language":[{"iso":"eng"}],"doi":"10.1007/11780342_39","user_id":"15415","title":"Uncomputability Below the Real Halting Problem","status":"public","year":"2006","publication_identifier":{"isbn":["9783540354666","9783540354680"],"issn":["0302-9743","1611-3349"]},"author":[{"full_name":"Meer, Klaus","last_name":"Meer","first_name":"Klaus"},{"full_name":"Ziegler, Martin","first_name":"Martin","last_name":"Ziegler"}],"date_updated":"2022-01-06T06:53:24Z","publication_status":"published","place":"Berlin, Heidelberg","date_created":"2020-08-14T13:43:09Z","type":"book_chapter","department":[{"_id":"63"}],"publication":"Logical Approaches to Computational Barriers","citation":{"bibtex":"@inbook{Meer_Ziegler_2006, place={Berlin, Heidelberg}, title={Uncomputability Below the Real Halting Problem}, DOI={<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>}, booktitle={Logical Approaches to Computational Barriers}, author={Meer, Klaus and Ziegler, Martin}, year={2006} }","ama":"Meer K, Ziegler M. Uncomputability Below the Real Halting Problem. In: <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>","mla":"Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” <i>Logical Approaches to Computational Barriers</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11780342_39\">10.1007/11780342_39</a>.","chicago":"Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.” In <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11780342_39\">https://doi.org/10.1007/11780342_39</a>.","short":"K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.","ieee":"K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in <i>Logical Approaches to Computational Barriers</i>, Berlin, Heidelberg, 2006.","apa":"Meer, K., &#38; Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In <i>Logical Approaches to Computational Barriers</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11780342_39\">https://doi.org/10.1007/11780342_39</a>"}},{"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540327554","9783540327561"]},"author":[{"full_name":"Demaine, Erik D.","last_name":"Demaine","first_name":"Erik D."},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Pagh, Rasmus","last_name":"Pagh","first_name":"Rasmus"},{"full_name":"Pǎtraşcu, Mihai","first_name":"Mihai","last_name":"Pǎtraşcu"}],"year":"2006","title":"De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)","status":"public","doi":"10.1007/11682462_34","user_id":"15415","_id":"16472","language":[{"iso":"eng"}],"citation":{"chicago":"Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Pǎtraşcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” In <i>LATIN 2006: Theoretical Informatics</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11682462_34\">https://doi.org/10.1007/11682462_34</a>.","short":"E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.","apa":"Demaine, E. D., Meyer auf der Heide, F., Pagh, R., &#38; Pǎtraşcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In <i>LATIN 2006: Theoretical Informatics</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11682462_34\">https://doi.org/10.1007/11682462_34</a>","ieee":"E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Pǎtraşcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space),” in <i>LATIN 2006: Theoretical Informatics</i>, Berlin, Heidelberg, 2006.","ama":"Demaine ED, Meyer auf der Heide F, Pagh R, Pǎtraşcu M. De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space). In: <i>LATIN 2006: Theoretical Informatics</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11682462_34\">10.1007/11682462_34</a>","bibtex":"@inbook{Demaine_Meyer auf der Heide_Pagh_Pǎtraşcu_2006, place={Berlin, Heidelberg}, title={De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)}, DOI={<a href=\"https://doi.org/10.1007/11682462_34\">10.1007/11682462_34</a>}, booktitle={LATIN 2006: Theoretical Informatics}, author={Demaine, Erik D. and Meyer auf der Heide, Friedhelm and Pagh, Rasmus and Pǎtraşcu, Mihai}, year={2006} }","mla":"Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space).” <i>LATIN 2006: Theoretical Informatics</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11682462_34\">10.1007/11682462_34</a>."},"publication":"LATIN 2006: Theoretical Informatics","department":[{"_id":"63"}],"type":"book_chapter","place":"Berlin, Heidelberg","date_created":"2020-04-08T09:36:10Z"},{"year":"2006","status":"public","title":"Smart Robot Teams Exploring Sparse Trees","author":[{"first_name":"M.","last_name":"Dynia","full_name":"Dynia, M."},{"full_name":"Kutyłowski, J.","last_name":"Kutyłowski","first_name":"J."},{"full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm","id":"15523"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"publication_identifier":{"isbn":["9783540377917","9783540377931"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","_id":"16473","language":[{"iso":"eng"}],"doi":"10.1007/11821069_29","user_id":"15415","publication":"Lecture Notes in Computer Science","citation":{"apa":"Dynia, M., Kutyłowski, J., Meyer auf der Heide, F., &#38; Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11821069_29\">https://doi.org/10.1007/11821069_29</a>","ieee":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg, 2006.","short":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.","chicago":"Dynia, M., J. Kutyłowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11821069_29\">https://doi.org/10.1007/11821069_29</a>.","mla":"Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.” <i>Lecture Notes in Computer Science</i>, 2006, doi:<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>.","ama":"Dynia M, Kutyłowski J, Meyer auf der Heide F, Schindelhauer C. Smart Robot Teams Exploring Sparse Trees. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>","bibtex":"@inbook{Dynia_Kutyłowski_Meyer auf der Heide_Schindelhauer_2006, place={Berlin, Heidelberg}, title={Smart Robot Teams Exploring Sparse Trees}, DOI={<a href=\"https://doi.org/10.1007/11821069_29\">10.1007/11821069_29</a>}, booktitle={Lecture Notes in Computer Science}, author={Dynia, M. and Kutyłowski, J. and Meyer auf der Heide, Friedhelm and Schindelhauer, Christian}, year={2006} }"},"place":"Berlin, Heidelberg","date_created":"2020-04-08T09:38:28Z","type":"book_chapter","department":[{"_id":"63"}]},{"title":"DTD-Driven Structure Preserving XML Compression","status":"public","year":"2006","publication_identifier":{"isbn":["9783540359692","9783540359715"],"issn":["0302-9743","1611-3349"]},"author":[{"id":"624","first_name":"Stefan","last_name":"Böttcher","full_name":"Böttcher, Stefan"},{"id":"14961","first_name":"Rita","last_name":"Steinmetz","full_name":"Steinmetz, Rita"}],"publication_status":"published","date_updated":"2022-01-06T06:52:16Z","page":"266-269","_id":"15150","language":[{"iso":"eng"}],"user_id":"14961","doi":"10.1007/11788911_27","publication":"Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23","citation":{"apa":"Böttcher, S., &#38; Steinmetz, R. (2006). DTD-Driven Structure Preserving XML Compression. In <i>Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23</i> (pp. 266–269). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11788911_27\">https://doi.org/10.1007/11788911_27</a>","mla":"Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.” <i>Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23</i>, 2006, pp. 266–69, doi:<a href=\"https://doi.org/10.1007/11788911_27\">10.1007/11788911_27</a>.","ieee":"S. Böttcher and R. Steinmetz, “DTD-Driven Structure Preserving XML Compression,” in <i>Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23</i>, 2006, pp. 266–269.","chicago":"Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.” In <i>Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23</i>, 266–69. Berlin, Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11788911_27\">https://doi.org/10.1007/11788911_27</a>.","ama":"Böttcher S, Steinmetz R. DTD-Driven Structure Preserving XML Compression. In: <i>Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23</i>. Berlin, Heidelberg; 2006:266-269. doi:<a href=\"https://doi.org/10.1007/11788911_27\">10.1007/11788911_27</a>","short":"S. Böttcher, R. Steinmetz, in: Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, Berlin, Heidelberg, 2006, pp. 266–269.","bibtex":"@inproceedings{Böttcher_Steinmetz_2006, place={Berlin, Heidelberg}, title={DTD-Driven Structure Preserving XML Compression}, DOI={<a href=\"https://doi.org/10.1007/11788911_27\">10.1007/11788911_27</a>}, booktitle={Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2006}, pages={266–269} }"},"date_created":"2019-11-22T09:21:07Z","place":"Berlin, Heidelberg","type":"conference","department":[{"_id":"69"}]},{"department":[{"_id":"69"}],"type":"conference","date_created":"2019-11-22T09:22:46Z","citation":{"short":"S. Böttcher, R. Steinmetz, in: Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–174.","chicago":"Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.” In <i>Secure Data Management, Third VLDB Workshop, SDM 2006</i>, 160–74. Springer, 2006. <a href=\"https://doi.org/10.1007/11844662_12\">https://doi.org/10.1007/11844662_12</a>.","apa":"Böttcher, S., &#38; Steinmetz, R. (2006). Information Disclosure by XPath Queries. In <i>Secure Data Management, Third VLDB Workshop, SDM 2006</i> (pp. 160–174). Springer. <a href=\"https://doi.org/10.1007/11844662_12\">https://doi.org/10.1007/11844662_12</a>","ieee":"S. Böttcher and R. Steinmetz, “Information Disclosure by XPath Queries,” in <i>Secure Data Management, Third VLDB Workshop, SDM 2006</i>, 2006, pp. 160–174.","ama":"Böttcher S, Steinmetz R. Information Disclosure by XPath Queries. In: <i>Secure Data Management, Third VLDB Workshop, SDM 2006</i>. Springer; 2006:160-174. doi:<a href=\"https://doi.org/10.1007/11844662_12\">10.1007/11844662_12</a>","bibtex":"@inproceedings{Böttcher_Steinmetz_2006, title={Information Disclosure by XPath Queries}, DOI={<a href=\"https://doi.org/10.1007/11844662_12\">10.1007/11844662_12</a>}, booktitle={Secure Data Management, Third VLDB Workshop, SDM 2006}, publisher={Springer}, author={Böttcher, Stefan and Steinmetz, Rita}, year={2006}, pages={160–174} }","mla":"Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.” <i>Secure Data Management, Third VLDB Workshop, SDM 2006</i>, Springer, 2006, pp. 160–74, doi:<a href=\"https://doi.org/10.1007/11844662_12\">10.1007/11844662_12</a>."},"publication":"Secure Data Management, Third VLDB Workshop, SDM 2006","user_id":"14961","doi":"10.1007/11844662_12","publisher":"Springer","_id":"15152","language":[{"iso":"eng"}],"page":"160-174","publication_status":"published","date_updated":"2022-01-06T06:52:16Z","author":[{"id":"624","last_name":"Böttcher","first_name":"Stefan","full_name":"Böttcher, Stefan"},{"id":"14961","last_name":"Steinmetz","first_name":"Rita","full_name":"Steinmetz, Rita"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540389842","9783540389873"]},"status":"public","year":"2006","title":"Information Disclosure by XPath Queries"},{"extern":"1","publication":"Information Security and Cryptology – ICISC 2006","citation":{"mla":"Geiselmann, Willi, et al. “A Simpler Sieving Device: Combining ECM and TWIRL.” <i>Information Security and Cryptology – ICISC 2006</i>, Springer Berlin Heidelberg, 2006, doi:<a href=\"https://doi.org/10.1007/11927587_12\">10.1007/11927587_12</a>.","bibtex":"@inbook{Geiselmann_Januszewski_Köpfer_Pelzl_Steinwandt_2006, place={Berlin, Heidelberg}, title={A Simpler Sieving Device: Combining ECM and TWIRL}, DOI={<a href=\"https://doi.org/10.1007/11927587_12\">10.1007/11927587_12</a>}, booktitle={Information Security and Cryptology – ICISC 2006}, publisher={Springer Berlin Heidelberg}, author={Geiselmann, Willi and Januszewski, Fabian and Köpfer, Hubert and Pelzl, Jan and Steinwandt, Rainer}, year={2006} }","ama":"Geiselmann W, Januszewski F, Köpfer H, Pelzl J, Steinwandt R. A Simpler Sieving Device: Combining ECM and TWIRL. In: <i>Information Security and Cryptology – ICISC 2006</i>. Springer Berlin Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11927587_12\">10.1007/11927587_12</a>","ieee":"W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, and R. Steinwandt, “A Simpler Sieving Device: Combining ECM and TWIRL,” in <i>Information Security and Cryptology – ICISC 2006</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.","apa":"Geiselmann, W., Januszewski, F., Köpfer, H., Pelzl, J., &#38; Steinwandt, R. (2006). A Simpler Sieving Device: Combining ECM and TWIRL. In <i>Information Security and Cryptology – ICISC 2006</i>. Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11927587_12\">https://doi.org/10.1007/11927587_12</a>","short":"W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, R. Steinwandt, in: Information Security and Cryptology – ICISC 2006, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006.","chicago":"Geiselmann, Willi, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, and Rainer Steinwandt. “A Simpler Sieving Device: Combining ECM and TWIRL.” In <i>Information Security and Cryptology – ICISC 2006</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11927587_12\">https://doi.org/10.1007/11927587_12</a>."},"type":"book_chapter","date_created":"2024-04-03T16:36:47Z","place":"Berlin, Heidelberg","publication_status":"published","date_updated":"2024-04-03T17:11:55Z","status":"public","year":"2006","title":"A Simpler Sieving Device: Combining ECM and TWIRL","author":[{"first_name":"Willi","last_name":"Geiselmann","full_name":"Geiselmann, Willi"},{"id":"81636","full_name":"Januszewski, Fabian","first_name":"Fabian","last_name":"Januszewski"},{"full_name":"Köpfer, Hubert","last_name":"Köpfer","first_name":"Hubert"},{"first_name":"Jan","last_name":"Pelzl","full_name":"Pelzl, Jan"},{"last_name":"Steinwandt","first_name":"Rainer","full_name":"Steinwandt, Rainer"}],"publication_identifier":{"isbn":["9783540491125","9783540491149"],"issn":["0302-9743","1611-3349"]},"user_id":"81636","doi":"10.1007/11927587_12","language":[{"iso":"eng"}],"_id":"53181","publisher":"Springer Berlin Heidelberg"},{"user_id":"93826","doi":"10.1007/11792086_4","_id":"35958","publisher":"Springer Berlin Heidelberg","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-03-06T09:13:15Z","year":"2006","status":"public","title":"Cohen–Lenstra Heuristics of Quadratic Number Fields","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540360759","9783540360766"]},"author":[{"full_name":"Fouvry, Étienne","last_name":"Fouvry","first_name":"Étienne"},{"last_name":"Klüners","first_name":"Jürgen","full_name":"Klüners, Jürgen","id":"21202"}],"type":"book_chapter","department":[{"_id":"102"}],"date_created":"2023-01-11T09:46:47Z","place":"Berlin, Heidelberg","related_material":{"link":[{"relation":"confirmation","url":"https://www.researchgate.net/profile/Juergen-Klueners/publication/221451567_Cohen-Lenstra_Heuristics_of_Quadratic_Number_Fields/links/0a85e53298eaed8777000000/Cohen-Lenstra-Heuristics-of-Quadratic-Number-Fields.pdf?origin=publication_detail"}]},"abstract":[{"lang":"eng","text":"We establish a link between some heuristic asymptotic formulas (due to Cohen and Lenstra) concerning the moments of the p–part of the class groups of quadratic fields and formulas giving the frequency of the values of the p–rank of these class groups."}],"publication":"Lecture Notes in Computer Science","citation":{"apa":"Fouvry, É., &#38; Klüners, J. (2006). Cohen–Lenstra Heuristics of Quadratic Number Fields. In <i>Lecture Notes in Computer Science</i>. Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11792086_4\">https://doi.org/10.1007/11792086_4</a>","ieee":"É. Fouvry and J. Klüners, “Cohen–Lenstra Heuristics of Quadratic Number Fields,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.","chicago":"Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. <a href=\"https://doi.org/10.1007/11792086_4\">https://doi.org/10.1007/11792086_4</a>.","short":"É. Fouvry, J. Klüners, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006.","mla":"Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2006, doi:<a href=\"https://doi.org/10.1007/11792086_4\">10.1007/11792086_4</a>.","ama":"Fouvry É, Klüners J. Cohen–Lenstra Heuristics of Quadratic Number Fields. In: <i>Lecture Notes in Computer Science</i>. Springer Berlin Heidelberg; 2006. doi:<a href=\"https://doi.org/10.1007/11792086_4\">10.1007/11792086_4</a>","bibtex":"@inbook{Fouvry_Klüners_2006, place={Berlin, Heidelberg}, title={Cohen–Lenstra Heuristics of Quadratic Number Fields}, DOI={<a href=\"https://doi.org/10.1007/11792086_4\">10.1007/11792086_4</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Fouvry, Étienne and Klüners, Jürgen}, year={2006} }"}},{"citation":{"mla":"Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>, vol. 3738, 2005, pp. 244–57, doi:<a href=\"https://doi.org/10.1007/11561354_21\">10.1007/11561354_21</a>.","ama":"Rührup S, Schindelhauer C, Volbert K. Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In: <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>. Vol 3738. ; 2005:244-257. doi:<a href=\"https://doi.org/10.1007/11561354_21\">10.1007/11561354_21</a>","bibtex":"@inproceedings{Rührup_Schindelhauer_Volbert_2005, title={Performance Analysis of the Hierarchical Layer Graph for Wireless Networks}, volume={3738}, DOI={<a href=\"https://doi.org/10.1007/11561354_21\">10.1007/11561354_21</a>}, booktitle={Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)}, author={Rührup, Stefan and Schindelhauer, Christian and Volbert, Klaus}, year={2005}, pages={244–257} }","apa":"Rührup, S., Schindelhauer, C., &#38; Volbert, K. (2005). Performance Analysis of the Hierarchical Layer Graph for Wireless Networks. In <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i> (Vol. 3738, pp. 244–257). <a href=\"https://doi.org/10.1007/11561354_21\">https://doi.org/10.1007/11561354_21</a>","ieee":"S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>, 2005, vol. 3738, pp. 244–257.","chicago":"Rührup, Stefan, Christian Schindelhauer, and Klaus Volbert. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.” In <i>Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005)</i>, 3738:244–57, 2005. <a href=\"https://doi.org/10.1007/11561354_21\">https://doi.org/10.1007/11561354_21</a>.","short":"S. Rührup, C. Schindelhauer, K. Volbert, in: Proc. of 4th International Conference on Ad-Hoc, Mobile &#38; Wireless Networks (ADHOC-NOW 2005), 2005, pp. 244–257."},"user_id":"15415","volume":3738,"page":"244-257","_id":"19835","status":"public","type":"conference","department":[{"_id":"63"}],"date_created":"2020-10-01T11:31:14Z","abstract":[{"text":"The Hierarchical Layer Graph (HL graph) is a promising network topology for wireless networks with<br>variable transmission ranges. It was introduced and analyzed by Meyer auf der Heide et al. 2004.<br>In this paper we present a distributed, localized and resource-efficient algorithm for constructing this graph. The qualtiy of the HL graph depends on the domination radius and the publication radius, which affect the amount of interference in the network. These parameters also determine whether the HL graph is a c-spanner, which implies an energy-efficient topology. We investigate the performance on randomly distributed node sets and show that the restrictions on these parameters derived from a worst case analysis are not so tight using realistic settings.<br><br>Here, we present the results of our extensive experimental evaluation, measuring congestion, dilation and energy. Congestion includes the load that is induced by interfering edges. We distinguish between congestion and realistic congestion where we also take the signal-to-interference ratio into account. <br>Our experiments show that the HL graph contains energy-efficient paths as well as paths with a few number of hops while preserving a low congestion.","lang":"eng"}],"publication":"Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)","doi":"10.1007/11561354_21","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:54:13Z","intvolume":"      3738","title":"Performance Analysis of the Hierarchical Layer Graph for Wireless Networks","year":"2005","author":[{"first_name":"Stefan","last_name":"Rührup","full_name":"Rührup, Stefan"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"last_name":"Volbert","first_name":"Klaus","full_name":"Volbert, Klaus"}],"publication_identifier":{"isbn":["9783540291329","9783540320869"],"issn":["0302-9743","1611-3349"]}},{"date_updated":"2022-01-06T06:54:13Z","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540291329","9783540320869"]},"author":[{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"full_name":"Voß, Kerstin","last_name":"Voß","first_name":"Kerstin"}],"year":"2005","title":"Probability Distributions for Channel Utilisation","status":"public","doi":"10.1007/11561354_23","user_id":"15415","series_title":"3738","_id":"19836","language":[{"iso":"eng"}],"page":"271-284","citation":{"ama":"Schindelhauer C, Voß K. Probability Distributions for Channel Utilisation. In: <i>Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005)</i>. 3738. ; 2005:271-284. doi:<a href=\"https://doi.org/10.1007/11561354_23\">10.1007/11561354_23</a>","bibtex":"@inbook{Schindelhauer_Voß_2005, series={3738}, title={Probability Distributions for Channel Utilisation}, DOI={<a href=\"https://doi.org/10.1007/11561354_23\">10.1007/11561354_23</a>}, booktitle={Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005)}, author={Schindelhauer, Christian and Voß, Kerstin}, year={2005}, pages={271–284}, collection={3738} }","mla":"Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” <i>Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005)</i>, 2005, pp. 271–84, doi:<a href=\"https://doi.org/10.1007/11561354_23\">10.1007/11561354_23</a>.","chicago":"Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.” In <i>Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005)</i>, 271–84. 3738, 2005. <a href=\"https://doi.org/10.1007/11561354_23\">https://doi.org/10.1007/11561354_23</a>.","short":"C. Schindelhauer, K. Voß, in: Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.","apa":"Schindelhauer, C., &#38; Voß, K. (2005). Probability Distributions for Channel Utilisation. In <i>Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005)</i> (pp. 271–284). <a href=\"https://doi.org/10.1007/11561354_23\">https://doi.org/10.1007/11561354_23</a>","ieee":"C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in <i>Proc. of 4th International Conference on Ad-Hoc Networks &#38; Wireless (ADHOC-NOW 2005)</i>, 2005, pp. 271–284."},"publication":"Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-10-01T11:36:30Z"},{"date_created":"2020-10-06T10:36:14Z","place":"Berlin, Heidelberg","type":"conference","department":[{"_id":"63"},{"_id":"58"}],"publication":"Proceedings of the 4th International Conference on Networking","citation":{"apa":"Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., &#38; Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In <i>Proceedings of the 4th International Conference on Networking</i> (Vol. 3421, pp. 800–810). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-31957-3_90\">https://doi.org/10.1007/978-3-540-31957-3_90</a>","ieee":"C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts,” in <i>Proceedings of the 4th International Conference on Networking</i>, 2005, vol. 3421, pp. 800–810.","short":"C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, M. Heidebuer, in: Proceedings of the 4th International Conference on Networking, Berlin, Heidelberg, 2005, pp. 800–810.","chicago":"Loeser, Chris, Gunnar Schomaker, André Brinkmann, Mario Vodisek, and Michael Heidebuer. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” In <i>Proceedings of the 4th International Conference on Networking</i>, 3421:800–810. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31957-3_90\">https://doi.org/10.1007/978-3-540-31957-3_90</a>.","mla":"Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts.” <i>Proceedings of the 4th International Conference on Networking</i>, vol. 3421, 2005, pp. 800–10, doi:<a href=\"https://doi.org/10.1007/978-3-540-31957-3_90\">10.1007/978-3-540-31957-3_90</a>.","ama":"Loeser C, Schomaker G, Brinkmann A, Vodisek M, Heidebuer M. Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts. In: <i>Proceedings of the 4th International Conference on Networking</i>. Vol 3421. Berlin, Heidelberg; 2005:800-810. doi:<a href=\"https://doi.org/10.1007/978-3-540-31957-3_90\">10.1007/978-3-540-31957-3_90</a>","bibtex":"@inproceedings{Loeser_Schomaker_Brinkmann_Vodisek_Heidebuer_2005, place={Berlin, Heidelberg}, title={Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts}, volume={3421}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31957-3_90\">10.1007/978-3-540-31957-3_90</a>}, booktitle={Proceedings of the 4th International Conference on Networking}, author={Loeser, Chris and Schomaker, Gunnar and Brinkmann, André and Vodisek, Mario and Heidebuer, Michael}, year={2005}, pages={800–810} }"},"page":"800-810","language":[{"iso":"eng"}],"_id":"19912","user_id":"15415","doi":"10.1007/978-3-540-31957-3_90","volume":3421,"year":"2005","status":"public","title":"Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540253389","9783540319573"]},"author":[{"full_name":"Loeser, Chris","last_name":"Loeser","first_name":"Chris"},{"first_name":"Gunnar","last_name":"Schomaker","full_name":"Schomaker, Gunnar"},{"first_name":"André","last_name":"Brinkmann","full_name":"Brinkmann, André"},{"full_name":"Vodisek, Mario","first_name":"Mario","last_name":"Vodisek"},{"full_name":"Heidebuer, Michael","last_name":"Heidebuer","first_name":"Michael"}],"publication_status":"published","date_updated":"2022-01-06T06:54:14Z","intvolume":"      3421"}]