[{"citation":{"short":"V. Krummel, Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.","chicago":"Krummel, Volker. <i>Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael</i>, 2001.","apa":"Krummel, V. (2001). <i>Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael</i>.","ieee":"V. Krummel, <i>Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael</i>. 2001.","ama":"Krummel V. <i>Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael</i>.; 2001.","bibtex":"@book{Krummel_2001, title={Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael}, author={Krummel, Volker}, year={2001} }","mla":"Krummel, Volker. <i>Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael</i>. 2001."},"file_date_updated":"2023-10-05T16:54:52Z","date_created":"2023-10-05T16:41:47Z","file":[{"date_created":"2023-10-05T16:41:41Z","creator":"bhenrik","file_id":"47729","content_type":"application/postscript","file_name":"2001_Krummel_AES.ps","access_level":"open_access","file_size":1580787,"relation":"main_file","date_updated":"2023-10-05T16:54:52Z"}],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"keyword":["Diplomarbeit"],"type":"misc","author":[{"first_name":"Volker","last_name":"Krummel","full_name":"Krummel, Volker"}],"year":"2001","title":"Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael","status":"public","has_accepted_license":"1","date_updated":"2023-10-05T16:54:52Z","_id":"47701","language":[{"iso":"eng"}],"ddc":["000"],"user_id":"41047"},{"language":[{"iso":"eng"}],"_id":"47702","ddc":["000"],"user_id":"41047","title":"Brauer Addition-Subtraction Chains","status":"public","year":"2001","author":[{"first_name":"Martin","last_name":"Otto","full_name":"Otto, Martin"}],"date_updated":"2023-10-05T16:54:58Z","has_accepted_license":"1","file":[{"date_created":"2023-10-05T16:42:18Z","creator":"bhenrik","file_id":"47730","content_type":"application/postscript","relation":"main_file","date_updated":"2023-10-05T16:54:58Z","file_name":"2001_Otto_BrauerAddition-SubtractionChains_Diplom.ps","access_level":"open_access","file_size":2275300}],"date_created":"2023-10-05T16:42:24Z","type":"misc","keyword":["Diplomarbeit"],"oa":"1","department":[{"_id":"34"},{"_id":"64"}],"file_date_updated":"2023-10-05T16:54:58Z","citation":{"mla":"Otto, Martin. <i>Brauer Addition-Subtraction Chains</i>. 2001.","bibtex":"@book{Otto_2001, title={Brauer Addition-Subtraction Chains}, author={Otto, Martin}, year={2001} }","ama":"Otto M. <i>Brauer Addition-Subtraction Chains</i>.; 2001.","ieee":"M. Otto, <i>Brauer Addition-Subtraction Chains</i>. 2001.","apa":"Otto, M. (2001). <i>Brauer Addition-Subtraction Chains</i>.","chicago":"Otto, Martin. <i>Brauer Addition-Subtraction Chains</i>, 2001.","short":"M. Otto, Brauer Addition-Subtraction Chains, 2001."}},{"user_id":"25078","doi":"10.1007/3-540-45022-x_22","_id":"3023","publisher":"Springer Berlin Heidelberg","page":"248-259","publication_status":"published","date_updated":"2022-01-06T06:58:51Z","publication_identifier":{"isbn":["9783540677154","9783540450221"],"issn":["0302-9743"]},"author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"}],"title":"Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices","year":"2000","status":"public","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:27:28Z","place":"Berlin, Heidelberg","citation":{"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>","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>.","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>.","short":"J. Blömer, in: Automata, Languages and Programming, Springer Berlin Heidelberg, Berlin, Heidelberg, 2000, pp. 248–259.","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>","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."},"publication":"Automata, Languages and Programming"},{"_id":"3024","publisher":"ACM Press","user_id":"23","ddc":["000"],"doi":"10.1145/301250.301441","year":"1999","status":"public","title":"On the complexity of computing short linearly independent vectors and short bases in a lattice","publication_identifier":{"isbn":["1581130678"]},"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"},{"first_name":"Jean-Pierre","last_name":"Seifert","full_name":"Seifert, Jean-Pierre"}],"publication_status":"published","date_updated":"2023-01-10T13:49:15Z","has_accepted_license":"1","file":[{"creator":"feidens","date_created":"2018-06-05T08:28:14Z","file_size":313561,"access_level":"closed","file_name":"short.pdf","date_updated":"2018-06-05T08:28:14Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"3025"}],"date_created":"2018-06-05T08:27:53Z","type":"conference","department":[{"_id":"64"}],"file_date_updated":"2018-06-05T08:28:14Z","publication":"Proceedings of the thirty-first annual ACM symposium on Theory of computing  - STOC '99","citation":{"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>","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>.","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.","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>.","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>","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} }"}},{"citation":{"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.","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>.","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.","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.","short":"J. Blömer, B. Trachsler, Technical Report/Departement of Computer Science, ETH Zürich (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.","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} }"},"publication":"Technical report/Departement of Computer Science, ETH Zürich","file_date_updated":"2018-06-05T08:32:27Z","extern":"1","date_created":"2018-06-05T08:29:47Z","file":[{"date_created":"2018-06-05T08:32:27Z","creator":"feidens","file_id":"3031","content_type":"application/pdf","success":1,"file_name":"code_lower.pdf","access_level":"closed","file_size":173369,"relation":"main_file","date_updated":"2018-06-05T08:32:27Z"}],"department":[{"_id":"64"}],"type":"journal_article","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"},{"last_name":"Trachsler","first_name":"Beat","full_name":"Trachsler, Beat"}],"title":"A lower bound for a class of graph based loss resilient codes","year":"1998","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:52Z","publication_status":"published","_id":"3028","ddc":["000"],"user_id":"25078"},{"publication":"Algorithms — ESA '97","department":[{"_id":"64"}],"type":"book_chapter","date_created":"2018-06-05T08:30:40Z","file":[{"date_created":"2018-06-05T08:31:35Z","creator":"feidens","content_type":"application/pdf","success":1,"file_id":"3030","date_updated":"2018-06-05T08:31:35Z","relation":"main_file","access_level":"closed","file_size":1656133,"file_name":"DenestingByBoundedDegreeRevised.pdf"}],"publication_status":"published","date_updated":"2022-01-06T06:58:52Z","author":[{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"title":"Denesting by bounded degree radicals","year":"1997","doi":"10.1007/3-540-63397-9_5","citation":{"ieee":"J. Blömer, “Denesting by bounded degree radicals,” in <i>Algorithms — ESA ’97</i>, Berlin, Heidelberg: Springer Berlin Heidelberg, 1997, pp. 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>","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} }","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>.","short":"J. Blömer, in: Algorithms — ESA ’97, Springer Berlin Heidelberg, 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>"},"file_date_updated":"2018-06-05T08:31:35Z","place":"Berlin, Heidelberg","has_accepted_license":"1","status":"public","user_id":"25078","ddc":["000"],"publisher":"Springer Berlin Heidelberg","_id":"3029","page":"53-63"},{"year":"1997","title":"The rank of sparse random matrices over finite fields","status":"public","author":[{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Karp","first_name":"Richard","full_name":"Karp, Richard"},{"full_name":"Welzl, Emo","first_name":"Emo","last_name":"Welzl"}],"date_updated":"2022-01-06T06:58:52Z","publication_status":"published","page":"407-419","_id":"3033","doi":"10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","user_id":"25078","publication":"Random Structures \\& Algorithms","issue":"4","citation":{"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>.","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} }","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.","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>","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>.","short":"J. Blömer, R. Karp, E. Welzl, Random Structures \\&#38; Algorithms (1997) 407–419."},"extern":"1","date_created":"2018-06-05T08:34:49Z","type":"journal_article","keyword":["random matrices","rank","finite fields"],"department":[{"_id":"64"}]},{"quality_controlled":"1","citation":{"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} }","ama":"Alt H, Behrends B, Blömer J. Approximate matching of polygonal shapes. <i>Annals of Mathematics and Artificial Intelligence</i>. 1995;13(3).","short":"H. Alt, B. Behrends, J. Blömer, Annals of Mathematics and Artificial Intelligence 13 (1995).","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.","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).","mla":"Alt, Helmut, et al. “Approximate Matching of Polygonal Shapes.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 13, no. 3, 1995."},"status":"public","user_id":"25078","volume":13,"_id":"3037","extern":"1","abstract":[{"lang":"eng","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."}],"issue":"3","publication":"Annals of Mathematics and Artificial Intelligence","type":"journal_article","department":[{"_id":"64"}],"date_created":"2018-06-05T08:38:41Z","publication_status":"published","date_updated":"2022-01-06T06:58:53Z","intvolume":"        13","title":"Approximate matching of polygonal shapes","year":"1995","author":[{"full_name":"Alt, Helmut","first_name":"Helmut","last_name":"Alt"},{"first_name":"Bernd","last_name":"Behrends","full_name":"Behrends, Bernd"},{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"publication_identifier":{"issn":["1573-7470"]},"language":[{"iso":"eng"}]},{"_id":"3038","series_title":"Technical Report, International Computer Science Institute","user_id":"25078","ddc":["000"],"author":[{"id":"23","full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"},{"full_name":"Kalfane, Malik","last_name":"Kalfane","first_name":"Malik"},{"full_name":"Karp, Richard","last_name":"Karp","first_name":"Richard"},{"first_name":"Marek","last_name":"Karpinski","full_name":"Karpinski, Marek"},{"last_name":"Luby","first_name":"Michael","full_name":"Luby, Michael"},{"full_name":"Zuckerman, David","last_name":"Zuckerman","first_name":"David"}],"title":"An XOR-based erasure-resilient coding scheme","status":"public","year":"1995","has_accepted_license":"1","date_updated":"2022-01-06T06:58:53Z","date_created":"2018-06-05T08:40:26Z","place":"Berkeley, USA","file":[{"date_created":"2018-06-05T08:42:49Z","creator":"feidens","file_id":"3039","content_type":"application/pdf","success":1,"file_name":"erasure.pdf","file_size":261338,"access_level":"closed","relation":"main_file","date_updated":"2018-06-05T08:42:49Z"}],"department":[{"_id":"64"}],"type":"report","citation":{"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.","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} }","mla":"Blömer, Johannes, et al. <i>An XOR-Based Erasure-Resilient Coding Scheme</i>. 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.","short":"J. Blömer, M. Kalfane, R. Karp, M. Karpinski, M. Luby, D. Zuckerman, An XOR-Based Erasure-Resilient Coding Scheme, Berkeley, USA, 1995.","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.","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."},"file_date_updated":"2018-06-05T08:42:49Z","extern":"1"},{"extern":"1","citation":{"apa":"Blömer, J. (1993). <i>On Kummer theory and the number of roots of unity in radical extensions of Q</i>. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik.","ieee":"J. Blömer, <i>On Kummer theory and the number of roots of unity in radical extensions of Q</i>. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.","chicago":"Blömer, Johannes. <i>On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q</i>. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.","short":"J. Blömer, On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q, Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.","mla":"Blömer, Johannes. <i>On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q</i>. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1993.","ama":"Blömer J. <i>On Kummer Theory and the Number of Roots of Unity in Radical Extensions of Q</i>. Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik; 1993.","bibtex":"@book{Blömer_1993, title={On Kummer theory and the number of roots of unity in radical extensions of Q}, publisher={Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik}, author={Blömer, Johannes}, year={1993} }"},"department":[{"_id":"64"}],"type":"report","date_created":"2018-06-05T08:48:42Z","date_updated":"2022-01-06T06:58:54Z","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes"}],"title":"On Kummer theory and the number of roots of unity in radical extensions of Q","year":"1993","status":"public","user_id":"25078","_id":"3045","publisher":"Technical Report, Freie Universität Berlin, Fachbereich Mathematik und Informatik"},{"citation":{"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} }","chicago":"Blömer, Johannes. <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992.","ama":"Blömer J. <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.","ieee":"J. Blömer, <i>Simplifying Expressions Involving Radicals</i>. 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.","mla":"Blömer, Johannes. <i>Simplifying Expressions Involving Radicals</i>. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik, 1992."},"file_date_updated":"2018-06-05T08:47:26Z","extern":"1","date_created":"2018-06-05T08:46:51Z","file":[{"date_created":"2018-06-05T08:47:26Z","creator":"feidens","file_id":"3044","content_type":"application/pdf","success":1,"file_name":"JohannesThesisAbstract.pdf","file_size":40741,"access_level":"closed","relation":"main_file","date_updated":"2018-06-05T08:47:26Z"}],"department":[{"_id":"64"}],"type":"dissertation","author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"year":"1992","title":"Simplifying Expressions Involving Radicals","status":"public","has_accepted_license":"1","date_updated":"2022-01-06T06:58:54Z","publication_status":"published","_id":"3043","publisher":"PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik","ddc":["000"],"user_id":"25078"},{"publication_status":"published","date_updated":"2022-01-06T06:58:54Z","year":"1992","title":"Resemblance and symmetries of geometric patterns","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540554882","9783540471035"]},"author":[{"full_name":"Alt, Helmut","first_name":"Helmut","last_name":"Alt"},{"id":"23","full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer"}],"user_id":"25078","doi":"10.1007/3-540-55488-2_19","page":"1-24","_id":"3046","publisher":"Springer Berlin Heidelberg","publication":"Data structures and efficient algorithms","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} }","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>","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>.","short":"H. Alt, J. Blömer, in: Data Structures and Efficient Algorithms, Springer Berlin Heidelberg, 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>.","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.","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>"},"type":"book_chapter","department":[{"_id":"64"}],"date_created":"2018-06-05T08:51:15Z","place":"Berlin, Heidelberg"},{"extern":"1","publication":"Proceedings., 33rd Annual Symposium on Foundations of Computer Science","citation":{"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} }","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>","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>.","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.","ieee":"J. Blömer, “How to denest Ramanujan’s nested radicals,” in <i>Proceedings., 33rd Annual Symposium on Foundations of Computer Science</i>, 1992.","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>"},"type":"conference","department":[{"_id":"64"}],"date_created":"2018-06-05T08:52:51Z","publication_status":"published","date_updated":"2022-01-06T06:58:54Z","status":"public","year":"1992","title":"How to denest Ramanujan's nested radicals","author":[{"full_name":"Blömer, Johannes","last_name":"Blömer","first_name":"Johannes","id":"23"}],"publication_identifier":{"isbn":["0818629002"]},"user_id":"25078","doi":"10.1109/sfcs.1992.267807","_id":"3047","publisher":"IEEE"},{"user_id":"25078","doi":"10.1145/109648.109669","_id":"3048","publisher":"ACM Press","publication_status":"published","date_updated":"2022-01-06T06:58:54Z","publication_identifier":{"isbn":["0897914260"]},"author":[{"last_name":"Alt","first_name":"Helmut","full_name":"Alt, Helmut"},{"full_name":"Behrends, Bernd","last_name":"Behrends","first_name":"Bernd"},{"id":"23","first_name":"Johannes","last_name":"Blömer","full_name":"Blömer, Johannes"}],"year":"1991","title":"Approximate matching of polygonal shapes (extended abstract)","status":"public","department":[{"_id":"64"}],"type":"conference","date_created":"2018-06-05T08:54:37Z","extern":"1","citation":{"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.","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>","short":"H. Alt, B. Behrends, J. Blömer, in: Proceedings of the Seventh Annual Symposium on Computational Geometry  - SCG ’91, ACM Press, 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>.","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} }","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>"},"publication":"Proceedings of the seventh annual symposium on Computational geometry  - SCG '91"},{"extern":"1","publication":"Proceedings 32nd Annual Symposium of Foundations of Computer Science","citation":{"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>","ieee":"J. Blömer, “Computing sums of radicals in polynomial time,” in <i>Proceedings 32nd Annual Symposium of Foundations of Computer Science</i>, 1991.","short":"J. Blömer, in: Proceedings 32nd Annual Symposium of Foundations of Computer Science, IEEE Comput. Soc. Press, 1991.","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>.","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>.","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>","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} }"},"type":"conference","department":[{"_id":"64"}],"date_created":"2018-06-05T08:56:01Z","date_updated":"2022-01-06T06:58:54Z","publication_status":"published","title":"Computing sums of radicals in polynomial time","year":"1991","status":"public","publication_identifier":{"isbn":["0818624450"]},"author":[{"full_name":"Blömer, Johannes","first_name":"Johannes","last_name":"Blömer","id":"23"}],"doi":"10.1109/sfcs.1991.185434","user_id":"25078","_id":"3049","publisher":"IEEE Comput. Soc. Press"},{"user_id":"14955","doi":"10.1007/bfb0032068","publisher":"Springer-Verlag","_id":"3050","language":[{"iso":"eng"}],"page":"703-716","publication_status":"published","date_updated":"2022-01-06T06:58:54Z","publication_identifier":{"isbn":["3540528261"]},"author":[{"full_name":"Alt, Helmut","last_name":"Alt","first_name":"Helmut"},{"last_name":"Blömer","first_name":"Johannes","full_name":"Blömer, Johannes","id":"23"},{"last_name":"Wagener","first_name":"Hubert","full_name":"Wagener, Hubert"}],"title":"Approximation of convex polygons","status":"public","year":"1990","department":[{"_id":"64"},{"_id":"63"}],"type":"book_chapter","date_created":"2018-06-05T08:56:43Z","place":"Berlin/Heidelberg","extern":"1","citation":{"short":"H. Alt, J. Blömer, H. Wagener, in: Automata, Languages and Programming, Springer-Verlag, Berlin/Heidelberg, 1990, pp. 703–716.","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.","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>","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} }","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>","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>."},"publication":"Automata, Languages and Programming"}]