Kutyowski, Jarosaw, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.”10.1007/11611257_37__SOFSEM 2006: Theory and Practice of Computer Science, 2006, doi:10.1007/11611257_37.

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”10.1007/11889700_11__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 106–20, doi:10.1007/11889700_11.

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”10.1007/11889700_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 13–23, doi:10.1007/11889700_2.

Blömer, Johannes, et al. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”10.1007/11889700_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 36–52, doi:10.1007/11889700_4.

Dynia, Miroslaw, et al. “Power-Aware Collective Tree Exploration.”10.1007/11682127_24__Architecture of Computing Systems - ARCS, no. 3894, 2006, pp. 341--351, doi:10.1007/11682127_24.

Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.”10.1007/11780342_39__Logical Approaches to Computational Barriers, 2006, doi:10.1007/11780342_39.

Demaine, Erik D., et al. “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).”10.1007/11682462_34__LATIN 2006: Theoretical Informatics, 2006, doi:10.1007/11682462_34.

Dynia, M., et al. “Smart Robot Teams Exploring Sparse Trees.”10.1007/11821069_29__Lecture Notes in Computer Science, 2006, doi:10.1007/11821069_29.

Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.”10.1007/11788911_27__Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 2006, pp. 266–69, doi:10.1007/11788911_27.

Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.”10.1007/11844662_12__Secure Data Management, Third VLDB Workshop, SDM 2006, Springer, 2006, pp. 160–74, doi:10.1007/11844662_12.

Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.”10.1007/11792086_4__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, doi:10.1007/11792086_4.

Geiselmann, Willi, et al. “A Simpler Sieving Device: Combining ECM and TWIRL.”10.1007/11927587_12__Information Security and Cryptology – ICISC 2006, Springer Berlin Heidelberg, 2006, doi:10.1007/11927587_12.

Rührup, Stefan, et al. “Performance Analysis of the Hierarchical Layer Graph for Wireless Networks.”10.1007/11561354_21__Proc. of 4th International Conference on Ad-Hoc, Mobile &; Wireless Networks (ADHOC-NOW 2005), vol. 3738, 2005, pp. 244–57, doi:10.1007/11561354_21.

Schindelhauer, Christian, and Kerstin Voß. “Probability Distributions for Channel Utilisation.”10.1007/11561354_23__Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005), 2005, pp. 271–84, doi:10.1007/11561354_23.

Loeser, Chris, et al. “Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts.”10.1007/978-3-540-31957-3_90__Proceedings of the 4th International Conference on Networking, vol. 3421, 2005, pp. 800–10, doi:10.1007/978-3-540-31957-3_90.

Blömer, Johannes, and Alexander May. “A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers.”10.1007/11426639_15__EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 251–67, doi:10.1007/11426639_15.

Ernst, Matthias, et al. “Partial Key Exposure Attacks on RSA up to Full Size Exponents.”10.1007/11426639_22__EUROCRYPT 2005, Springer Berlin Heidelberg, 2005, pp. 371–86, doi:10.1007/11426639_22.

Rührup, Stefan, and Christian Schindelhauer. “Online Routing in Faulty Meshes with Sub-Linear Comparative Time and Traffic Ratio.”10.1007/11561071_5__Algorithms – ESA 2005, 2005, doi:10.1007/11561071_5.

Bdoiu, Mihai, et al. “Facility Location in Sublinear Time.”10.1007/11523468_70__Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP), 2005, pp. 866–77, doi:10.1007/11523468_70.

Frahling, Gereon, and Jens Krokowski. “Online Occlusion Culling.”10.1007/11561071_67__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer, 2005, pp. 758–69, doi:10.1007/11561071_67.