Hamann, H., Meyer, B., Schmickl, T., &; Crailsheim, K. (2010). A Model of Symmetry Breaking in Collective Decision-Making. In From Animals to Animats 11 (Vol. 6226, pp. 639–648). Springer.https://doi.org/10.1007/978-3-642-15193-4_60 

Grzablewicz, R., Kutyowski, J., Kutyowski, M., &; Pietkiewicz, W. (2010). Robust Undetectable Interference Watermarks. ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications.https://doi.org/10.1007/11424826_55 

Ackermann, M. R., &; Blömer, J. (2010). Bregman Clustering for Separable Instances. In SWAT 2010 (pp. 212–223). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-13731-0_21 

Seebach, H., Nafz, F., Holtmann, J., Meyer, J., Tichy, M., Reif, W., &; Schäfer, W. (2010). Designing Self-healing in Automotive Systems. In Lecture Notes in Computer Science.https://doi.org/10.1007/978-3-642-16576-4_4 

Briest, P., Chalermsook, P., Khanna, S., Laekhanukit, B., &; Nanongkai, D. (2010). Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. In Workshop on Internet and Network Economics (WINE).https://doi.org/10.1007/978-3-642-17572-5_37 

Eikel, B., Jähn, C., &; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In Advances in Visual Computing. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-17289-2_60 

Böttcher, S., Hartel, R., &; Messinger, C. (2010). Searchable Compression of Office Documents by XML Schema Subtraction. In Database and XML Technologies - 7th International XML Database Symposium, XSym 2010 (pp. 103–112). Springer.https://doi.org/10.1007/978-3-642-15684-7_9 

Degener, B., Kempkes, B., Kling, P., &; Meyer auf der Heide, F. (2010). A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In Structural Information and Communication Complexity (pp. 168–182). Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-13284-1_14 

Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &; Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-14162-1 

Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., &; Spirakis, P. G. (Eds.). (2010). Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-14165-2 

Trier, M., &; Müller, C. (2010). Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes. In Practical Aspects of Knowledge Management. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-30545-3_23 

Bonorden, O., Degener, B., Kempkes, B., &; Pietrzyk, P. (2009). Complexity and Approximation of a Geometric Local Robot Assignment Problem. In Algorithmic Aspects of Wireless Sensor Networks (pp. 252–262). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-05434-1_25 

Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science (pp. 300–301). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-04052-8_43 

Schrieb, J., Wehrheim, H., &; Wonisch, D. (2009). Three-Valued Spotlight Abstractions. In FM 2009: Formal Methods (pp. 106–122). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-05089-3_8 

Briest, P., Hoefer, M., Gualà, L., &; Ventre, C. (2009). On Stackelberg Pricing with Computationally Bounded Consumers. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-10841-9_6 

Biermann, T., Schwabe, A., &; Karl, H. (2009). Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In NETWORKING 2009 (pp. 883–894). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-01399-7_69 

Kakvi, S. (2009). Reinforcement Learning for Blackjack. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-04052-8_43 

Briest, P. (2008). Uniform Budgets and the Envy-Free Pricing Problem. In Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP).https://doi.org/10.1007/978-3-540-70575-8_66 

Degener, B., Gehweiler, J., &; Lammersen, C. (2008). The Kinetic Facility Location Problem. In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT) (pp. 378–389).https://doi.org/10.1007/978-3-540-69903-3_34 

Hamann, H., &; Wörn, H. (2008). Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem. In The tenth International Conference on Simulation of Adaptive Behavior (SAB’08) (Vol. 5040, pp. 447--456).https://doi.org/10.1007/978-3-540-69134-1_44 

Lürwer-Brüggemeier, K., &; Ziegler, M. (2008). On Faster Integer Calculations Using Non-arithmetic Primitives. In Unconventional Computing. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-85194-3_11 

Bienkowski, M., &; Kutyowski, J. (2007). The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces. Lecture Notes in Computer Science.https://doi.org/10.1007/978-3-540-73951-7_30 

May, A. (2007). Cryptanalysis of Unbalanced RSA with Small CRT-Exponent. In Advances in Cryptology — CRYPTO 2002 (pp. 242–256). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45708-9_16 

Blömer, J., &; May, A. (2007). Low Secret Exponent RSA Revisited. In Lecture Notes in Computer Science (pp. 4–19). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-44670-2_2 

Blömer, J., &; May, A. (2007). Key Revocation with Interval Cover Families. In Selected Areas in Cryptography (pp. 325–341). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-45537-x_26 

May, A., &; Silverman, J. H. (2007). Dimension Reduction Methods for Convolution Modular Lattices. In Lecture Notes in Computer Science (pp. 110–125). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-44670-2_10 

Blömer, J. (2007). A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers. In Algorithms — ESA’ 98 (pp. 151–162). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/3-540-68530-8_13 

Dynia, M., Korzeniowski, M., &; Kutyowski, J. (2007). 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) (Vol. 4362, pp. 260--271).https://doi.org/10.1007/978-3-540-69507-3_21 

Ziegler, M. (2007). (Short) Survey of Real Hypercomputation. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-73001-9_86 

Meer, K., &; Ziegler, M. (2007). Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation. In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-74456-6_64 

Monien, B., &; Preis, R. (2007). Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs. In Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg.https://doi.org/10.1007/3-540-44683-4_46 

Böttcher, S., &; Steinmetz, R. (2007). Evaluating XPath Queries on XML Data Streams. In Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24 (pp. 101–113). Springer.https://doi.org/10.1007/978-3-540-73390-4_10 

Böttcher, S., &; Steinmetz, R. (2007). Data Management for Mobile Ajax Web 2.0 Applications. In Database and Expert Systems Applications, 18th International Conference, DEXA 2007 (pp. 424–433). Springer.https://doi.org/10.1007/978-3-540-74469-6_42 

Rührup, S., &; Schindelhauer, C. (2006). Online Multi-path Routing in a Maze. In Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006).https://doi.org/10.1007/11940128_65 

Kutyowski, J., &; Zagórski, F. (2006). Reliable Broadcasting Without Collision Detection. SOFSEM 2006: Theory and Practice of Computer Science.https://doi.org/10.1007/11611257_37 

Blömer, J., &; Krummel, V. (2006). Fault Based Collision Attacks on AES. In Lecture Notes in Computer Science (pp. 106–120). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11889700_11 

Blömer, J., &; Otto, M. (2006). Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered. In Lecture Notes in Computer Science (pp. 13–23). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11889700_2 

Blömer, J., Otto, M., &; Seifert, J.-P. (2006). Sign Change Fault Attacks on Elliptic Curve Cryptosystems. In Lecture Notes in Computer Science (pp. 36–52). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11889700_4 

Dynia, M., Korzeniowski, M., &; Schindelhauer, C. (2006). Power-Aware Collective Tree Exploration. In Architecture of Computing Systems - ARCS (pp. 341--351).https://doi.org/10.1007/11682127_24 

Meer, K., &; Ziegler, M. (2006). Uncomputability Below the Real Halting Problem. In Logical Approaches to Computational Barriers. Berlin, Heidelberg.https://doi.org/10.1007/11780342_39 

Demaine, E. D., Meyer auf der Heide, F., Pagh, R., &; Petrafcu, M. (2006). De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space). In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg.https://doi.org/10.1007/11682462_34 

Dynia, M., Kutyowski, J., Meyer auf der Heide, F., &; Schindelhauer, C. (2006). Smart Robot Teams Exploring Sparse Trees. In Lecture Notes in Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/11821069_29 

Böttcher, S., &; Steinmetz, R. (2006). DTD-Driven Structure Preserving XML Compression. In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23 (pp. 266–269). Berlin, Heidelberg.https://doi.org/10.1007/11788911_27 

Böttcher, S., &; Steinmetz, R. (2006). Information Disclosure by XPath Queries. In Secure Data Management, Third VLDB Workshop, SDM 2006 (pp. 160–174). Springer.https://doi.org/10.1007/11844662_12 

Fouvry, É., &; Klüners, J. (2006). Cohen–Lenstra Heuristics of Quadratic Number Fields. In Lecture Notes in Computer Science. Springer Berlin Heidelberg.https://doi.org/10.1007/11792086_4 

Geiselmann, W., Januszewski, F., Köpfer, H., Pelzl, J., &; Steinwandt, R. (2006). A Simpler Sieving Device: Combining ECM and TWIRL. In Information Security and Cryptology – ICISC 2006. Springer Berlin Heidelberg.https://doi.org/10.1007/11927587_12 

Rührup, S., Schindelhauer, C., &; Volbert, K. (2005). 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) (Vol. 3738, pp. 244–257).https://doi.org/10.1007/11561354_21 

Schindelhauer, C., &; Voß, K. (2005). Probability Distributions for Channel Utilisation. In Proc. of 4th International Conference on Ad-Hoc Networks &; Wireless (ADHOC-NOW 2005) (pp. 271–284).https://doi.org/10.1007/11561354_23 

Loeser, C., Schomaker, G., Brinkmann, A., Vodisek, M., &; Heidebuer, M. (2005). Content Distribution in Heterogenous Video-on-Demand P Networks with ARIMA Forecasts. In Proceedings of the 4th International Conference on Networking (Vol. 3421, pp. 800–810). Berlin, Heidelberg.https://doi.org/10.1007/978-3-540-31957-3_90 

Blömer, J., &; May, A. (2005). A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In EUROCRYPT 2005 (pp. 251–267). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11426639_15