[{"place":"Berlin, Heidelberg","year":"2004","page":"1-13","citation":{"bibtex":"@inbook{Blömer_May_2004, place={Berlin, Heidelberg}, title={A Generalized Wiener Attack on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>}, booktitle={Public Key Cryptography – PKC 2004}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2004}, pages={1–13} }","short":"J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.","mla":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” <i>Public Key Cryptography – PKC 2004</i>, Springer Berlin Heidelberg, 2004, pp. 1–13, doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>.","apa":"Blömer, J., &#38; May, A. (2004). A Generalized Wiener Attack on RSA. In <i>Public Key Cryptography – PKC 2004</i> (pp. 1–13). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>","ieee":"J. Blömer and A. May, “A Generalized Wiener Attack on RSA,” in <i>Public Key Cryptography – PKC 2004</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2004, pp. 1–13.","chicago":"Blömer, Johannes, and Alexander May. “A Generalized Wiener Attack on RSA.” In <i>Public Key Cryptography – PKC 2004</i>, 1–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. <a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">https://doi.org/10.1007/978-3-540-24632-9_1</a>.","ama":"Blömer J, May A. A Generalized Wiener Attack on RSA. In: <i>Public Key Cryptography – PKC 2004</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:1-13. doi:<a href=\"https://doi.org/10.1007/978-3-540-24632-9_1\">10.1007/978-3-540-24632-9_1</a>"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540210184","9783540246329"]},"has_accepted_license":"1","publication_status":"published","title":"A Generalized Wiener Attack on RSA","doi":"10.1007/978-3-540-24632-9_1","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:20:59Z","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"},{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"}],"status":"public","file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2018-06-05T08:21:31Z","date_created":"2018-06-05T08:21:31Z","creator":"feidens","file_size":198120,"file_name":"keys.pdf","access_level":"closed","file_id":"3013"}],"publication":"Public Key Cryptography – PKC 2004","type":"book_chapter","ddc":["000"],"file_date_updated":"2018-06-05T08:21:31Z","_id":"3012","department":[{"_id":"64"}],"user_id":"25078"},{"type":"conference","publication":"Proceedings of the 10th ACM conference on Computer and communication security  - CCS '03","status":"public","user_id":"25078","department":[{"_id":"64"}],"_id":"3017","publication_status":"published","publication_identifier":{"isbn":["1581137389"]},"citation":{"ama":"Blömer J, Otto M, Seifert J-P. A new CRT-RSA algorithm secure against bellcore attacks. In: <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>. ACM Press; 2004. doi:<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>","ieee":"J. Blömer, M. Otto, and J.-P. Seifert, “A new CRT-RSA algorithm secure against bellcore attacks,” in <i>Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03</i>, 2004.","chicago":"Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” In <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>. ACM Press, 2004. <a href=\"https://doi.org/10.1145/948109.948151\">https://doi.org/10.1145/948109.948151</a>.","short":"J. Blömer, M. Otto, J.-P. Seifert, in: Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03, ACM Press, 2004.","bibtex":"@inproceedings{Blömer_Otto_Seifert_2004, title={A new CRT-RSA algorithm secure against bellcore attacks}, DOI={<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>}, booktitle={Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03}, publisher={ACM Press}, author={Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}, year={2004} }","mla":"Blömer, Johannes, et al. “A New CRT-RSA Algorithm Secure against Bellcore Attacks.” <i>Proceedings of the 10th ACM Conference on Computer and Communication Security  - CCS ’03</i>, ACM Press, 2004, doi:<a href=\"https://doi.org/10.1145/948109.948151\">10.1145/948109.948151</a>.","apa":"Blömer, J., Otto, M., &#38; Seifert, J.-P. (2004). A new CRT-RSA algorithm secure against bellcore attacks. In <i>Proceedings of the 10th ACM conference on Computer and communication security  - CCS ’03</i>. ACM Press. <a href=\"https://doi.org/10.1145/948109.948151\">https://doi.org/10.1145/948109.948151</a>"},"year":"2004","date_created":"2018-06-05T08:24:48Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"full_name":"Otto, Martin","last_name":"Otto","first_name":"Martin"},{"full_name":"Seifert, Jean-Pierre","last_name":"Seifert","first_name":"Jean-Pierre"}],"publisher":"ACM Press","date_updated":"2022-01-06T06:58:51Z","doi":"10.1145/948109.948151","title":"A new CRT-RSA algorithm secure against bellcore attacks"},{"author":[{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"},{"first_name":"Alexander","last_name":"May","full_name":"May, Alexander"}],"date_created":"2018-06-05T08:24:11Z","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","doi":"10.1007/978-3-540-45146-4_2","title":"New Partial Key Exposure Attacks on RSA","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540406747","9783540451464"]},"publication_status":"published","page":"27-43","citation":{"apa":"Blömer, J., &#38; May, A. (2003). New Partial Key Exposure Attacks on RSA. In <i>Advances in Cryptology - CRYPTO 2003</i> (pp. 27–43). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">https://doi.org/10.1007/978-3-540-45146-4_2</a>","mla":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” <i>Advances in Cryptology - CRYPTO 2003</i>, Springer Berlin Heidelberg, 2003, pp. 27–43, doi:<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>.","bibtex":"@inbook{Blömer_May_2003, place={Berlin, Heidelberg}, title={New Partial Key Exposure Attacks on RSA}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>}, booktitle={Advances in Cryptology - CRYPTO 2003}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and May, Alexander}, year={2003}, pages={27–43} }","short":"J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.","ieee":"J. Blömer and A. May, “New Partial Key Exposure Attacks on RSA,” in <i>Advances in Cryptology - CRYPTO 2003</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 27–43.","chicago":"Blömer, Johannes, and Alexander May. “New Partial Key Exposure Attacks on RSA.” In <i>Advances in Cryptology - CRYPTO 2003</i>, 27–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">https://doi.org/10.1007/978-3-540-45146-4_2</a>.","ama":"Blömer J, May A. New Partial Key Exposure Attacks on RSA. In: <i>Advances in Cryptology - CRYPTO 2003</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:27-43. doi:<a href=\"https://doi.org/10.1007/978-3-540-45146-4_2\">10.1007/978-3-540-45146-4_2</a>"},"place":"Berlin, Heidelberg","year":"2003","department":[{"_id":"64"}],"user_id":"25078","_id":"3016","publication":"Advances in Cryptology - CRYPTO 2003","type":"book_chapter","status":"public"},{"status":"public","type":"book_chapter","publication":"Financial Cryptography","_id":"3018","user_id":"25078","department":[{"_id":"64"}],"place":"Berlin, Heidelberg","year":"2003","citation":{"mla":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” <i>Financial Cryptography</i>, Springer Berlin Heidelberg, 2003, pp. 162–81, doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>.","bibtex":"@inbook{Blömer_Seifert_2003, place={Berlin, Heidelberg}, title={Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)}, DOI={<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>}, booktitle={Financial Cryptography}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={2003}, pages={162–181} }","short":"J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.","apa":"Blömer, J., &#38; Seifert, J.-P. (2003). Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In <i>Financial Cryptography</i> (pp. 162–181). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>","ama":"Blömer J, Seifert J-P. Fault Based Cryptanalysis of the Advanced Encryption Standard (AES). In: <i>Financial Cryptography</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2003:162-181. doi:<a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">10.1007/978-3-540-45126-6_12</a>","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES).” In <i>Financial Cryptography</i>, 162–81. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. <a href=\"https://doi.org/10.1007/978-3-540-45126-6_12\">https://doi.org/10.1007/978-3-540-45126-6_12</a>.","ieee":"J. Blömer and J.-P. Seifert, “Fault Based Cryptanalysis of the Advanced Encryption Standard (AES),” in <i>Financial Cryptography</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2003, pp. 162–181."},"page":"162-181","publication_status":"published","publication_identifier":{"isbn":["9783540406631","9783540451266"],"issn":["0302-9743","1611-3349"]},"title":"Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)","doi":"10.1007/978-3-540-45126-6_12","publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:51Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"full_name":"Seifert, Jean-Pierre","last_name":"Seifert","first_name":"Jean-Pierre"}],"date_created":"2018-06-05T08:25:18Z"},{"_id":"3034","department":[{"_id":"64"}],"user_id":"25078","extern":"1","file_date_updated":"2018-06-05T08:37:48Z","type":"journal_article","status":"public","date_updated":"2022-01-06T06:58:53Z","volume":42,"author":[{"first_name":"Andres","last_name":"Albanese","full_name":"Albanese, Andres"},{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Jeff","last_name":"Edmonds","full_name":"Edmonds, Jeff"},{"last_name":"Luby","full_name":"Luby, Michael","first_name":"Michael"},{"first_name":"Madhu","full_name":"Sudan, Madhu","last_name":"Sudan"}],"doi":"10.1109/18.556670","has_accepted_license":"1","publication_identifier":{"issn":["0018-9448"]},"publication_status":"published","page":"1737-1744","intvolume":"        42","citation":{"ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. <i>IEEE Transactions on Information Theory</i>. 2002;42(6):1737-1744. doi:<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>","chicago":"Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” <i>IEEE Transactions on Information Theory</i> 42, no. 6 (2002): 1737–44. <a href=\"https://doi.org/10.1109/18.556670\">https://doi.org/10.1109/18.556670</a>.","ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” <i>IEEE Transactions on Information Theory</i>, vol. 42, no. 6, pp. 1737–1744, 2002.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., &#38; Sudan, M. (2002). Priority encoding transmission. <i>IEEE Transactions on Information Theory</i>, <i>42</i>(6), 1737–1744. <a href=\"https://doi.org/10.1109/18.556670\">https://doi.org/10.1109/18.556670</a>","mla":"Albanese, Andres, et al. “Priority Encoding Transmission.” <i>IEEE Transactions on Information Theory</i>, vol. 42, no. 6, Institute of Electrical and Electronics Engineers (IEEE), 2002, pp. 1737–44, doi:<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>.","short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, IEEE Transactions on Information Theory 42 (2002) 1737–1744.","bibtex":"@article{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, volume={42}, DOI={<a href=\"https://doi.org/10.1109/18.556670\">10.1109/18.556670</a>}, number={6}, journal={IEEE Transactions on Information Theory}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Albanese, Andres and Blömer, Johannes and Edmonds, Jeff and Luby, Michael and Sudan, Madhu}, year={2002}, pages={1737–1744} }"},"ddc":["000"],"publication":"IEEE Transactions on Information Theory","file":[{"file_id":"3035","file_name":"pet.pdf","access_level":"closed","file_size":260143,"creator":"feidens","date_created":"2018-06-05T08:37:48Z","date_updated":"2018-06-05T08:37:48Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","date_created":"2018-06-05T08:36:14Z","title":"Priority encoding transmission","issue":"6","year":"2002"},{"title":"Priority encoding transmission","doi":"10.1109/sfcs.1994.365731","date_updated":"2022-01-06T06:58:53Z","publisher":"IEEE Comput. Soc. Press","date_created":"2018-06-05T08:43:13Z","author":[{"first_name":"A.","last_name":"Albanese","full_name":"Albanese, A."},{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"full_name":"Edmonds, J.","last_name":"Edmonds","first_name":"J."},{"full_name":"Luby, M.","last_name":"Luby","first_name":"M."},{"last_name":"Sudan","full_name":"Sudan, M.","first_name":"M."}],"year":"2002","citation":{"ama":"Albanese A, Blömer J, Edmonds J, Luby M, Sudan M. Priority encoding transmission. In: <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 2002. doi:<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>","ieee":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, and M. Sudan, “Priority encoding transmission,” in <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>, 2002.","chicago":"Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 2002. <a href=\"https://doi.org/10.1109/sfcs.1994.365731\">https://doi.org/10.1109/sfcs.1994.365731</a>.","bibtex":"@inproceedings{Albanese_Blömer_Edmonds_Luby_Sudan_2002, title={Priority encoding transmission}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>}, booktitle={Proceedings 35th Annual Symposium on Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Albanese, A. and Blömer, Johannes and Edmonds, J. and Luby, M. and Sudan, M.}, year={2002} }","mla":"Albanese, A., et al. “Priority Encoding Transmission.” <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 2002, doi:<a href=\"https://doi.org/10.1109/sfcs.1994.365731\">10.1109/sfcs.1994.365731</a>.","short":"A. Albanese, J. Blömer, J. Edmonds, M. Luby, M. Sudan, in: Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press, 2002.","apa":"Albanese, A., Blömer, J., Edmonds, J., Luby, M., &#38; Sudan, M. (2002). Priority encoding transmission. In <i>Proceedings 35th Annual Symposium on Foundations of Computer Science</i>. IEEE Comput. Soc. Press. <a href=\"https://doi.org/10.1109/sfcs.1994.365731\">https://doi.org/10.1109/sfcs.1994.365731</a>"},"publication_identifier":{"isbn":["0818665807"]},"publication_status":"published","extern":"1","_id":"3040","department":[{"_id":"64"}],"user_id":"25078","status":"public","publication":"Proceedings 35th Annual Symposium on Foundations of Computer Science","type":"conference"},{"publication":"[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science","type":"conference","status":"public","file":[{"file_size":335754,"file_name":"ComputingSumsOfRadicals_01.pdf","access_level":"closed","file_id":"3042","date_updated":"2018-06-05T08:45:15Z","date_created":"2018-06-05T08:45:15Z","creator":"feidens","success":1,"relation":"main_file","content_type":"application/pdf"}],"_id":"3041","department":[{"_id":"64"}],"user_id":"25078","ddc":["000"],"file_date_updated":"2018-06-05T08:45:15Z","extern":"1","publication_identifier":{"isbn":["0818624450"]},"has_accepted_license":"1","publication_status":"published","year":"2002","citation":{"ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” 2002, doi: <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>.","chicago":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 2002. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>.","ama":"Blömer J. Computing sums of radicals in polynomial time. In: <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 2002. doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>","apa":"Blömer, J. (2002). Computing sums of radicals in polynomial time. <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>","mla":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” <i>[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 2002, doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>.","bibtex":"@inproceedings{Blömer_2002, title={Computing sums of radicals in polynomial time}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>}, booktitle={[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={2002} }","short":"J. Blömer, in: [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 2002."},"date_updated":"2023-01-10T13:49:25Z","publisher":"IEEE Comput. Soc. Press","date_created":"2018-06-05T08:44:18Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"}],"title":"Computing sums of radicals in polynomial time","doi":"10.1109/sfcs.1991.185434"},{"type":"book_chapter","publication":"Automata, Languages and Programming","status":"public","_id":"3023","user_id":"25078","department":[{"_id":"64"}],"publication_status":"published","publication_identifier":{"isbn":["9783540677154","9783540450221"],"issn":["0302-9743"]},"place":"Berlin, Heidelberg","year":"2000","citation":{"apa":"Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In <i>Automata, Languages and Programming</i> (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-45022-x_22\">https://doi.org/10.1007/3-540-45022-x_22</a>","bibtex":"@inbook{Blömer_2000, place={Berlin, Heidelberg}, title={Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices}, DOI={<a href=\"https://doi.org/10.1007/3-540-45022-x_22\">10.1007/3-540-45022-x_22</a>}, booktitle={Automata, Languages and Programming}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={2000}, pages={248–259} }","mla":"Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” <i>Automata, Languages and Programming</i>, Springer Berlin Heidelberg, 2000, pp. 248–59, doi:<a href=\"https://doi.org/10.1007/3-540-45022-x_22\">10.1007/3-540-45022-x_22</a>.","short":"J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.","ieee":"J. Blömer, “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 2000, pp. 248–259.","chicago":"Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In <i>Automata, Languages and Programming</i>, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. <a href=\"https://doi.org/10.1007/3-540-45022-x_22\">https://doi.org/10.1007/3-540-45022-x_22</a>.","ama":"Blömer J. Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 2000:248-259. doi:<a href=\"https://doi.org/10.1007/3-540-45022-x_22\">10.1007/3-540-45022-x_22</a>"},"page":"248-259","date_updated":"2022-01-06T06:58:51Z","publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:27:28Z","author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"}],"title":"Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices","doi":"10.1007/3-540-45022-x_22"},{"publication":"Proceedings of the thirty-first annual ACM symposium on Theory of computing  - STOC '99","type":"conference","status":"public","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":313561,"file_name":"short.pdf","file_id":"3025","access_level":"closed","date_updated":"2018-06-05T08:28:14Z","creator":"feidens","date_created":"2018-06-05T08:28:14Z"}],"department":[{"_id":"64"}],"user_id":"23","_id":"3024","file_date_updated":"2018-06-05T08:28:14Z","ddc":["000"],"publication_identifier":{"isbn":["1581130678"]},"has_accepted_license":"1","publication_status":"published","citation":{"ieee":"J. Blömer and J.-P. Seifert, “On the complexity of computing short linearly independent vectors and short bases in a lattice,” 1999, doi: <a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>.","chicago":"Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” In <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>. ACM Press, 1999. <a href=\"https://doi.org/10.1145/301250.301441\">https://doi.org/10.1145/301250.301441</a>.","ama":"Blömer J, Seifert J-P. On the complexity of computing short linearly independent vectors and short bases in a lattice. In: <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>. ACM Press; 1999. doi:<a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>","apa":"Blömer, J., &#38; Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>. <a href=\"https://doi.org/10.1145/301250.301441\">https://doi.org/10.1145/301250.301441</a>","short":"J. Blömer, J.-P. Seifert, in: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99, ACM Press, 1999.","bibtex":"@inproceedings{Blömer_Seifert_1999, title={On the complexity of computing short linearly independent vectors and short bases in a lattice}, DOI={<a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>}, booktitle={Proceedings of the thirty-first annual ACM symposium on Theory of computing  - STOC ’99}, publisher={ACM Press}, author={Blömer, Johannes and Seifert, Jean-Pierre}, year={1999} }","mla":"Blömer, Johannes, and Jean-Pierre Seifert. “On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lattice.” <i>Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing  - STOC ’99</i>, ACM Press, 1999, doi:<a href=\"https://doi.org/10.1145/301250.301441\">10.1145/301250.301441</a>."},"year":"1999","date_created":"2018-06-05T08:27:53Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"first_name":"Jean-Pierre","last_name":"Seifert","full_name":"Seifert, Jean-Pierre"}],"publisher":"ACM Press","date_updated":"2023-01-10T13:49:15Z","doi":"10.1145/301250.301441","title":"On the complexity of computing short linearly independent vectors and short bases in a lattice"},{"date_created":"2018-06-05T08:29:47Z","author":[{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Trachsler","full_name":"Trachsler, Beat","first_name":"Beat"}],"date_updated":"2022-01-06T06:58:52Z","title":"A lower bound for a class of graph based loss resilient codes","publication_status":"published","has_accepted_license":"1","citation":{"ama":"Blömer J, Trachsler B. A lower bound for a class of graph based loss resilient codes. <i>Technical report/Departement of Computer Science, ETH Zürich</i>. 1998.","chicago":"Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” <i>Technical Report/Departement of Computer Science, ETH Zürich</i>, 1998.","ieee":"J. Blömer and B. Trachsler, “A lower bound for a class of graph based loss resilient codes,” <i>Technical report/Departement of Computer Science, ETH Zürich</i>, 1998.","apa":"Blömer, J., &#38; Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. <i>Technical Report/Departement of Computer Science, ETH Zürich</i>.","mla":"Blömer, Johannes, and Beat Trachsler. “A Lower Bound for a Class of Graph Based Loss Resilient Codes.” <i>Technical Report/Departement of Computer Science, ETH Zürich</i>, 1998.","bibtex":"@article{Blömer_Trachsler_1998, title={A lower bound for a class of graph based loss resilient codes}, journal={Technical report/Departement of Computer Science, ETH Zürich}, author={Blömer, Johannes and Trachsler, Beat}, year={1998} }","short":"J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (1998)."},"year":"1998","user_id":"25078","department":[{"_id":"64"}],"_id":"3028","file_date_updated":"2018-06-05T08:32:27Z","extern":"1","ddc":["000"],"type":"journal_article","publication":"Technical report/Departement of Computer Science, ETH Zürich","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":173369,"file_name":"code_lower.pdf","access_level":"closed","file_id":"3031","date_updated":"2018-06-05T08:32:27Z","creator":"feidens","date_created":"2018-06-05T08:32:27Z"}],"status":"public"},{"ddc":["000"],"publication":"Algorithms — ESA '97","file":[{"date_updated":"2018-06-05T08:31:35Z","creator":"feidens","date_created":"2018-06-05T08:31:35Z","file_size":1656133,"access_level":"closed","file_id":"3030","file_name":"DenestingByBoundedDegreeRevised.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"publisher":"Springer Berlin Heidelberg","date_created":"2018-06-05T08:30:40Z","title":"Denesting by bounded degree radicals","year":"1997","_id":"3029","department":[{"_id":"64"}],"user_id":"25078","file_date_updated":"2018-06-05T08:31:35Z","type":"book_chapter","status":"public","date_updated":"2022-01-06T06:58:52Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"doi":"10.1007/3-540-63397-9_5","publication_identifier":{"isbn":["9783540633976","9783540695363"],"issn":["0302-9743","1611-3349"]},"has_accepted_license":"1","publication_status":"published","place":"Berlin, Heidelberg","page":"53-63","citation":{"chicago":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” In <i>Algorithms — ESA ’97</i>, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_5\">https://doi.org/10.1007/3-540-63397-9_5</a>.","ieee":"J. Blömer, “Denesting by bounded degree radicals,” in <i>Algorithms — ESA ’97</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 53–63.","ama":"Blömer J. Denesting by bounded degree radicals. In: <i>Algorithms — ESA ’97</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 1997:53-63. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>","short":"J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, Berlin, Heidelberg, 1997, pp. 53–63.","bibtex":"@inbook{Blömer_1997, place={Berlin, Heidelberg}, title={Denesting by bounded degree radicals}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>}, booktitle={Algorithms — ESA ’97}, publisher={Springer Berlin Heidelberg}, author={Blömer, Johannes}, year={1997}, pages={53–63} }","mla":"Blömer, Johannes. “Denesting by Bounded Degree Radicals.” <i>Algorithms — ESA ’97</i>, Springer Berlin Heidelberg, 1997, pp. 53–63, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_5\">10.1007/3-540-63397-9_5</a>.","apa":"Blömer, J. (1997). Denesting by bounded degree radicals. In <i>Algorithms — ESA ’97</i> (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-63397-9_5\">https://doi.org/10.1007/3-540-63397-9_5</a>"}},{"date_updated":"2022-01-06T06:58:52Z","author":[{"first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes","id":"23"},{"full_name":"Karp, Richard","last_name":"Karp","first_name":"Richard"},{"first_name":"Emo","full_name":"Welzl, Emo","last_name":"Welzl"}],"date_created":"2018-06-05T08:34:49Z","title":"The rank of sparse random matrices over finite fields","doi":"10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","publication_status":"published","issue":"4","year":"1997","citation":{"ama":"Blömer J, Karp R, Welzl E. The rank of sparse random matrices over finite fields. <i>Random Structures \\&#38; Algorithms</i>. 1997;(4):407-419. doi:<a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>","ieee":"J. Blömer, R. Karp, and E. Welzl, “The rank of sparse random matrices over finite fields,” <i>Random Structures \\&#38; Algorithms</i>, no. 4, pp. 407–419, 1997.","chicago":"Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.” <i>Random Structures \\&#38; Algorithms</i>, no. 4 (1997): 407–19. <a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>.","bibtex":"@article{Blömer_Karp_Welzl_1997, title={The rank of sparse random matrices over finite fields}, DOI={<a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>}, number={4}, journal={Random Structures \\&#38; Algorithms}, author={Blömer, Johannes and Karp, Richard and Welzl, Emo}, year={1997}, pages={407–419} }","mla":"Blömer, Johannes, et al. “The Rank of Sparse Random Matrices over Finite Fields.” <i>Random Structures \\&#38; Algorithms</i>, no. 4, 1997, pp. 407–19, doi:<a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>.","short":"J. Blömer, R. Karp, E. Welzl, Random Structures \\&#38; Algorithms (1997) 407–419.","apa":"Blömer, J., Karp, R., &#38; Welzl, E. (1997). The rank of sparse random matrices over finite fields. <i>Random Structures \\&#38; Algorithms</i>, (4), 407–419. <a href=\"https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y\">https://doi.org/10.1002/(SICI)1098-2418(199707)10:4&#60;407::AID-RSA1&#62;3.0.CO;2-Y</a>"},"page":"407-419","_id":"3033","user_id":"25078","department":[{"_id":"64"}],"keyword":["random matrices","rank","finite fields"],"extern":"1","type":"journal_article","publication":"Random Structures \\& Algorithms","status":"public"},{"abstract":[{"text":"For two given simple polygonsP, Q, the problem is to determine a rigid motionI ofQ giving the best possible match betweenP andQ, i.e. minimizing the Hausdorff distance betweenP andI(Q). Faster algorithms as the one for the general problem are obtained for special cases, namely thatI is restricted to translations or even to translations only in one specified direction. It turns out that determining pseudo-optimal solutions, i.e. ones that differ from the optimum by just a constant factor, can be done much more efficiently than determining optimal solutions. In the most general case, the algorithm for the pseudo-optimal solution is based on the surprising fact that for the optimal possible match betweenP and an imageI(Q) ofQ, the distance between the centroids of the edges of the convex hulls ofP andI(Q) is a constant multiple of the Hausdorff distance betweenP andI(Q). It is also shown that the Hausdorff distance between two polygons can be determined in timeO(n logn), wheren is the total number of vertices.","lang":"eng"}],"publication":"Annals of Mathematics and Artificial Intelligence","language":[{"iso":"eng"}],"year":"1995","issue":"3","quality_controlled":"1","title":"Approximate matching of polygonal shapes","date_created":"2018-06-05T08:38:41Z","status":"public","type":"journal_article","extern":"1","user_id":"25078","department":[{"_id":"64"}],"_id":"3037","citation":{"mla":"Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 13, no. 3, 1995.","bibtex":"@article{Alt_Behrends_Blömer_1995, title={Approximate matching of polygonal shapes}, volume={13}, number={3}, journal={Annals of Mathematics and Artificial Intelligence}, author={Alt, Helmut and Behrends, Bernd and Blömer, Johannes}, year={1995} }","short":"H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).","apa":"Alt, H., Behrends, B., &#38; Blömer, J. (1995). Approximate matching of polygonal shapes. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>13</i>(3).","chicago":"Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” <i>Annals of Mathematics and Artificial Intelligence</i> 13, no. 3 (1995).","ieee":"H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 13, no. 3, 1995.","ama":"Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. <i>Annals of Mathematics and Artificial Intelligence</i>. 1995;13(3)."},"intvolume":"        13","publication_status":"published","publication_identifier":{"issn":["1573-7470"]},"author":[{"first_name":"Helmut","last_name":"Alt","full_name":"Alt, Helmut"},{"first_name":"Bernd","last_name":"Behrends","full_name":"Behrends, Bernd"},{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"volume":13,"date_updated":"2022-01-06T06:58:53Z"},{"author":[{"first_name":"Johannes","id":"23","full_name":"Blömer, Johannes","last_name":"Blömer"},{"first_name":"Malik","last_name":"Kalfane","full_name":"Kalfane, Malik"},{"full_name":"Karp, Richard","last_name":"Karp","first_name":"Richard"},{"first_name":"Marek","last_name":"Karpinski","full_name":"Karpinski, Marek"},{"full_name":"Luby, Michael","last_name":"Luby","first_name":"Michael"},{"full_name":"Zuckerman, David","last_name":"Zuckerman","first_name":"David"}],"date_created":"2018-06-05T08:40:26Z","date_updated":"2022-01-06T06:58:53Z","title":"An XOR-based erasure-resilient coding scheme","has_accepted_license":"1","citation":{"apa":"Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., &#38; Zuckerman, D. (1995). <i>An XOR-based erasure-resilient coding scheme</i>. Berkeley, USA.","mla":"Blömer, Johannes, et al. <i>An XOR-Based Erasure-Resilient Coding Scheme</i>. 1995.","bibtex":"@book{Blömer_Kalfane_Karp_Karpinski_Luby_Zuckerman_1995, place={Berkeley, USA}, series={Technical Report, International Computer Science Institute}, title={An XOR-based erasure-resilient coding scheme}, author={Blömer, Johannes and Kalfane, Malik and Karp, Richard and Karpinski, Marek and Luby, Michael and Zuckerman, David}, year={1995}, collection={Technical Report, International Computer Science Institute} }","short":"J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.","chicago":"Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, and David Zuckerman. <i>An XOR-Based Erasure-Resilient Coding Scheme</i>. Technical Report, International Computer Science Institute. Berkeley, USA, 1995.","ieee":"J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, and D. Zuckerman, <i>An XOR-based erasure-resilient coding scheme</i>. Berkeley, USA, 1995.","ama":"Blömer J, Kalfane M, Karp R, Karpinski M, Luby M, Zuckerman D. <i>An XOR-Based Erasure-Resilient Coding Scheme</i>. Berkeley, USA; 1995."},"place":"Berkeley, USA","year":"1995","department":[{"_id":"64"}],"series_title":"Technical Report, International Computer Science Institute","user_id":"25078","_id":"3038","file_date_updated":"2018-06-05T08:42:49Z","extern":"1","ddc":["000"],"type":"report","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_name":"erasure.pdf","access_level":"closed","file_id":"3039","file_size":261338,"date_created":"2018-06-05T08:42:49Z","creator":"feidens","date_updated":"2018-06-05T08:42:49Z"}]},{"status":"public","file":[{"file_name":"JohannesThesisAbstract.pdf","file_id":"3044","access_level":"closed","file_size":40741,"date_created":"2018-06-05T08:47:26Z","creator":"feidens","date_updated":"2018-06-05T08:47:26Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"type":"dissertation","extern":"1","file_date_updated":"2018-06-05T08:47:26Z","ddc":["000"],"department":[{"_id":"64"}],"user_id":"25078","_id":"3043","citation":{"ama":"Blömer J. <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik; 1992.","ieee":"J. Blömer, <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","chicago":"Blömer, Johannes. <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","bibtex":"@book{Blömer_1992, title={Simplifying Expressions Involving Radicals}, publisher={PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik}, author={Blömer, Johannes}, year={1992} }","mla":"Blömer, Johannes. <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","short":"J. Blömer, Simplifying Expressions Involving Radicals, PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","apa":"Blömer, J. (1992). <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik."},"year":"1992","has_accepted_license":"1","publication_status":"published","title":"Simplifying Expressions Involving Radicals","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"date_created":"2018-06-05T08:46:51Z","date_updated":"2022-01-06T06:58:54Z","publisher":"PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik"},{"department":[{"_id":"64"}],"user_id":"25078","_id":"3046","publication":"Data structures and efficient algorithms","type":"book_chapter","status":"public","date_created":"2018-06-05T08:51:15Z","author":[{"first_name":"Helmut","full_name":"Alt, Helmut","last_name":"Alt"},{"last_name":"Blömer","id":"23","full_name":"Blömer, Johannes","first_name":"Johannes"}],"publisher":"Springer Berlin Heidelberg","date_updated":"2022-01-06T06:58:54Z","doi":"10.1007/3-540-55488-2_19","title":"Resemblance and symmetries of geometric patterns","publication_identifier":{"isbn":["9783540554882","9783540471035"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","page":"1-24","citation":{"bibtex":"@inbook{Alt_Blömer_1992, place={Berlin, Heidelberg}, title={Resemblance and symmetries of geometric patterns}, DOI={<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>}, booktitle={Data structures and efficient algorithms}, publisher={Springer Berlin Heidelberg}, author={Alt, Helmut and Blömer, Johannes}, year={1992}, pages={1–24} }","short":"H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, Berlin, Heidelberg, 1992, pp. 1–24.","mla":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” <i>Data Structures and Efficient Algorithms</i>, Springer Berlin Heidelberg, 1992, pp. 1–24, doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>.","apa":"Alt, H., &#38; Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In <i>Data structures and efficient algorithms</i> (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/3-540-55488-2_19\">https://doi.org/10.1007/3-540-55488-2_19</a>","ama":"Alt H, Blömer J. Resemblance and symmetries of geometric patterns. In: <i>Data Structures and Efficient Algorithms</i>. Berlin, Heidelberg: Springer Berlin Heidelberg; 1992:1-24. doi:<a href=\"https://doi.org/10.1007/3-540-55488-2_19\">10.1007/3-540-55488-2_19</a>","ieee":"H. Alt and J. Blömer, “Resemblance and symmetries of geometric patterns,” in <i>Data structures and efficient algorithms</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1992, pp. 1–24.","chicago":"Alt, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In <i>Data Structures and Efficient Algorithms</i>, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. <a href=\"https://doi.org/10.1007/3-540-55488-2_19\">https://doi.org/10.1007/3-540-55488-2_19</a>."},"year":"1992","place":"Berlin, Heidelberg"},{"publication":"Proceedings., 33rd Annual Symposium on Foundations of Computer Science","type":"conference","status":"public","_id":"3047","department":[{"_id":"64"}],"user_id":"25078","extern":"1","publication_identifier":{"isbn":["0818629002"]},"publication_status":"published","year":"1992","citation":{"ama":"Blömer J. How to denest Ramanujan’s nested radicals. In: <i>Proceedings., 33rd Annual Symposium on Foundations of Computer Science</i>. IEEE; 1992. doi:<a href=\"https://doi.org/10.1109/sfcs.1992.267807\">10.1109/sfcs.1992.267807</a>","ieee":"J. Blömer, “How to denest Ramanujan’s nested radicals,” in <i>Proceedings., 33rd Annual Symposium on Foundations of Computer Science</i>, 1992.","chicago":"Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” In <i>Proceedings., 33rd Annual Symposium on Foundations of Computer Science</i>. IEEE, 1992. <a href=\"https://doi.org/10.1109/sfcs.1992.267807\">https://doi.org/10.1109/sfcs.1992.267807</a>.","short":"J. Blömer, in: Proceedings., 33rd Annual Symposium on Foundations of Computer Science, IEEE, 1992.","bibtex":"@inproceedings{Blömer_1992, title={How to denest Ramanujan’s nested radicals}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1992.267807\">10.1109/sfcs.1992.267807</a>}, booktitle={Proceedings., 33rd Annual Symposium on Foundations of Computer Science}, publisher={IEEE}, author={Blömer, Johannes}, year={1992} }","mla":"Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” <i>Proceedings., 33rd Annual Symposium on Foundations of Computer Science</i>, IEEE, 1992, doi:<a href=\"https://doi.org/10.1109/sfcs.1992.267807\">10.1109/sfcs.1992.267807</a>.","apa":"Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In <i>Proceedings., 33rd Annual Symposium on Foundations of Computer Science</i>. IEEE. <a href=\"https://doi.org/10.1109/sfcs.1992.267807\">https://doi.org/10.1109/sfcs.1992.267807</a>"},"date_updated":"2022-01-06T06:58:54Z","publisher":"IEEE","date_created":"2018-06-05T08:52:51Z","author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"title":"How to denest Ramanujan's nested radicals","doi":"10.1109/sfcs.1992.267807"},{"citation":{"ama":"Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes (extended abstract). In: <i>Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91</i>. ACM Press; 1991. doi:<a href=\"https://doi.org/10.1145/109648.109669\">10.1145/109648.109669</a>","ieee":"H. Alt, B. Behrends, and J. Blömer, “Approximate matching of polygonal shapes (extended abstract),” in <i>Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91</i>, 1991.","chicago":"Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).” In <i>Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91</i>. ACM Press, 1991. <a href=\"https://doi.org/10.1145/109648.109669\">https://doi.org/10.1145/109648.109669</a>.","mla":"Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes (Extended Abstract).” <i>Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91</i>, ACM Press, 1991, doi:<a href=\"https://doi.org/10.1145/109648.109669\">10.1145/109648.109669</a>.","short":"H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91, ACM Press, 1991.","bibtex":"@inproceedings{Alt_Behrends_Blömer_1991, title={Approximate matching of polygonal shapes (extended abstract)}, DOI={<a href=\"https://doi.org/10.1145/109648.109669\">10.1145/109648.109669</a>}, booktitle={Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91}, publisher={ACM Press}, author={Alt, Helmut and Behrends, Bernd and Blömer, Johannes}, year={1991} }","apa":"Alt, H., Behrends, B., &#38; Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In <i>Proceedings of the seventh annual symposium on Computational geometry  - SCG ’91</i>. ACM Press. <a href=\"https://doi.org/10.1145/109648.109669\">https://doi.org/10.1145/109648.109669</a>"},"year":"1991","publication_status":"published","publication_identifier":{"isbn":["0897914260"]},"doi":"10.1145/109648.109669","title":"Approximate matching of polygonal shapes (extended abstract)","author":[{"last_name":"Alt","full_name":"Alt, Helmut","first_name":"Helmut"},{"full_name":"Behrends, Bernd","last_name":"Behrends","first_name":"Bernd"},{"first_name":"Johannes","last_name":"Blömer","id":"23","full_name":"Blömer, Johannes"}],"date_created":"2018-06-05T08:54:37Z","publisher":"ACM Press","date_updated":"2022-01-06T06:58:54Z","status":"public","type":"conference","publication":"Proceedings of the seventh annual symposium on Computational geometry  - SCG '91","extern":"1","user_id":"25078","department":[{"_id":"64"}],"_id":"3048"},{"publication_identifier":{"isbn":["0818624450"]},"publication_status":"published","citation":{"chicago":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In <i>Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press, 1991. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>.","ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” in <i>Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>, 1991.","ama":"Blömer J. Computing sums of radicals in polynomial time. In: <i>Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press; 1991. doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>","apa":"Blömer, J. (1991). Computing sums of radicals in polynomial time. In <i>Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>. IEEE Comput. Soc. Press. <a href=\"https://doi.org/10.1109/sfcs.1991.185434\">https://doi.org/10.1109/sfcs.1991.185434</a>","short":"J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.","bibtex":"@inproceedings{Blömer_1991, title={Computing sums of radicals in polynomial time}, DOI={<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>}, booktitle={Proceedings 32nd Annual Symposium of Foundations of Computer Science}, publisher={IEEE Comput. Soc. Press}, author={Blömer, Johannes}, year={1991} }","mla":"Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” <i>Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>, IEEE Comput. Soc. Press, 1991, doi:<a href=\"https://doi.org/10.1109/sfcs.1991.185434\">10.1109/sfcs.1991.185434</a>."},"year":"1991","author":[{"first_name":"Johannes","full_name":"Blömer, Johannes","id":"23","last_name":"Blömer"}],"date_created":"2018-06-05T08:56:01Z","publisher":"IEEE Comput. Soc. Press","date_updated":"2022-01-06T06:58:54Z","doi":"10.1109/sfcs.1991.185434","title":"Computing sums of radicals in polynomial time","publication":"Proceedings 32nd Annual Symposium of Foundations of Computer Science","type":"conference","status":"public","department":[{"_id":"64"}],"user_id":"25078","_id":"3049","extern":"1"},{"status":"public","publication":"Automata, Languages and Programming","type":"book_chapter","language":[{"iso":"eng"}],"extern":"1","_id":"3050","department":[{"_id":"64"},{"_id":"63"}],"user_id":"14955","year":"1990","place":"Berlin/Heidelberg","page":"703-716","citation":{"mla":"Alt, Helmut, et al. “Approximation of Convex Polygons.” <i>Automata, Languages and Programming</i>, Springer-Verlag, 1990, pp. 703–16, doi:<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>.","short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","bibtex":"@inbook{Alt_Blömer_Wagener_1990, place={Berlin/Heidelberg}, title={Approximation of convex polygons}, DOI={<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>}, booktitle={Automata, Languages and Programming}, publisher={Springer-Verlag}, author={Alt, Helmut and Blömer, Johannes and Wagener, Hubert}, year={1990}, pages={703–716} }","apa":"Alt, H., Blömer, J., &#38; Wagener, H. (1990). Approximation of convex polygons. In <i>Automata, Languages and Programming</i> (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. <a href=\"https://doi.org/10.1007/bfb0032068\">https://doi.org/10.1007/bfb0032068</a>","chicago":"Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In <i>Automata, Languages and Programming</i>, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. <a href=\"https://doi.org/10.1007/bfb0032068\">https://doi.org/10.1007/bfb0032068</a>.","ieee":"H. Alt, J. Blömer, and H. Wagener, “Approximation of convex polygons,” in <i>Automata, Languages and Programming</i>, Berlin/Heidelberg: Springer-Verlag, 1990, pp. 703–716.","ama":"Alt H, Blömer J, Wagener H. Approximation of convex polygons. In: <i>Automata, Languages and Programming</i>. Berlin/Heidelberg: Springer-Verlag; 1990:703-716. doi:<a href=\"https://doi.org/10.1007/bfb0032068\">10.1007/bfb0032068</a>"},"publication_identifier":{"isbn":["3540528261"]},"publication_status":"published","title":"Approximation of convex polygons","doi":"10.1007/bfb0032068","date_updated":"2022-01-06T06:58:54Z","publisher":"Springer-Verlag","author":[{"last_name":"Alt","full_name":"Alt, Helmut","first_name":"Helmut"},{"last_name":"Blömer","full_name":"Blömer, Johannes","id":"23","first_name":"Johannes"},{"last_name":"Wagener","full_name":"Wagener, Hubert","first_name":"Hubert"}],"date_created":"2018-06-05T08:56:43Z"}]