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