A Generalized Wiener Attack on RSA
J. Blömer, A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 1–13.

Secret Exponent Attacks on RSA-type Schemes with Moduli N=p^rq
A. May, in: Public Key Cryptography – PKC 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 218–230.

Computing the RSA Secret Key Is Deterministic Polynomial Time Equivalent to Factoring
A. May, in: Advances in Cryptology – CRYPTO 2004, Springer Berlin Heidelberg, Berlin, Heidelberg, 2004, pp. 213–219.

Extreme Points Under Random Noise
V. Damerow, C. Sohler, in: Proceedings of the 12th European Symposium on Algorithms (ESA’04), Berlin, Heidelberg, 2004.

Fast Multipoint Evaluation of Bivariate Polynomials
M. Nüsken, M. Ziegler, in: Proc. 12th Annual Symposium on Algorithms (ESA’04), Springer, Berlin, Heidelberg, 2004, pp. 544–555.

Spanners, Weak Spanners, and Power Spanners for Wireless Networks
C. Schindelhauer, K. Volbert, M. Ziegler, in: Proc. of 15th Annual International Symposium on Algorithms and Computation (ISAAC’04), Springer , Berlin, Heidelberg, 2004, pp. 805–821.

Labeling Smart Dust
V. Bansal, F. Meyer auf der Heide, C. Sohler, in: 12th Annual European Symposium on Algorithms (ESA 2004), Berlin, Heidelberg, 2004.

A Runtime Environment for Reconfigurable Hardware Operating Systems
H. Walder, M. Platzner, in: Proceedings of the 14th International Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin, Heidelberg, 2004, pp. 831–835.

Algorithmic Approaches for Storage Networks
K.A. Salzwedel, Algorithms for Memory Hierarchies 2625 (2003).

New Partial Key Exposure Attacks on RSA
J. Blömer, A. May, in: Advances in Cryptology - CRYPTO 2003, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 27–43.

Fault Based Cryptanalysis of the Advanced Encryption Standard (AES)
J. Blömer, J.-P. Seifert, in: Financial Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2003, pp. 162–181.

Quasi-optimal Arithmetic for Quaternion Polynomials
M. Ziegler, in: Proc. 14th Annual International Symposium on Algorithms and Computation (ISAAC’03), 2003, pp. 705–715.

Fast Relative Approximation of Potential Fields
M. Ziegler, in: F. Dehne, J. Sack, M. Smid, Algorithms and Data Structures. WADS 2003 (Eds.), Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 2003.

Congestion and Almost Invariant Sets in Dynamical Systems
M. Dellnitz, R. Preis, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.

A New Data Structure for the Nondominance Problem in Multi-objective Optimization
O. Schütze, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.

Covering Pareto Sets by Multilevel Evolutionary Subdivision Techniques
O. Schütze, S. Mostaghim, M. Dellnitz, J. Teich, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2003.

Testing Containment of XPath Expressions in Order to Reduce the Data Transfer to Mobile Clients
S. Böttcher, R. Steinmetz, in: Advances in Databases and Information Systems, 7th East European Conference, ADBIS 2003, Springer, 2003, pp. 400–410.

A DTD Graph Based XPath Query Subsumption Test
S. Böttcher, R. Steinmetz, in: Database and XML Technologies, First International XML Database Symposium, XSym 2003, Berlin, Heidelberg, 2003, pp. 85–99.

Heuristics for Online Scheduling Real-Time Tasks to Partially Reconfigurable Devices
C. Steiger, H. Walder, M. Platzner, in: Proceedings of the 13th International Conference on Field Programmable Logic and Applications (FPL), Springer, Berlin, Heidelberg, 2003, pp. 575–584.

Any Load-Balancing Regimen for Evolving Tree Computations on Circulant Graphs Is Asymptotically Optimal
R. Wanka, in: Proc. Workshop on Graph-Theoretic Concepts in Computer Science (WG), Berlin, Heidelberg, 2002, pp. 413–420.