Wolters, D., Kirchhoff, J., Gerth, C., &; Engels, G. (2016). Cross-Device Integration of Android Apps. In Q. Z. Sheng, E. Stroulia, S. Tata, &; S. Bhiri (Eds.), Service-Oriented Computing (pp. 171–185). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-46295-0_11 

Fischer, H. G., &; Senft, B. (2016). Human-Centered Software Engineering as a Chance to Ensure Software Quality Within the Digitization of Human Workflows. In C. Bogdan (Ed.), Human-Centered and Error-Resilient Systems Development (Vol. 9856, pp. 30–41). Cham: Springer International Publishing.https://doi.org/10.1007/978-3-319-44902-9_3 

Blömer, J., &; Bujna, K. (2016). Adaptive Seeding for Gaussian Mixture Models. In Advances in Knowledge Discovery and Data Mining (pp. 296–308). Springer International Publishing.https://doi.org/10.1007/978-3-319-31750-2_24 

Blazy, O., Kakvi, S., Kiltz, E., &; Pan, J. (2015). Tightly-Secure Signatures from Chameleon Hash Functions. In Lecture Notes in Computer Science (pp. 256–279). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-662-46447-2_12 

Altmeier, C., Mainka, C., Somorovsky, J., &; Schwenk, J. (2015). AdIDoS – Adaptive and Intelligent Fully-Automatic Detection of Denial-of-Service Weaknesses in Web Services. In Data Privacy Management, and Security Assurance - 10th International Workshop, DPM 2015, and 4th International Workshop, QASA 2015. Cham.https://doi.org/10.1007/978-3-319-29883-2_5 

Jager, T., Schwenk, J., &; Somorovsky, J. (2015). Practical Invalid Curve Attacks on TLS-ECDH. In Computer Security -- ESORICS 2015. Cham.https://doi.org/10.1007/978-3-319-24174-6_21 

Böttcher, S., Hartel, R., Jacobs, T., &; Jeromin, M. (2015). ECST – Extended Context-Free Straight-Line Tree Grammars. In Data Science - 30th British International Conference on Databases, BICOD 2015 (pp. 186–198). Springer.https://doi.org/10.1007/978-3-319-20424-6_18 

Geierhos, M., Bäumer, F. S., Schulze, S., &; Klotz, C. (2015). Understanding the Patient 2.0. In Modeling and Using Context.https://doi.org/10.1007/978-3-319-25591-0_12 

Geierhos, M., Bäumer, F. S., Schulze, S., &; Klotz, C. (2015). Understanding the Patient 2.0. In Modeling and Using Context.https://doi.org/10.1007/978-3-319-25591-0_12 

Hamann, H., &; Valentini, G. (2014). Swarm in a Fly Bottle: Feedback-Based Analysis of Self-organizing Temporary Lock-ins. In Ninth Int. Conf. on Swarm Intelligence (ANTS 2014). Cham.https://doi.org/10.1007/978-3-319-09952-1_15 

Koch, T., Holtmann, J., &; DeAntoni, J. (2014). Generating EAST-ADL Event Chains from Scenario-Based Requirements Specifications. In Software Architecture. Cham.https://doi.org/10.1007/978-3-319-09970-5_14 

Bokermann, D., Gerth, C., &; Engels, G. (2014). Use Your Best Device! Enabling Device Changes at Runtime. In 12th International Conference on Business Process Management (BPM 2014) (Vol. 8659, pp. 357–365). Springer International Publishing.https://doi.org/10.1007/978-3-319-10172-9_23 

Flocchini, P., Gao, J., Kranakis, E., &; Meyer auf der Heide, F. (Eds.). (2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013 (Vol. 8243). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-45346-5 

Böttcher, S., Hartel, R., &; Rabe, J. (2014). Efficient XML Keyword Search Based on DAG-Compression. In Database and Expert Systems Applications - 25th International Conference, DEXA 2014 (pp. 122–137). Cham: Springer.https://doi.org/10.1007/978-3-319-10073-9_11 

Lukovszki, T., &; Meyer auf der Heide, F. (2014). Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer Science. Cham.https://doi.org/10.1007/978-3-319-14472-6_17 

Abshoff, S., &; Meyer auf der Heide, F. (2014). Continuous Aggregation in Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity. Cham.https://doi.org/10.1007/978-3-319-09620-9_16 

Fourné, M., Stegemann, K., Petersen, D., &; Pohlmann, N. (2014). Aggregation of Network Protocol Data Near Its Source. In Information and Communication Technology. Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-55032-4_49 

Blömer, J., Günther, P., &; Liske, G. (2013). Improved Side Channel Attacks on Pairing Based Cryptography. In Constructive Side-Channel Analysis and Secure Design (pp. 154–168). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-40026-1_10 

Klompmaker, F., Paelke, V., &; Fischer, H. G. (2013). A Taxonomy-Based Approach towards NUI Interaction Design. In Distributed, Ambient, and Pervasive Interactions (Vol. 8028, pp. 32–41). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-39351-8_4 

Fischer, H. G., Strenge, B., &; Nebe, K. (2013). Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design. In Design, User Experience, and Usability. Design Philosophy, Methods, and Tools (Vol. 8012, pp. 252–261). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-39229-0_28 

Place, T., van Rooijen, L., &; Zeitoun, M. (2013). Separating Regular Languages by Piecewise Testable and Unambiguous Languages. In Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013 (pp. 729–740). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-40313-2_64 

Böttcher, S., Hartel, R., &; Jacobs, T. (2013). Fast Multi-update Operations on Compressed XML Data. In Big Data - 29th British National Conference on Databases, BNCOD 2013, (pp. 149–164). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-39467-6_15 

Jähn, C., Eikel, B., Fischer, M., Petring, R., &; Meyer auf der Heide, F. (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In Advances in Visual Computing. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-41914-0_12 

Petring, R., Eikel, B., Jähn, C., Fischer, M., &; Meyer auf der Heide, F. (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual Computing. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-41914-0_44 

Hamann, H., Engelbrecht, A., Birattari, M., Dorigo, M., Blum, C., Stuetzle, T.,https://doi.org/10.1007/978-3-642-32650-9_15__Gross, R. (2012). Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions. In Swarm Intelligence: 8th International Conference, ANTS 2012 (Vol. 7461, pp. 168–179). Berlin, Heidelberg: Springer.https://doi.org/10.1007/978-3-642-32650-9_15 

Kakvi, S., Kiltz, E., &; May, A. (2012). Certifying RSA. In Advances in Cryptology – ASIACRYPT 2012 (pp. 404–414). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-34961-4_25 

Kakvi, S., &; Kiltz, E. (2012). Optimal Security Proofs for Full Domain Hash, Revisited. In Advances in Cryptology – EUROCRYPT 2012 (pp. 537–553). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-29011-4_32 

Kempkes, B., &; Meyer auf der Heide, F. (2012). Continuous Local Strategies for Robotic Formation Problems. In Experimental Algorithms. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-30850-5_2 

Kempkes, B., &; Meyer auf der Heide, F. (2012). Local, Self-organizing Strategies for Robotic Formation Problems. In Algorithms for Sensor Systems. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-28209-6_2 

Baier, R., &; Molo, M. H. (2012). Newton’s Method and Secant Method for Set-Valued Mappings. In Large-Scale Scientific Computing. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-29843-1_9 

Jager, T., Schinzel, S., &; Somorovsky, J. (2012). Bleichenbacher’s Attack Strikes again: Breaking PKCS .5 in XML Encryption. In Computer Security – ESORICS 2012. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-33167-1_43 

Suess, T., Koch, C., Jähn, C., Fischer, M., &; Meyer auf der Heide, F. (2012). Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. Advances in Visual Computing, 7431, 502–512.https://doi.org/10.1007/978-3-642-33179-4_48 

Hamann, H., Schmickl, T., &; Crailsheim, K. (2011). Evolving for Creativity: Maximizing Complexity in a Self-organized Multi-particle System. In 10th European Conference on Artificial Life (ECAL’09) (Vol. 5777, pp. 442--449).https://doi.org/10.1007/978-3-642-21283-3_55 

Lettmann, T., Baumann, M., Eberling, M., &; Kemmerich, T. (2011). Modeling Agents and Agent Systems. Transactions on Computational Collective Intelligence V, 157–181.https://doi.org/10.1007/978-3-642-24016-4_9 

Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A.,https://doi.org/10.1007/978-3-642-18381-2_15__Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-18381-2_15 

Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A.,https://doi.org/10.1007/978-3-642-22012-8_52__Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-22012-8_52 

Nebe, K., Klompmaker, F., Jung, H., &; Fischer, H. G. (2011). Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction. In J. A. Jacko (Ed.), Human-Computer Interaction. Interaction Techniques and Environments. (Vol. 6762, pp. 100–109). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-21605-3_11 

Fischer, H. G., Nebe, K., &; Klompmaker, F. (2011). A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities. In M. Kurosu (Ed.), Human Centered Design (Vol. 6776, pp. 28–37). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/978-3-642-21753-1_4 

Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A.,https://doi.org/10.1007/978-3-642-18381-2_15__Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011) (pp. 178–189). Springer.https://doi.org/10.1007/978-3-642-18381-2_15 

Brandes, P., Degener, B., Kempkes, B., &; Meyer auf der Heide, F. (2011). Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In Structural Information and Communication Complexity. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-22212-2_13 

Benter, M., Böttcher, S., &; Hartel, R. (2011). Mixing Bottom-Up and Top-Down XPath Query Evaluation. In East European Conference on Advances in Databases and Information Systems (pp. 27–41). Springer.https://doi.org/10.1007/978-3-642-23737-9_3 

Bätz, A., Böttcher, S., &; Hartel, R. (2011). Updates on Grammar-Compressed XML Data. In Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers (pp. 154–166). Springer.https://doi.org/10.1007/978-3-642-24577-0_17 

Böttcher, S., Hartel, R., &; Stey, S. (2011). TraCX: Transformation of Compressed XML. In Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers (pp. 182–193). Springer.https://doi.org/10.1007/978-3-642-24577-0_19 

Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A.,https://doi.org/10.1007/978-3-642-22012-8_52__Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.https://doi.org/10.1007/978-3-642-22012-8_52 

Mense, M., &; Schindelhauer, C. (2010). 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 (Vol. 5873, pp. 624--639).https://doi.org/10.1007/978-3-642-05118-0_43 

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 

Ernst, M., Jochemsz, E., May, A., &; de Weger, B. (2005). Partial Key Exposure Attacks on RSA up to Full Size Exponents. In EUROCRYPT 2005 (pp. 371–386). Berlin, Heidelberg: Springer Berlin Heidelberg.https://doi.org/10.1007/11426639_22 

Rührup, S., &; Schindelhauer, C. (2005). Online Routing in Faulty Meshes with Sub-linear Comparative Time and Traffic Ratio. In Algorithms – ESA 2005.https://doi.org/10.1007/11561071_5 

Bdoiu, M., Czumaj, A., Indyk, P., &; Sohler, C. (2005). Facility Location in Sublinear Time. In Proc. of the 32nd International Colloquium on Automata, Languages and Programming (ICALP) (pp. 866–877). Berlin, Heidelberg.https://doi.org/10.1007/11523468_70 

Frahling, G., &; Krokowski, J. (2005). Online Occlusion Culling. In Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005) (Vol. 3669, pp. 758–769). Berlin, Heidelberg: Springer.https://doi.org/10.1007/11561071_67 

Bienkowski, M., &; Korzeniowski, M. (2005). Dynamic Page Migration Under Brownian Motion. In Proc. of the European Conference in Parallel Processing (Euro-Par). Berlin, Heidelberg.https://doi.org/10.1007/11549468_105