K. Meer and M. Ziegler, “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation,” in Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.

B. Monien and R. Preis, “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs,” in Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.

S. Böttcher and R. Steinmetz, “Evaluating XPath Queries on XML Data Streams,” in Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, 2007, pp. 101–113.

S. Böttcher and R. Steinmetz, “Data Management for Mobile Ajax Web 2.0 Applications,” in Database and Expert Systems Applications, 18th International Conference, DEXA 2007, 2007, pp. 424–433.

S. Rührup and C. Schindelhauer, “Online Multi-path Routing in a Maze,” in Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.

J. Kutyowski and F. Zagórski, “Reliable Broadcasting Without Collision Detection,”10.1007/11611257_37__2006, doi:10.1007/11611257_37 .

J. Blömer and V. Krummel, “Fault Based Collision Attacks on AES,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 106–120.

J. Blömer and M. Otto, “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 13–23.

J. Blömer, M. Otto, and J.-P. Seifert, “Sign Change Fault Attacks on Elliptic Curve Cryptosystems,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 36–52.

M. Dynia, M. Korzeniowski, and C. Schindelhauer, “Power-Aware Collective Tree Exploration,” in Architecture of Computing Systems - ARCS, 2006, no. 3894, pp. 341--351.

K. Meer and M. Ziegler, “Uncomputability Below the Real Halting Problem,” in Logical Approaches to Computational Barriers, Berlin, Heidelberg, 2006.

E. D. Demaine, F. Meyer auf der Heide, R. Pagh, and M. Petrafcu, “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space),” in LATIN 2006: Theoretical Informatics, Berlin, Heidelberg, 2006.

M. Dynia, J. Kutyowski, F. Meyer auf der Heide, and C. Schindelhauer, “Smart Robot Teams Exploring Sparse Trees,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2006.

S. Böttcher and R. Steinmetz, “DTD-Driven Structure Preserving XML Compression,” in Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 2006, pp. 266–269.

S. Böttcher and R. Steinmetz, “Information Disclosure by XPath Queries,” in Secure Data Management, Third VLDB Workshop, SDM 2006, 2006, pp. 160–174.

É. Fouvry and J. Klüners, “Cohen–Lenstra Heuristics of Quadratic Number Fields,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.

W. Geiselmann, F. Januszewski, H. Köpfer, J. Pelzl, and R. Steinwandt, “A Simpler Sieving Device: Combining ECM and TWIRL,” in Information Security and Cryptology – ICISC 2006, Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.

S. Rührup, C. Schindelhauer, and K. Volbert, “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks,” in Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), 2005, vol. 3738, pp. 244–257.

C. Schindelhauer and K. Voß, “Probability Distributions for Channel Utilisation,” in Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 2005, pp. 271–284.

C. Loeser, G. Schomaker, A. Brinkmann, M. Vodisek, and M. Heidebuer, “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts,” in Proceedings of the 4th International Conference on Networking, 2005, vol. 3421, pp. 800–810.