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