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, Christian. Implementierung eines arithmetischen Kodierers in Java, 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47634
Ziegler, Max. Fehlerangriffe Auf Spezielle Implementierungen von RSA, 2003.
LibreCat
2003 | Bachelorsthesis | LibreCat-ID: 47639
Lindner, Marvin. Verkürzte Huffman-Codierung zur Codekompression, 2003.
LibreCat
2003 | Misc | LibreCat-ID: 47695 | 
Ackermann, Marcel R. Tabellenbasierte arithmetische Kodierung bei allgemeinen Alphabeten, 2003.
LibreCat
| Files available
2002 | Journal Article | LibreCat-ID: 3034
Albanese, Andres, Johannes Blömer, Jeff Edmonds, Michael Luby, and Madhu Sudan. “Priority Encoding Transmission.” IEEE Transactions on Information Theory 42, no. 6 (2002): 1737–44. https://doi.org/10.1109/18.556670.
LibreCat
| Files available
| DOI
2002 | Conference Paper | LibreCat-ID: 3040
Albanese, A., Johannes Blömer, J. Edmonds, M. Luby, and M. Sudan. “Priority Encoding Transmission.” In Proceedings 35th Annual Symposium on Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1994.365731.
LibreCat
| DOI
2002 | Conference Paper | LibreCat-ID: 3041
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 2002. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| Files available
| DOI
2002 | Journal Article | LibreCat-ID: 35857
Blömer, J. “Denesting by Bounded Degree Radicals.” Algorithmica 28, no. 1 (2002): 2–15. https://doi.org/10.1007/s004530010028.
LibreCat
| DOI
2002 | Misc | LibreCat-ID: 47698 |
Fricke, Birgitta. Construction of Pseudorandom Functions, 2002.
LibreCat
| Files available
2002 | Misc | LibreCat-ID: 47697
Deveci, Deniz. Evaluierung und Implementierung eines vollständig verteilten RSA-Kryptographiesystems, 2002.
LibreCat
2002 | Misc | LibreCat-ID: 47699
Helbich, Anke. The Weil-Pairing and Signature Schemes in Elliptic Curve Cryptography, 2002.
LibreCat
2002 | Misc | LibreCat-ID: 47700
Schepers, Daniel. Timing Attacks for Cryptosystems Based on Elliptic Curves, 2002.
LibreCat
2002 | Bachelorsthesis | LibreCat-ID: 47633 |
Hoppe, Ulrich. Implementierung und Evaluation eines MDS-Blockcodes mit unabhängigen Paritätssymbolen, 2002.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47701 |
Krummel, Volker. Sicherheit Und Anwendungen Des Advanced Encryption Standard (AES) Rijndael, 2001.
LibreCat
| Files available
2001 | Misc | LibreCat-ID: 47702 |
Otto, Martin. Brauer Addition-Subtraction Chains, 2001.
LibreCat
| Files available
2000 | Book Chapter | LibreCat-ID: 3023
Blömer, Johannes. “Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices.” In Automata, Languages and Programming, 248–59. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. https://doi.org/10.1007/3-540-45022-x_22.
LibreCat
| DOI
1999 | Conference Paper | LibreCat-ID: 3024
Blömer, Johannes, and Jean-Pierre Seifert. “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. https://doi.org/10.1145/301250.301441.
LibreCat
| Files available
| DOI
1998 | Journal Article | LibreCat-ID: 3028
Blömer, Johannes, and Beat Trachsler. “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, Johannes. “Denesting by Bounded Degree Radicals.” In Algorithms — ESA ’97, 53–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1997. https://doi.org/10.1007/3-540-63397-9_5.
LibreCat
| Files available
| DOI
1997 | Journal Article | LibreCat-ID: 3033
Blömer, Johannes, Richard Karp, and Emo Welzl. “The Rank of Sparse Random Matrices over Finite Fields.” Random Structures \& Algorithms, no. 4 (1997): 407–19. 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, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes.” Annals of Mathematics and Artificial Intelligence 13, no. 3 (1995).
LibreCat
1995 | Report | LibreCat-ID: 3038
Blömer, Johannes, Malik Kalfane, Richard Karp, Marek Karpinski, Michael Luby, and David Zuckerman. An XOR-Based Erasure-Resilient Coding Scheme. Technical Report, International Computer Science Institute. Berkeley, USA, 1995.
LibreCat
| Files available
1993 | Report | LibreCat-ID: 3045
Blömer, Johannes. 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, Johannes. 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, Helmut, and Johannes Blömer. “Resemblance and Symmetries of Geometric Patterns.” In Data Structures and Efficient Algorithms, 1–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. https://doi.org/10.1007/3-540-55488-2_19.
LibreCat
| DOI
1992 | Conference Paper | LibreCat-ID: 3047
Blömer, Johannes. “How to Denest Ramanujan’s Nested Radicals.” In Proceedings., 33rd Annual Symposium on Foundations of Computer Science. IEEE, 1992. https://doi.org/10.1109/sfcs.1992.267807.
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3048
Alt, Helmut, Bernd Behrends, and Johannes Blömer. “Approximate Matching of Polygonal Shapes (Extended Abstract).” In Proceedings of the Seventh Annual Symposium on Computational Geometry - SCG ’91. ACM Press, 1991. https://doi.org/10.1145/109648.109669.
LibreCat
| DOI
1991 | Conference Paper | LibreCat-ID: 3049
Blömer, Johannes. “Computing Sums of Radicals in Polynomial Time.” In Proceedings 32nd Annual Symposium of Foundations of Computer Science. IEEE Comput. Soc. Press, 1991. https://doi.org/10.1109/sfcs.1991.185434.
LibreCat
| DOI
1990 | Book Chapter | LibreCat-ID: 3050
Alt, Helmut, Johannes Blömer, and Hubert Wagener. “Approximation of Convex Polygons.” In Automata, Languages and Programming, 703–16. Berlin/Heidelberg: Springer-Verlag, 1990. https://doi.org/10.1007/bfb0032068.
LibreCat
| DOI
- 1
- 2
- 3
- 4
- 5 (current)