V. Bansal, F. Meyer auf der Heide, and C. Sohler, “Labeling Smart Dust,” in 12th Annual European Symposium on Algorithms (ESA 2004), 2004, vol. 3221.

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

K. A. Salzwedel, “Algorithmic Approaches for Storage Networks,” Algorithms for Memory Hierarchies, vol. 2625, 2003.

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

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

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

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

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

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

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

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

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

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

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

M. Grünewald, T. Lukovszki, C. Schindelhauer, and K. Volbert, “Distributed Maintenance of Resource Efficient Wireless Network Topologies,”10.1007/3-540-45706-2_134__2002, doi:10.1007/3-540-45706-2_134 .

O. Hahn, M. Koyro, and G. Meschut, “Lipirea în combinatie cu îmbinarile obtinute prin deformare,” sudura, vol. 2, pp. 10–13, 2002.

M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, “Randomized Pursuit-Evasion in Graphs,” in Proceedings of the 29th International Colloquium on Automata, Languages and Programming, 2002.

F. Meyer auf der Heide, M. Kumar, S. Nikoletseas, and P. Spirakis, “Mobile Computing, Mobile Networks,” in Euro-Par 2002 Parallel Processing, Lecture Notes in Computer Science, vol 2400., Berlin, Heidelberg, 2002.

G. Meschut, “Hybridfügen – Grundlagen, Technologie, Anwendungen,” in DVM-Bericht 668, Berlin, 2001, vol. 668, pp. 119–134.

A. Czumaj and C. Sohler, “Testing Hypergraph Coloring,” Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP), pp. 493–505, 2001.