[{"has_accepted_license":"1","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540462507","9783540462514"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2006","page":"36-52","citation":{"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>","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>.","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.","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>."},"date_updated":"2022-01-06T06:58:50Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:17:12Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"last_name":"Otto","full_name":"Otto, Martin","first_name":"Martin"},{"first_name":"Jean-Pierre","last_name":"Seifert","full_name":"Seifert, Jean-Pierre"}],"title":"Sign Change Fault Attacks on Elliptic Curve Cryptosystems","doi":"10.1007/11889700_4","publication":"Lecture Notes in Computer Science","type":"book_chapter","status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-06-05T08:18:56Z","date_created":"2018-06-05T08:18:56Z","creator":"feidens","file_size":259146,"access_level":"closed","file_id":"3009","file_name":"SignChangeFaultAttacksOnECC.pdf"}],"_id":"3007","department":[{"_id":"64"}],"user_id":"25078","ddc":["000"],"file_date_updated":"2018-06-05T08:18:56Z"},{"publication_identifier":{"isbn":["9783540327653","9783540327660"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","issue":"3894","year":"2006","page":"341--351","citation":{"short":"M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.","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} }","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>","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>","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."},"date_updated":"2022-01-06T06:53:54Z","date_created":"2020-09-03T10:13:56Z","author":[{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"full_name":"Korzeniowski, Miroslaw","last_name":"Korzeniowski","first_name":"Miroslaw"},{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"}],"title":"Power-Aware Collective Tree Exploration","doi":"10.1007/11682127_24","publication":"Architecture of Computing Systems - ARCS","type":"conference","status":"public","_id":"18926","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"_id":"17987","user_id":"15415","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Logical Approaches to Computational Barriers","status":"public","date_updated":"2022-01-06T06:53:24Z","author":[{"last_name":"Meer","full_name":"Meer, Klaus","first_name":"Klaus"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"date_created":"2020-08-14T13:43:09Z","title":"Uncomputability Below the Real Halting Problem","doi":"10.1007/11780342_39","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540354666","9783540354680"]},"year":"2006","place":"Berlin, Heidelberg","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>","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>.","short":"K. Meer, M. Ziegler, in: Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.","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>"}},{"doi":"10.1007/11682462_34","title":"De Dictionariis Dynamicis Pauco Spatio Utentibus ({lat.} On Dynamic Dictionaries Using Little Space)","date_created":"2020-04-08T09:36:10Z","author":[{"first_name":"Erik D.","full_name":"Demaine, Erik D.","last_name":"Demaine"},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"last_name":"Pagh","full_name":"Pagh, Rasmus","first_name":"Rasmus"},{"first_name":"Mihai","last_name":"Pǎtraşcu","full_name":"Pǎtraşcu, Mihai"}],"date_updated":"2022-01-06T06:52:50Z","citation":{"short":"E.D. Demaine, F. Meyer auf der Heide, R. Pagh, M. Pǎtraşcu, in: LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.","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>.","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>","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>","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.","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>."},"place":"Berlin, Heidelberg","year":"2006","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540327554","9783540327561"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16472","status":"public","type":"book_chapter","publication":"LATIN 2006: Theoretical Informatics"},{"language":[{"iso":"eng"}],"_id":"16473","user_id":"15415","department":[{"_id":"63"}],"status":"public","type":"book_chapter","publication":"Lecture Notes in Computer Science","title":"Smart Robot Teams Exploring Sparse Trees","doi":"10.1007/11821069_29","date_updated":"2022-01-06T06:52:50Z","author":[{"full_name":"Dynia, M.","last_name":"Dynia","first_name":"M."},{"last_name":"Kutyłowski","full_name":"Kutyłowski, J.","first_name":"J."},{"last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","first_name":"Friedhelm"},{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"}],"date_created":"2020-04-08T09:38:28Z","year":"2006","place":"Berlin, Heidelberg","citation":{"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.","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>.","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>","short":"M. Dynia, J. Kutyłowski, F. Meyer auf der Heide, C. Schindelhauer, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.","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} }","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>.","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>"},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540377917","9783540377931"]}},{"author":[{"first_name":"Stefan","last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan"},{"last_name":"Steinmetz","id":"14961","full_name":"Steinmetz, Rita","first_name":"Rita"}],"date_created":"2019-11-22T09:21:07Z","date_updated":"2022-01-06T06:52:16Z","doi":"10.1007/11788911_27","title":"DTD-Driven Structure Preserving XML Compression","publication_identifier":{"isbn":["9783540359692","9783540359715"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"266-269","citation":{"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>","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>.","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>.","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} }","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.","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>"},"year":"2006","place":"Berlin, Heidelberg","department":[{"_id":"69"}],"user_id":"14961","_id":"15150","language":[{"iso":"eng"}],"publication":"Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23","type":"conference","status":"public"},{"type":"conference","publication":"Secure Data Management, Third VLDB Workshop, SDM 2006","status":"public","_id":"15152","user_id":"14961","department":[{"_id":"69"}],"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9783540389842","9783540389873"],"issn":["0302-9743","1611-3349"]},"year":"2006","citation":{"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>","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>.","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.","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>","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>.","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} }","short":"S. Böttcher, R. Steinmetz, in: Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–174."},"page":"160-174","publisher":"Springer","date_updated":"2022-01-06T06:52:16Z","date_created":"2019-11-22T09:22:46Z","author":[{"first_name":"Stefan","last_name":"Böttcher","id":"624","full_name":"Böttcher, Stefan"},{"last_name":"Steinmetz","id":"14961","full_name":"Steinmetz, Rita","first_name":"Rita"}],"title":"Information Disclosure by XPath Queries","doi":"10.1007/11844662_12"},{"author":[{"full_name":"Geiselmann, Willi","last_name":"Geiselmann","first_name":"Willi"},{"full_name":"Januszewski, Fabian","id":"81636","last_name":"Januszewski","first_name":"Fabian"},{"first_name":"Hubert","last_name":"Köpfer","full_name":"Köpfer, Hubert"},{"first_name":"Jan","last_name":"Pelzl","full_name":"Pelzl, Jan"},{"full_name":"Steinwandt, Rainer","last_name":"Steinwandt","first_name":"Rainer"}],"date_created":"2024-04-03T16:36:47Z","publisher":"Springer Berlin Heidelberg","date_updated":"2024-04-03T17:11:55Z","doi":"10.1007/11927587_12","title":"A Simpler Sieving Device: Combining ECM and TWIRL","publication_status":"published","publication_identifier":{"isbn":["9783540491125","9783540491149"],"issn":["0302-9743","1611-3349"]},"citation":{"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.","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>.","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>","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>","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} }","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>.","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."},"year":"2006","place":"Berlin, Heidelberg","user_id":"81636","_id":"53181","extern":"1","language":[{"iso":"eng"}],"type":"book_chapter","publication":"Information Security and Cryptology – ICISC 2006","status":"public"},{"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"}]},"publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540360759","9783540360766"]},"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>","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>.","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} }","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>.","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>"},"year":"2006","place":"Berlin, Heidelberg","date_created":"2023-01-11T09:46:47Z","author":[{"last_name":"Fouvry","full_name":"Fouvry, Étienne","first_name":"Étienne"},{"first_name":"Jürgen","id":"21202","full_name":"Klüners, Jürgen","last_name":"Klüners"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2023-03-06T09:13:15Z","doi":"10.1007/11792086_4","title":"Cohen–Lenstra Heuristics of Quadratic Number Fields","type":"book_chapter","publication":"Lecture Notes in Computer Science","status":"public","abstract":[{"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.","lang":"eng"}],"user_id":"93826","department":[{"_id":"102"}],"_id":"35958","language":[{"iso":"eng"}]},{"citation":{"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} }","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.","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>.","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>","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>","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>."},"page":"244-257","intvolume":"      3738","year":"2005","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540291329","9783540320869"]},"doi":"10.1007/11561354_21","title":"Performance Analysis of the Hierarchical Layer Graph for Wireless Networks","date_created":"2020-10-01T11:31:14Z","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","full_name":"Volbert, Klaus","first_name":"Klaus"}],"volume":3738,"date_updated":"2022-01-06T06:54:13Z","status":"public","abstract":[{"lang":"eng","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."}],"type":"conference","publication":"Proc. of 4th International Conference on Ad-Hoc, Mobile & Wireless Networks (ADHOC-NOW 2005)","language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"19835"},{"publication":"Proc. of 4th International Conference on Ad-Hoc Networks & Wireless (ADHOC-NOW 2005)","type":"book_chapter","status":"public","department":[{"_id":"63"}],"user_id":"15415","series_title":"3738","_id":"19836","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783540291329","9783540320869"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","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>","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.","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.","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>.","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>"},"year":"2005","date_created":"2020-10-01T11:36:30Z","author":[{"first_name":"Christian","last_name":"Schindelhauer","full_name":"Schindelhauer, Christian"},{"full_name":"Voß, Kerstin","last_name":"Voß","first_name":"Kerstin"}],"date_updated":"2022-01-06T06:54:13Z","doi":"10.1007/11561354_23","title":"Probability Distributions for Channel Utilisation"},{"intvolume":"      3421","page":"800-810","citation":{"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>.","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} }","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.","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>","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>","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.","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>."},"year":"2005","place":"Berlin, Heidelberg","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540253389","9783540319573"]},"publication_status":"published","doi":"10.1007/978-3-540-31957-3_90","title":"Content Distribution in Heterogenous Video-on-Demand P2P Networks with ARIMA Forecasts","volume":3421,"date_created":"2020-10-06T10:36:14Z","author":[{"full_name":"Loeser, Chris","last_name":"Loeser","first_name":"Chris"},{"first_name":"Gunnar","full_name":"Schomaker, Gunnar","last_name":"Schomaker"},{"full_name":"Brinkmann, André","last_name":"Brinkmann","first_name":"André"},{"last_name":"Vodisek","full_name":"Vodisek, Mario","first_name":"Mario"},{"first_name":"Michael","full_name":"Heidebuer, Michael","last_name":"Heidebuer"}],"date_updated":"2022-01-06T06:54:14Z","status":"public","publication":"Proceedings of the 4th International Conference on Networking","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"58"}],"user_id":"15415","_id":"19912"},{"file":[{"file_size":333655,"access_level":"closed","file_name":"toolkit.pdf","file_id":"3008","date_updated":"2018-06-05T08:18:20Z","date_created":"2018-06-05T08:18:20Z","creator":"feidens","success":1,"relation":"main_file","content_type":"application/pdf"}],"publication":"EUROCRYPT 2005","ddc":["000"],"year":"2005","title":"A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers","date_created":"2018-06-05T08:16:47Z","publisher":"Springer Berlin Heidelberg","status":"public","type":"book_chapter","file_date_updated":"2018-06-05T08:18:20Z","series_title":"Lecture Notes in Computer Science","user_id":"25078","department":[{"_id":"64"}],"_id":"3006","citation":{"ama":"Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: <i>EUROCRYPT 2005</i>. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>","ieee":"J. Blömer and A. May, “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 251–267.","chicago":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” In <i>EUROCRYPT 2005</i>, 251–67. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>.","mla":"Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>.","short":"J. Blömer, A. May, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 251–267.","bibtex":"@inbook{Blömer_May_2005, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers}, DOI={<a href=\"https://doi.org/10.1007/11426639_15\">10.1007/11426639_15</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2005}, pages={251–267}, collection={Lecture Notes in Computer Science} }","apa":"Blömer, J., &#38; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In <i>EUROCRYPT 2005</i> (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_15\">https://doi.org/10.1007/11426639_15</a>"},"page":"251-267","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540259107","9783540320555"]},"has_accepted_license":"1","doi":"10.1007/11426639_15","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Alexander","full_name":"May, Alexander","last_name":"May"}],"date_updated":"2022-01-06T06:58:50Z"},{"series_title":"LNCS","user_id":"25078","department":[{"_id":"64"}],"_id":"3010","status":"public","type":"book_chapter","publication":"EUROCRYPT 2005","doi":"10.1007/11426639_22","title":"Partial Key Exposure Attacks on RSA up to Full Size Exponents","date_created":"2018-06-05T08:19:48Z","author":[{"last_name":"Ernst","full_name":"Ernst, Matthias","first_name":"Matthias"},{"first_name":"Ellen","last_name":"Jochemsz","full_name":"Jochemsz, Ellen"},{"last_name":"May","full_name":"May, Alexander","first_name":"Alexander"},{"last_name":"de Weger","full_name":"de Weger, Benne","first_name":"Benne"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","citation":{"apa":"Ernst, M., Jochemsz, E., May, A., &#38; de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In <i>EUROCRYPT 2005</i> (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/11426639_22\">https://doi.org/10.1007/11426639_22</a>","mla":"Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” <i>EUROCRYPT 2005</i>, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>.","short":"M. Ernst, E. Jochemsz, A. May, B. de Weger, in: EUROCRYPT 2005, Springer Berlin Heidelberg, Berlin, Heidelberg, 2005, pp. 371–386.","bibtex":"@inbook{Ernst_Jochemsz_May_de Weger_2005, place={Berlin, Heidelberg}, series={LNCS}, title={Partial Key Exposure Attacks on RSA up to Full Size Exponents}, DOI={<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>}, booktitle={EUROCRYPT 2005}, publisher={Springer Berlin Heidelberg}, author={Ernst, Matthias and Jochemsz, Ellen and May, Alexander and de Weger, Benne}, year={2005}, pages={371–386}, collection={LNCS} }","chicago":"Ernst, Matthias, Ellen Jochemsz, Alexander May, and Benne de Weger. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.” In <i>EUROCRYPT 2005</i>, 371–86. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11426639_22\">https://doi.org/10.1007/11426639_22</a>.","ieee":"M. Ernst, E. Jochemsz, A. May, and B. de Weger, “Partial Key Exposure Attacks on RSA up to Full Size Exponents,” in <i>EUROCRYPT 2005</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 371–386.","ama":"Ernst M, Jochemsz E, May A, de Weger B. Partial Key Exposure Attacks on RSA up to Full Size Exponents. In: <i>EUROCRYPT 2005</i>. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:371-386. doi:<a href=\"https://doi.org/10.1007/11426639_22\">10.1007/11426639_22</a>"},"page":"371-386","year":"2005","place":"Berlin, Heidelberg","publication_status":"published","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540259107","9783540320555"]}},{"status":"public","publication":"Algorithms – ESA 2005","type":"book_chapter","language":[{"iso":"eng"}],"department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","_id":"26991","citation":{"ama":"Rührup S, Schindelhauer C. Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In: <i>Algorithms – ESA 2005</i>. ; 2005. doi:<a href=\"https://doi.org/10.1007/11561071_5\">10.1007/11561071_5</a>","chicago":"Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” In <i>Algorithms – ESA 2005</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11561071_5\">https://doi.org/10.1007/11561071_5</a>.","ieee":"S. Rührup and C. Schindelhauer, “Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio,” in <i>Algorithms – ESA 2005</i>, Berlin, Heidelberg, 2005.","bibtex":"@inbook{Rührup_Schindelhauer_2005, place={Berlin, Heidelberg}, title={Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio}, DOI={<a href=\"https://doi.org/10.1007/11561071_5\">10.1007/11561071_5</a>}, booktitle={Algorithms – ESA 2005}, author={Rührup, Stefan and Schindelhauer, Christian}, year={2005} }","mla":"Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.” <i>Algorithms – ESA 2005</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11561071_5\">10.1007/11561071_5</a>.","short":"S. Rührup, C. Schindelhauer, in: Algorithms – ESA 2005, Berlin, Heidelberg, 2005.","apa":"Rührup, S., &#38; Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In <i>Algorithms – ESA 2005</i>. <a href=\"https://doi.org/10.1007/11561071_5\">https://doi.org/10.1007/11561071_5</a>"},"place":"Berlin, Heidelberg","year":"2005","publication_identifier":{"issn":["0302-9743","1611-3349"]},"publication_status":"published","doi":"10.1007/11561071_5","title":"Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio","date_created":"2021-10-28T10:22:39Z","author":[{"full_name":"Rührup, Stefan","last_name":"Rührup","first_name":"Stefan"},{"first_name":"Christian","full_name":"Schindelhauer, Christian","last_name":"Schindelhauer"}],"date_updated":"2022-01-06T06:57:31Z"},{"title":"Facility Location in Sublinear Time","doi":"10.1007/11523468_70","date_updated":"2022-01-06T06:53:52Z","date_created":"2020-09-01T11:53:19Z","author":[{"full_name":"Bădoiu, Mihai","last_name":"Bădoiu","first_name":"Mihai"},{"full_name":"Czumaj, Artur","last_name":"Czumaj","first_name":"Artur"},{"last_name":"Indyk","full_name":"Indyk, Piotr","first_name":"Piotr"},{"full_name":"Sohler, Christian","last_name":"Sohler","first_name":"Christian"}],"place":"Berlin, Heidelberg","year":"2005","page":"866-877","citation":{"short":"M. Bădoiu, A. Czumaj, P. Indyk, C. Sohler, in: Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), Berlin, Heidelberg, 2005, pp. 866–877.","mla":"Bădoiu, Mihai, et al. “Facility Location in Sublinear Time.” <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2005, pp. 866–77, doi:<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>.","bibtex":"@inproceedings{Bădoiu_Czumaj_Indyk_Sohler_2005, place={Berlin, Heidelberg}, title={Facility Location in Sublinear Time}, DOI={<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>}, booktitle={Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)}, author={Bădoiu, Mihai and Czumaj, Artur and Indyk, Piotr and Sohler, Christian}, year={2005}, pages={866–877} }","apa":"Bădoiu, M., Czumaj, A., Indyk, P., &#38; Sohler, C. (2005). Facility Location in Sublinear Time. In <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i> (pp. 866–877). Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11523468_70\">https://doi.org/10.1007/11523468_70</a>","chicago":"Bădoiu, Mihai, Artur Czumaj, Piotr Indyk, and Christian Sohler. “Facility Location in Sublinear Time.” In <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 866–77. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11523468_70\">https://doi.org/10.1007/11523468_70</a>.","ieee":"M. Bădoiu, A. Czumaj, P. Indyk, and C. Sohler, “Facility Location in Sublinear Time,” in <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>, 2005, pp. 866–877.","ama":"Bădoiu M, Czumaj A, Indyk P, Sohler C. Facility Location in Sublinear Time. In: <i>Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)</i>. Berlin, Heidelberg; 2005:866-877. doi:<a href=\"https://doi.org/10.1007/11523468_70\">10.1007/11523468_70</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540275800","9783540316916"]},"publication_status":"published","language":[{"iso":"eng"}],"_id":"18768","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP)","type":"conference"},{"abstract":[{"text":"Modern computer graphics systems are able to render sophisticated 3D szenes consisting of millions of polygons. In this paper we address the problem of occlusion culling. Aila, Miettinen, and Nordlund suggested to implement a FIFO buffer on graphics cards which is able to delay the polygons before drawing them. When one of the polygons within the buffer is occluded or masked by another polygon arriving later from the application, the rendering engine can drop the occluded one without rendering, saving important rendering time.<br>We introduce a theoretical online model to analyse these problems in theory using competitive analysis. For different cost measures addressed we invent the first competitive algorithms for online occlusion culling. Our implementation shows that these algorithms outperform known ones for real 3D scenes as well.","lang":"eng"}],"status":"public","publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)","type":"conference","language":[{"iso":"eng"}],"_id":"18867","department":[{"_id":"63"}],"user_id":"15415","place":"Berlin, Heidelberg","year":"2005","page":"758-769","intvolume":"      3669","citation":{"ieee":"G. Frahling and J. Krokowski, “Online Occlusion Culling,” in <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 2005, vol. 3669, pp. 758–769.","chicago":"Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 3669:758–69. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/11561071_67\">https://doi.org/10.1007/11561071_67</a>.","ama":"Frahling G, Krokowski J. Online Occlusion Culling. In: <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>. Vol 3669. Berlin, Heidelberg: Springer; 2005:758-769. doi:<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>","apa":"Frahling, G., &#38; Krokowski, J. (2005). Online Occlusion Culling. In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i> (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/11561071_67\">https://doi.org/10.1007/11561071_67</a>","short":"G. Frahling, J. Krokowski, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer, Berlin, Heidelberg, 2005, pp. 758–769.","mla":"Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.” <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, vol. 3669, Springer, 2005, pp. 758–69, doi:<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>.","bibtex":"@inproceedings{Frahling_Krokowski_2005, place={Berlin, Heidelberg}, title={Online Occlusion Culling}, volume={3669}, DOI={<a href=\"https://doi.org/10.1007/11561071_67\">10.1007/11561071_67</a>}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer}, author={Frahling, Gereon and Krokowski, Jens}, year={2005}, pages={758–769} }"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540291183","9783540319511"]},"publication_status":"published","title":"Online Occlusion Culling","doi":"10.1007/11561071_67","publisher":"Springer","date_updated":"2022-01-06T06:53:53Z","volume":3669,"author":[{"first_name":"Gereon","full_name":"Frahling, Gereon","last_name":"Frahling"},{"first_name":"Jens","last_name":"Krokowski","full_name":"Krokowski, Jens"}],"date_created":"2020-09-02T13:26:52Z"},{"place":"Berlin, Heidelberg","year":"2005","citation":{"apa":"Bienkowski, M., &#38; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>","bibtex":"@inproceedings{Bienkowski_Korzeniowski_2005, place={Berlin, Heidelberg}, title={Dynamic Page Migration Under Brownian Motion}, DOI={<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>}, booktitle={Proc. of the European Conference in Parallel Processing (Euro-Par)}, author={Bienkowski, Marcin and Korzeniowski, Miroslaw}, year={2005} }","mla":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005, doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>.","short":"M. Bienkowski, M. Korzeniowski, in: Proc. of the European Conference in Parallel Processing (Euro-Par), Berlin, Heidelberg, 2005.","ieee":"M. Bienkowski and M. Korzeniowski, “Dynamic Page Migration Under Brownian Motion,” in <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>, 2005.","chicago":"Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.” In <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg, 2005. <a href=\"https://doi.org/10.1007/11549468_105\">https://doi.org/10.1007/11549468_105</a>.","ama":"Bienkowski M, Korzeniowski M. Dynamic Page Migration Under Brownian Motion. In: <i>Proc. of the European Conference in Parallel Processing (Euro-Par)</i>. Berlin, Heidelberg; 2005. doi:<a href=\"https://doi.org/10.1007/11549468_105\">10.1007/11549468_105</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540287001","9783540319252"]},"publication_status":"published","title":"Dynamic Page Migration Under Brownian Motion","doi":"10.1007/11549468_105","date_updated":"2022-01-06T06:53:54Z","author":[{"last_name":"Bienkowski","full_name":"Bienkowski, Marcin","first_name":"Marcin"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"}],"date_created":"2020-09-03T07:56:58Z","abstract":[{"text":"We consider Dynamic Page Migration (DPM) problem, one of the fundamental subproblems of data management in dynamically changing networks. We investigate a hybrid scenario, where access patterns to the shared object are dictated by an adversary, and each processor performs a random walk in X. We extend the previous results of [4]: we develop algorithms for the case where X is a ring, and prove that with high probability they achieve a competitive ratio of O~(min{D−−√4,n}), where D is the size of the shared object and n is the number of nodes in the network. These results hold also for any d-dimensional torus or mesh with diameter at least Ω~(D−−√).","lang":"eng"}],"status":"public","publication":"Proc. of the European Conference in Parallel Processing (Euro-Par)","type":"conference","language":[{"iso":"eng"}],"_id":"18912","department":[{"_id":"63"}],"user_id":"15415"},{"doi":"10.1007/11561071_72","volume":3669,"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Byrka","full_name":"Byrka, Jarosław","first_name":"Jarosław"}],"date_updated":"2022-01-06T06:53:54Z","intvolume":"      3669","page":"815-826","citation":{"chicago":"Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 3669:815–26. Berlin, Heidelberg: Springer , 2005. <a href=\"https://doi.org/10.1007/11561071_72\">https://doi.org/10.1007/11561071_72</a>.","ieee":"M. Bienkowski and J. Byrka, “Bucket Game with Applications to Set Multicover and Dynamic Page Migration,” in <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, 2005, vol. 3669, pp. 815–826.","ama":"Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>. Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>","apa":"Bienkowski, M., &#38; Byrka, J. (2005). Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i> (Vol. 3669, pp. 815–826). Berlin, Heidelberg: Springer . <a href=\"https://doi.org/10.1007/11561071_72\">https://doi.org/10.1007/11561071_72</a>","mla":"Bienkowski, Marcin, and Jarosław Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.” <i>Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)</i>, vol. 3669, Springer , 2005, pp. 815–26, doi:<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>.","bibtex":"@inproceedings{Bienkowski_Byrka_2005, place={Berlin, Heidelberg}, title={Bucket Game with Applications to Set Multicover and Dynamic Page Migration}, volume={3669}, DOI={<a href=\"https://doi.org/10.1007/11561071_72\">10.1007/11561071_72</a>}, booktitle={Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)}, publisher={Springer }, author={Bienkowski, Marcin and Byrka, Jarosław}, year={2005}, pages={815–826} }","short":"M. Bienkowski, J. Byrka, in: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), Springer , Berlin, Heidelberg, 2005, pp. 815–826."},"place":"Berlin, Heidelberg","publication_identifier":{"isbn":["9783540291183","9783540319511"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","department":[{"_id":"63"}],"user_id":"15415","_id":"18915","status":"public","type":"conference","title":"Bucket Game with Applications to Set Multicover and Dynamic Page Migration","date_created":"2020-09-03T08:11:11Z","publisher":"Springer ","year":"2005","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We present a simple two-person Bucket Game, based on throwing balls into buckets, and we<br>discuss possible players' strategies.<br><br>We use these strategies to create an approximation algorithm for a generalization of<br>the well known Set Cover problem, where we need to cover each element by at least $k$ sets.<br>Furthermore, we apply these strategies to construct a randomized algorithm for Dynamic Page Migration <br>problem achieving the optimal competitive ratio against an oblivious adversary."}],"publication":"Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005)"},{"publication_identifier":{"isbn":["9783540253396","9783540319566"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"413-420","intvolume":"      3420","citation":{"mla":"Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” <i>Proceedings of the 4th International Conference on Networking</i>, vol. 3420, Springer, 2005, pp. 413–20, doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>.","short":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, O. Orhan, in: Proceedings of the 4th International Conference on Networking, Springer, Berlin, Heidelberg, 2005, pp. 413–420.","bibtex":"@inproceedings{Bienkowski_Brinkmann_Korzeniowski_Orhan_2005, place={Berlin, Heidelberg}, series={ Lecture Notes in Computer Science}, title={Cube Connected Cycles Based Bluetooth Scatternet Formation}, volume={3420}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>}, booktitle={Proceedings of the 4th International Conference on Networking}, publisher={Springer}, author={Bienkowski, Marcin and Brinkmann, André and Korzeniowski, Miroslaw and Orhan, Orhan}, year={2005}, pages={413–420}, collection={ Lecture Notes in Computer Science} }","apa":"Bienkowski, M., Brinkmann, A., Korzeniowski, M., &#38; Orhan, O. (2005). Cube Connected Cycles Based Bluetooth Scatternet Formation. In <i>Proceedings of the 4th International Conference on Networking</i> (Vol. 3420, pp. 413–420). Berlin, Heidelberg: Springer. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>","ieee":"M. Bienkowski, A. Brinkmann, M. Korzeniowski, and O. Orhan, “Cube Connected Cycles Based Bluetooth Scatternet Formation,” in <i>Proceedings of the 4th International Conference on Networking</i>, 2005, vol. 3420, pp. 413–420.","chicago":"Bienkowski, Marcin, André Brinkmann, Miroslaw Korzeniowski, and Orhan Orhan. “Cube Connected Cycles Based Bluetooth Scatternet Formation.” In <i>Proceedings of the 4th International Conference on Networking</i>, 3420:413–20.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 2005. <a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">https://doi.org/10.1007/978-3-540-31956-6_49</a>.","ama":"Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: <i>Proceedings of the 4th International Conference on Networking</i>. Vol 3420.  Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:<a href=\"https://doi.org/10.1007/978-3-540-31956-6_49\">10.1007/978-3-540-31956-6_49</a>"},"place":"Berlin, Heidelberg","volume":3420,"author":[{"first_name":"Marcin","last_name":"Bienkowski","full_name":"Bienkowski, Marcin"},{"last_name":"Brinkmann","full_name":"Brinkmann, André","first_name":"André"},{"first_name":"Miroslaw","last_name":"Korzeniowski","full_name":"Korzeniowski, Miroslaw"},{"last_name":"Orhan","full_name":"Orhan, Orhan","first_name":"Orhan"}],"date_updated":"2022-01-06T06:53:54Z","doi":"10.1007/978-3-540-31956-6_49","type":"conference","status":"public","department":[{"_id":"63"}],"series_title":" Lecture Notes in Computer Science","user_id":"15415","_id":"18924","year":"2005","date_created":"2020-09-03T09:52:33Z","publisher":"Springer","title":"Cube Connected Cycles Based Bluetooth Scatternet Formation","publication":"Proceedings of the 4th International Conference on Networking","abstract":[{"lang":"eng","text":"Bluetooth is a wireless communication standard developed for personal area networks (PAN) that gained popularity in the last years. It was designed to connect a few devices together, however nowadays there is a need to build larger networks. Construction and maintenance algorithms have great effect on performance of the network. We present an algorithm based on Cube Connected Cycles (CCC) topology and show how to maintain the network so that it is easily scalable. Our design guarantees good properties such as constant degree and logarithmic dilation. Besides, the construction costs are proven to be at most constant times larger than any other algorithm would need."}],"language":[{"iso":"eng"}]}]