T. Jager, S. Schinzel, and J. Somorovsky, “Bleichenbacher’s Attack Strikes again: Breaking PKCS .5 in XML Encryption,” in Computer Security – ESORICS 2012, Berlin, Heidelberg, 2012.

T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,”10.1007/978-3-642-33179-4_48__in Advances in Visual Computing, 2012, vol. 7431, pp. 502–512, doi:10.1007/978-3-642-33179-4_48 .

H. Hamann, T. Schmickl, and K. Crailsheim, “Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System,” in 10th European Conference on Artificial Life (ECAL’09), 2011, vol. 5777, pp. 442--449.

T. Lettmann, M. Baumann, M. Eberling, and T. Kemmerich, “Modeling Agents and Agent Systems,” Transactions on Computational Collective Intelligence V, pp. 157–181, 2011.

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in SOFSEM 2011: Theory and Practice of Computer Science, Berlin, Heidelberg, 2011.

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.

K. Nebe, F. Klompmaker, H. Jung, and H. G. Fischer, “Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction,” in Human-Computer Interaction. Interaction Techniques and Environments., vol. 6762, J. A. Jacko, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 100–109.

H. G. Fischer, K. Nebe, and F. Klompmaker, “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities,” in Human Centered Design, vol. 6776, M. Kurosu, Ed. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, pp. 28–37.

A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an Extent,” in 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.

P. Brandes, B. Degener, B. Kempkes, and F. Meyer auf der Heide, “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2011.

M. Benter, S. Böttcher, and R. Hartel, “Mixing Bottom-Up and Top-Down XPath Query Evaluation,” in East European Conference on Advances in Databases and Information Systems, 2011, pp. 27–41.

A. Bätz, S. Böttcher, and R. Hartel, “Updates on Grammar-Compressed XML Data,” in Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, 2011, pp. 154–166.

S. Böttcher, R. Hartel, and S. Stey, “TraCX: Transformation of Compressed XML,” in Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, 2011, pp. 182–193.

A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in Automata, Languages and Programming, Berlin, Heidelberg, 2011.

M. Mense and C. Schindelhauer, “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks,” in Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 2010, vol. 5873, pp. 624--639.

H. Hamann, B. Meyer, T. Schmickl, and K. Crailsheim, “A Model of Symmetry Breaking in Collective Decision-Making,” in From Animals to Animats 11, 2010, vol. 6226, pp. 639–648.

R. Grzablewicz, J. Kutyowski, M. Kutyowski, and W. Pietkiewicz, “Robust Undetectable Interference Watermarks,”10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 international conference on Computational Science and Its Applications, 2010, doi:10.1007/11424826_55 .

M. R. Ackermann and J. Blömer, “Bregman Clustering for Separable Instances,” in SWAT 2010, Berlin, Heidelberg: Springer Berlin Heidelberg, 2010, pp. 212–223.

H. Seebach et al., “Designing Self-healing in Automotive Systems,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2010.

P. Briest, P. Chalermsook, S. Khanna, B. Laekhanukit, and D. Nanongkai, “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing,” in Workshop on Internet and Network Economics (WINE), 2010.

B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin, Heidelberg, 2010.

S. Böttcher, R. Hartel, and C. Messinger, “Searchable Compression of Office Documents by XML Schema Subtraction,” in Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, 2010, pp. 103–112.

B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots,” in Structural Information and Communication Complexity, Berlin, Heidelberg, 2010, pp. 168–182.

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg, 2010.

S. Abramsky, C. Gavoille, C. Kirchner, F. Meyer auf der Heide, and P. G. Spirakis, Eds., Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg, 2010.

M. Trier and C. Müller, “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes,” in Practical Aspects of Knowledge Management, Berlin, Heidelberg, 2010.

O. Bonorden, B. Degener, B. Kempkes, and P. Pietrzyk, “Complexity and Approximation of a Geometric Local Robot Assignment Problem,” in Algorithmic Aspects of Wireless Sensor Networks, Berlin, Heidelberg: Springer, 2009, pp. 252–262.

S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 300–301.

J. Schrieb, H. Wehrheim, and D. Wonisch, “Three-Valued Spotlight Abstractions,” in FM 2009: Formal Methods, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 106–122.

P. Briest, M. Hoefer, L. Gualà, and C. Ventre, “On Stackelberg Pricing with Computationally Bounded Consumers,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.

T. Biermann, A. Schwabe, and H. Karl, “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE,” in NETWORKING 2009, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 883–894.

S. Kakvi, “Reinforcement Learning for Blackjack,” in Lecture Notes in Computer Science, Berlin, Heidelberg, 2009.

P. Briest, “Uniform Budgets and the Envy-Free Pricing Problem,” in Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008.

B. Degener, J. Gehweiler, and C. Lammersen, “The Kinetic Facility Location Problem,” in Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–389.

H. Hamann and H. Wörn, “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem,” in The tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, vol. 5040, pp. 447--456.

K. Lürwer-Brüggemeier and M. Ziegler, “On Faster Integer Calculations Using Non-arithmetic Primitives,” in Unconventional Computing, Berlin, Heidelberg, 2008.

M. Bienkowski and J. Kutyowski, “The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces,”10.1007/978-3-540-73951-7_30__2007, doi:10.1007/978-3-540-73951-7_30 .

A. May, “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent,” in Advances in Cryptology — CRYPTO 2002, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 242–256.

J. Blömer and A. May, “Low Secret Exponent RSA Revisited,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 4–19.

J. Blömer and A. May, “Key Revocation with Interval Cover Families,” in Selected Areas in Cryptography, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 325–341.

A. May and J. H. Silverman, “Dimension Reduction Methods for Convolution Modular Lattices,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 110–125.

J. Blömer, “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers,” in Algorithms — ESA’ 98, Berlin, Heidelberg: Springer Berlin Heidelberg, 2007, pp. 151–162.

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

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

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 .