The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
M. Bienkowski, J. Kutyowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.

Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
M. Dynia, M. Korzeniowski, J. Kutyowski, in: Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 2007, pp. 260--271.

(Short) Survey of Real Hypercomputation
M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.

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

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

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

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

Reliable Broadcasting Without Collision Detection
J. Kutyowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.

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

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

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

Power-Aware Collective Tree Exploration
M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.

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

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

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

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

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

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

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

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