[{"citation":{"ama":"Lürwer-Brüggemeier K, Ziegler M. On Faster Integer Calculations Using Non-arithmetic Primitives. In: <i>Unconventional Computing</i>. Berlin, Heidelberg; 2008. doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>","chicago":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” In <i>Unconventional Computing</i>. Berlin, Heidelberg, 2008. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>.","ieee":"K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in <i>Unconventional Computing</i>, Berlin, Heidelberg, 2008.","apa":"Lürwer-Brüggemeier, K., &#38; Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In <i>Unconventional Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">https://doi.org/10.1007/978-3-540-85194-3_11</a>","short":"K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.","mla":"Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.” <i>Unconventional Computing</i>, 2008, doi:<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>.","bibtex":"@inbook{Lürwer-Brüggemeier_Ziegler_2008, place={Berlin, Heidelberg}, title={On Faster Integer Calculations Using Non-arithmetic Primitives}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-85194-3_11\">10.1007/978-3-540-85194-3_11</a>}, booktitle={Unconventional Computing}, author={Lürwer-Brüggemeier, Katharina and Ziegler, Martin}, year={2008} }"},"year":"2008","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540851936","9783540851943"]},"doi":"10.1007/978-3-540-85194-3_11","title":"On Faster Integer Calculations Using Non-arithmetic Primitives","author":[{"first_name":"Katharina","full_name":"Lürwer-Brüggemeier, Katharina","last_name":"Lürwer-Brüggemeier"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_created":"2020-08-14T13:19:24Z","date_updated":"2022-01-06T06:53:24Z","status":"public","type":"book_chapter","publication":"Unconventional Computing","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"17978"},{"language":[{"iso":"eng"}],"_id":"24276","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"text":"We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.\r\nBasing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.\r\n","lang":"eng"}],"status":"public","publication":"Lecture Notes in Computer Science","type":"conference","title":"The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces","doi":"10.1007/978-3-540-73951-7_30","date_updated":"2022-01-06T06:56:13Z","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław","first_name":"Jarosław"}],"date_created":"2021-09-13T13:07:57Z","place":"Berlin, Heidelberg","year":"2007","citation":{"ama":"Bienkowski M, Kutyłowski J. The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. In: <i>Lecture Notes in Computer Science</i>. ; 2007. doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>","ieee":"M. Bienkowski and J. Kutyłowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,” 2007, doi: <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","chicago":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” In <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg, 2007. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>.","bibtex":"@inproceedings{Bienkowski_Kutyłowski_2007, place={Berlin, Heidelberg}, title={The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>}, booktitle={Lecture Notes in Computer Science}, author={Bienkowski, Marcin and Kutyłowski, Jarosław}, year={2007} }","short":"M. Bienkowski, J. Kutyłowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.","mla":"Bienkowski, Marcin, and Jarosław Kutyłowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.” <i>Lecture Notes in Computer Science</i>, 2007, doi:<a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">10.1007/978-3-540-73951-7_30</a>.","apa":"Bienkowski, M., &#38; Kutyłowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. <i>Lecture Notes in Computer Science</i>. <a href=\"https://doi.org/10.1007/978-3-540-73951-7_30\">https://doi.org/10.1007/978-3-540-73951-7_30</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published"},{"doi":"10.1007/3-540-45708-9_16","title":"Cryptanalysis of Unbalanced RSA with Small CRT-Exponent","author":[{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"}],"date_created":"2018-06-05T08:26:03Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","page":"242-256","citation":{"apa":"May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In <i>Advances in Cryptology — CRYPTO 2002</i> (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45708-9_16\">https://doi.org/10.1007/3-540-45708-9_16</a>","short":"A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.","mla":"May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” <i>Advances in Cryptology — CRYPTO 2002</i>, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:<a href=\"https://doi.org/10.1007/3-540-45708-9_16\">10.1007/3-540-45708-9_16</a>.","bibtex":"@inbook{May_2007, place={Berlin, Heidelberg}, title={Cryptanalysis of Unbalanced RSA with Small CRT-Exponent}, DOI={<a href=\"https://doi.org/10.1007/3-540-45708-9_16\">10.1007/3-540-45708-9_16</a>}, booktitle={Advances in Cryptology — CRYPTO 2002}, publisher={Springer Berlin Heidelberg}, author={May, Alexander}, year={2007}, pages={242–256} }","ama":"May A. Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In: <i>Advances in Cryptology — CRYPTO 2002</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:242-256. doi:<a href=\"https://doi.org/10.1007/3-540-45708-9_16\">10.1007/3-540-45708-9_16</a>","ieee":"A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in <i>Advances in Cryptology — CRYPTO 2002</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.","chicago":"May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.” In <i>Advances in Cryptology — CRYPTO 2002</i>, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-45708-9_16\">https://doi.org/10.1007/3-540-45708-9_16</a>."},"place":"Berlin, Heidelberg","year":"2007","publication_identifier":{"isbn":["9783540440505","9783540457084"],"issn":["0302-9743"]},"publication_status":"published","department":[{"_id":"64"}],"user_id":"25078","_id":"3019","status":"public","publication":"Advances in Cryptology — CRYPTO 2002","type":"book_chapter"},{"doi":"10.1007/3-540-44670-2_2","title":"Low Secret Exponent RSA Revisited","author":[{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"},{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"}],"date_created":"2018-06-05T08:26:29Z","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","page":"4-19","citation":{"ieee":"J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in <i>Lecture Notes in Computer Science</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.","chicago":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” In <i>Lecture Notes in Computer Science</i>, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007. <a href=\"https://doi.org/10.1007/3-540-44670-2_2\">https://doi.org/10.1007/3-540-44670-2_2</a>.","ama":"Blömer J, May A. Low Secret Exponent RSA Revisited. In: <i>Lecture Notes in Computer Science</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:4-19. doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>","apa":"Blömer, J., &#38; May, A. (2007). Low Secret Exponent RSA Revisited. In <i>Lecture Notes in Computer Science</i> (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-44670-2_2\">https://doi.org/10.1007/3-540-44670-2_2</a>","short":"J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.","mla":"Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.” <i>Lecture Notes in Computer Science</i>, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>.","bibtex":"@inbook{Blömer_May_2007, place={Berlin, Heidelberg}, title={Low Secret Exponent RSA Revisited}, DOI={<a href=\"https://doi.org/10.1007/3-540-44670-2_2\">10.1007/3-540-44670-2_2</a>}, booktitle={Lecture Notes in Computer Science}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2007}, pages={4–19} }"},"year":"2007","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540424888","9783540446705"],"issn":["0302-9743"]},"publication_status":"published","department":[{"_id":"64"}],"user_id":"25078","_id":"3020","status":"public","publication":"Lecture Notes in Computer Science","type":"book_chapter"},{"title":"Key Revocation with Interval Cover Families","doi":"10.1007/3-540-45537-x_26","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"date_created":"2018-06-05T08:26:50Z","place":"Berlin, Heidelberg","year":"2007","page":"325-341","citation":{"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>.","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} }","short":"J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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>.","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>"},"publication_identifier":{"issn":["0302-9743"],"isbn":["9783540430667","9783540455370"]},"publication_status":"published","_id":"3021","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Selected Areas in Cryptography","type":"book_chapter"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424888","9783540446705"]},"citation":{"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>","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.","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>.","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>","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>."},"page":"110-125","year":"2007","place":"Berlin, Heidelberg","author":[{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"},{"last_name":"Silverman","full_name":"Silverman, Joseph H.","first_name":"Joseph H."}],"date_created":"2018-06-05T08:27:10Z","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/3-540-44670-2_10","title":"Dimension Reduction Methods for Convolution Modular Lattices","type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"3022"},{"publication":"Algorithms — ESA’ 98","type":"book_chapter","status":"public","_id":"3026","department":[{"_id":"64"}],"user_id":"25078","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2007","page":"151-162","citation":{"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>","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>.","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} }","short":"J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 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>"},"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","author":[{"full_name":"Blömer, Johannes","id":"23","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2018-06-05T08:28:39Z","title":"A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers","doi":"10.1007/3-540-68530-8_13"},{"publication_identifier":{"isbn":["9783540695066","9783540695073"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","year":"2007","page":"260--271","intvolume":"      4362","citation":{"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>","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>.","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.","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>","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>.","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} }"},"date_updated":"2022-01-06T06:53:54Z","volume":4362,"author":[{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"first_name":"Jarosław","full_name":"Kutyłowski, Jarosław","last_name":"Kutyłowski"}],"date_created":"2020-09-03T10:29:52Z","title":"Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs","doi":"10.1007/978-3-540-69507-3_21","publication":"Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)","type":"conference","status":"public","_id":"18929","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","user_id":"15415","department":[{"_id":"63"}],"_id":"17982","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540730002","9783540730019"]},"citation":{"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} }","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>.","short":"M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 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>","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>","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>."},"year":"2007","place":"Berlin, Heidelberg","date_created":"2020-08-14T13:33:50Z","author":[{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_updated":"2022-01-06T06:53:24Z","doi":"10.1007/978-3-540-73001-9_86","title":"(Short) Survey of Real Hypercomputation"},{"date_updated":"2022-01-06T06:53:24Z","author":[{"full_name":"Meer, Klaus","last_name":"Meer","first_name":"Klaus"},{"first_name":"Martin","full_name":"Ziegler, Martin","last_name":"Ziegler"}],"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_status":"published","publication_identifier":{"isbn":["9783540744559","9783540744566"],"issn":["0302-9743","1611-3349"]},"place":"Berlin, Heidelberg","year":"2007","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>."},"_id":"17983","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Mathematical Foundations of Computer Science 2007","status":"public"},{"department":[{"_id":"101"}],"user_id":"15701","_id":"16640","status":"public","publication":"Mathematical Foundations of Computer Science 2001","type":"book_chapter","doi":"10.1007/3-540-44683-4_46","title":"Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs","author":[{"first_name":"Burkhard","full_name":"Monien, Burkhard","last_name":"Monien"},{"last_name":"Preis","full_name":"Preis, Robert","first_name":"Robert"}],"date_created":"2020-04-16T08:58:07Z","date_updated":"2022-01-06T06:52:53Z","citation":{"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} }","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>.","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>","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>","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.","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>."},"year":"2007","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540424963","9783540446835"]},"publication_status":"published"},{"status":"public","publication":"Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24","type":"conference","language":[{"iso":"eng"}],"_id":"15144","department":[{"_id":"69"}],"user_id":"14961","year":"2007","page":"101-113","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.","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>.","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>","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>.","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.","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} }","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>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540733898","9783540733904"]},"publication_status":"published","title":"Evaluating XPath Queries on XML Data Streams","doi":"10.1007/978-3-540-73390-4_10","publisher":"Springer","date_updated":"2022-01-06T06:52:16Z","date_created":"2019-11-22T08:59:56Z","author":[{"first_name":"Stefan","full_name":"Böttcher, Stefan","id":"624","last_name":"Böttcher"},{"first_name":"Rita","last_name":"Steinmetz","id":"14961","full_name":"Steinmetz, Rita"}]},{"status":"public","publication":"Database and Expert Systems Applications, 18th International Conference, DEXA 2007","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"69"}],"user_id":"14961","_id":"15146","page":"424-433","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>","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.","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>","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>.","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} }","short":"S. Böttcher, R. Steinmetz, in: Database and Expert Systems Applications, 18th International Conference, DEXA 2007, Springer, 2007, pp. 424–433."},"year":"2007","publication_identifier":{"isbn":["9783540744672","9783540744696"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/978-3-540-74469-6_42","title":"Data Management for Mobile Ajax Web 2.0 Applications","date_created":"2019-11-22T09:06:45Z","author":[{"first_name":"Stefan","last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan"},{"full_name":"Steinmetz, Rita","id":"14961","last_name":"Steinmetz","first_name":"Rita"}],"publisher":"Springer","date_updated":"2022-01-06T06:52:16Z"},{"status":"public","publication":"Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)","type":"conference","language":[{"iso":"eng"}],"_id":"19838","department":[{"_id":"63"}],"user_id":"15415","year":"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>.","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} }","short":"S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 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>","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>","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.","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>."},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540496946","9783540496960"]},"publication_status":"published","title":"Online Multi-path Routing in a Maze","doi":"10.1007/11940128_65","date_updated":"2022-01-06T06:54:13Z","author":[{"full_name":"Rührup, Stefan","last_name":"Rührup","first_name":"Stefan"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_created":"2020-10-01T11:51:15Z"},{"date_created":"2021-09-13T13:28:29Z","author":[{"first_name":"Jarosław","last_name":"Kutyłowski","full_name":"Kutyłowski, Jarosław"},{"last_name":"Zagórski","full_name":"Zagórski, Filip","first_name":"Filip"}],"date_updated":"2022-01-06T06:56:13Z","doi":"10.1007/11611257_37","title":"Reliable Broadcasting Without Collision Detection","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"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>","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>.","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>.","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} }","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>.","short":"J. Kutyłowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.","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>"},"place":"Berlin, Heidelberg","year":"2006","department":[{"_id":"63"}],"user_id":"15415","_id":"24277","language":[{"iso":"eng"}],"publication":"SOFSEM 2006: Theory and Practice of Computer Science","type":"conference","status":"public","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"}]},{"publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"3004","publication_identifier":{"isbn":["9783540462507","9783540462514"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"106-120","citation":{"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.","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>","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>.","short":"J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.","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>"},"year":"2006","place":"Berlin, Heidelberg","date_created":"2018-06-05T08:14:42Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Volker","full_name":"Krummel, Volker","last_name":"Krummel"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:50Z","doi":"10.1007/11889700_11","title":"Fault Based Collision Attacks on AES"},{"date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:15:48Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"}],"title":"Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered","doi":"10.1007/11889700_2","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"year":"2006","place":"Berlin, Heidelberg","citation":{"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>","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} }","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>.","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.","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>"},"page":"13-23","_id":"3005","user_id":"25078","department":[{"_id":"64"}],"type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public"},{"doi":"10.1007/11889700_4","title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","date_created":"2018-06-05T08:17:12Z","author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Martin","full_name":"Otto, Martin","last_name":"Otto"},{"full_name":"Seifert, Jean-Pierre","last_name":"Seifert","first_name":"Jean-Pierre"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:50Z","page":"36-52","citation":{"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.","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>.","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>","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>","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.","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} }","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>."},"place":"Berlin, Heidelberg","year":"2006","has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"publication_status":"published","file_date_updated":"2018-06-05T08:18:56Z","ddc":["000"],"department":[{"_id":"64"}],"user_id":"25078","_id":"3007","status":"public","file":[{"file_name":"SignChangeFaultAttacksOnECC.pdf","access_level":"closed","file_id":"3009","file_size":259146,"creator":"feidens","date_created":"2018-06-05T08:18:56Z","date_updated":"2018-06-05T08:18:56Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publication":"Lecture Notes in Computer Science","type":"book_chapter"},{"doi":"10.1007/11682127_24","title":"Power-Aware Collective Tree Exploration","date_created":"2020-09-03T10:13:56Z","author":[{"first_name":"Miroslaw","full_name":"Dynia, Miroslaw","last_name":"Dynia"},{"last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw","first_name":"Miroslaw"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_updated":"2022-01-06T06:53:54Z","citation":{"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} }","short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, 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>","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>.","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.","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>"},"page":"341--351","year":"2006","issue":"3894","publication_status":"published","publication_identifier":{"isbn":["9783540327653","9783540327660"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18926","status":"public","type":"conference","publication":"Architecture of Computing Systems - ARCS"},{"publication_identifier":{"isbn":["9783540354666","9783540354680"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","citation":{"ieee":"K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in <i>Logical Approaches to Computational Barriers</i>, Berlin, Heidelberg, 2006.","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>.","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>","short":"K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.","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>.","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} }","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>"},"place":"Berlin, Heidelberg","year":"2006","author":[{"first_name":"Klaus","last_name":"Meer","full_name":"Meer, Klaus"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"date_created":"2020-08-14T13:43:09Z","date_updated":"2022-01-06T06:53:24Z","doi":"10.1007/11780342_39","title":"Uncomputability Below the Real Halting Problem","publication":"Logical Approaches to Computational Barriers","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"17987","language":[{"iso":"eng"}]}]