Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
229 Publications
2003 | Bachelorsthesis | LibreCat-ID: 47637
Todtenbier, C. (2003). Implementierung eines arithmetischen Kodierers in Java.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47634
Ziegler, M. (2003). Fehlerangriffe auf spezielle Implementierungen von RSA.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47639
Lindner, M. (2003). Verkürzte Huffman-Codierung zur Codekompression.
LibreCat
2003 | Misc | LibreCat-ID: 47695 | 
Ackermann, M. R. (2003). Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 3034
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. IEEE Transactions on Information Theory, 42(6), 1737–1744. https://doi.org/10.1109/18.556670
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Blömer, J., Edmonds, J., Luby, M., & Sudan, M. (2002). Priority encoding transmission. In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1994.365731
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, J. (2002). Computing sums of radicals in polynomial time. [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. https://doi.org/10.1109/sfcs.1991.185434
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
Blömer, J. (2002). Denesting by Bounded Degree Radicals. Algorithmica, 28(1), 2–15. https://doi.org/10.1007/s004530010028
LibreCat
| DOI
2002 | Misc | LibreCat-ID: 47698 |
Fricke, B. (2002). Construction of Pseudorandom Functions.
LibreCat
| Files available
2002 | Misc | LibreCat-ID: 47697
Deveci, D. (2002). Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems.
LibreCat
2002 | Misc | LibreCat-ID: 47699
Helbich, A. (2002). The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography.
LibreCat
2002 | Misc | LibreCat-ID: 47700
Schepers, D. (2002). Timing Attacks for Cryptosystems based on Elliptic Curves.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 |
Hoppe, U. (2002). Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
Krummel, V. (2001). Sicherheit und Anwendungen des Advanced Encryption Standard (AES) Rijndael.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
Otto, M. (2001). Brauer Addition-Subtraction Chains.
LibreCat
| Files available
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, J. (2000). Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices. In Automata, Languages and Programming (pp. 248–259). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-45022-x_22
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, J., & Seifert, J.-P. (1999). On the complexity of computing short linearly independent vectors and short bases in a lattice. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing - STOC ’99. https://doi.org/10.1145/301250.301441
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
Blömer, J., & Trachsler, B. (1998). A lower bound for a class of graph based loss resilient codes. Technical Report/Departement of Computer Science, ETH Zürich.
LibreCat
| Files available
1997 | Book Chapter | LibreCat-ID: 3029
Blömer, J. (1997). Denesting by bounded degree radicals. In Algorithms — ESA ’97 (pp. 53–63). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-63397-9_5
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, J., Karp, R., & Welzl, E. (1997). The rank of sparse random matrices over finite fields. Random Structures \& Algorithms, (4), 407–419. https://doi.org/10.1002/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y
LibreCat
| DOI
1995 | Journal Article | LibreCat-ID: 3037
Alt, H., Behrends, B., & Blömer, J. (1995). Approximate matching of polygonal shapes. Annals of Mathematics and Artificial Intelligence, 13(3).
LibreCat
1995 | Report | LibreCat-ID: 3038
Blömer, J., Kalfane, M., Karp, R., Karpinski, M., Luby, M., & Zuckerman, D. (1995). An XOR-based erasure-resilient coding scheme. Berkeley, USA.
LibreCat
| Files available
1993 | Report | LibreCat-ID: 3045
Blömer, J. (1993). 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.
LibreCat
1992 | Dissertation | LibreCat-ID: 3043
Blömer, J. (1992). Simplifying Expressions Involving Radicals. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik und Informatik.
LibreCat
| Files available
1992 | Book Chapter | LibreCat-ID: 3046
Alt, H., & Blömer, J. (1992). Resemblance and symmetries of geometric patterns. In Data structures and efficient algorithms (pp. 1–24). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55488-2_19
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, J. (1992). How to denest Ramanujan’s nested radicals. In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/sfcs.1992.267807
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3048
Alt, H., Behrends, B., & Blömer, J. (1991). Approximate matching of polygonal shapes (extended abstract). In Proceedings of the seventh annual symposium on Computational geometry - SCG ’91. ACM Press. https://doi.org/10.1145/109648.109669
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer, J. (1991). Computing sums of radicals in polynomial time. In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press. https://doi.org/10.1109/sfcs.1991.185434
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt, H., Blömer, J., & Wagener, H. (1990). Approximation of convex polygons. In Automata, Languages and Programming (pp. 703–716). Berlin/Heidelberg: Springer-Verlag. https://doi.org/10.1007/bfb0032068
LibreCat
| DOI