Koch, Thorsten, et al. “Generating EAST-ADL Event Chains from Scenario-Based Requirements Specifications.”10.1007/978-3-319-09970-5_14__Software Architecture, 2014, doi:10.1007/978-3-319-09970-5_14.

Bokermann, Dennis, et al. “Use Your Best Device! Enabling Device Changes at Runtime.”10.1007/978-3-319-10172-9_23__12th International Conference on Business Process Management (BPM 2014), vol. 8659, Springer International Publishing, 2014, pp. 357–65, doi:10.1007/978-3-319-10172-9_23.

Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.

Böttcher, Stefan, et al. “Efficient XML Keyword Search Based on DAG-Compression.”10.1007/978-3-319-10073-9_11__Database and Expert Systems Applications - 25th International Conference, DEXA 2014, Springer, 2014, pp. 122–37, doi:10.1007/978-3-319-10073-9_11.

Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots.”10.1007/978-3-319-14472-6_17__Lecture Notes in Computer Science, 2014, doi:10.1007/978-3-319-14472-6_17.

Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation in Dynamic Ad-Hoc Networks.”10.1007/978-3-319-09620-9_16__Structural Information and Communication Complexity, 2014, doi:10.1007/978-3-319-09620-9_16.

Fourné, Marcel, et al. “Aggregation of Network Protocol Data Near Its Source.”10.1007/978-3-642-55032-4_49__Information and Communication Technology, Springer Berlin Heidelberg, 2014, doi:10.1007/978-3-642-55032-4_49.

Blömer, Johannes, et al. “Improved Side Channel Attacks on Pairing Based Cryptography.”10.1007/978-3-642-40026-1_10__Constructive Side-Channel Analysis and Secure Design, Springer Berlin Heidelberg, 2013, pp. 154–68, doi:10.1007/978-3-642-40026-1_10.

Klompmaker, Florian, et al. “A Taxonomy-Based Approach towards NUI Interaction Design.”10.1007/978-3-642-39351-8_4__Distributed, Ambient, and Pervasive Interactions, vol. 8028, Springer Berlin Heidelberg, 2013, pp. 32–41, doi:10.1007/978-3-642-39351-8_4.

Fischer, Holger Gerhard, et al. “Towards a Holistic Tool for the Selection and Validation of Usability Method Sets Supporting Human-Centered Design.”10.1007/978-3-642-39229-0_28__Design, User Experience, and Usability. Design Philosophy, Methods, and Tools, vol. 8012, Springer Berlin Heidelberg, 2013, pp. 252–61, doi:10.1007/978-3-642-39229-0_28.

Place, Thomas, et al. “Separating Regular Languages by Piecewise Testable and Unambiguous Languages.”10.1007/978-3-642-40313-2_64__Mathematical Foundations of Computer Science 2013 - 38th International Symposium, (MFCS) 2013, Klosterneuburg, Austria, August 26-30, 2013, Springer Berlin Heidelberg, 2013, pp. 729–40, doi:10.1007/978-3-642-40313-2_64.

Böttcher, Stefan, et al. “Fast Multi-Update Operations on Compressed XML Data.”10.1007/978-3-642-39467-6_15__Big Data - 29th British National Conference on Databases, BNCOD 2013, Springer, 2013, pp. 149–64, doi:10.1007/978-3-642-39467-6_15.

Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.”10.1007/978-3-642-41914-0_12__Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_12.

Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.”10.1007/978-3-642-41914-0_44__Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.

Hamann, Heiko, et al. “Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions.”10.1007/978-3-642-32650-9_15__Swarm Intelligence: 8th International Conference, ANTS 2012, vol. 7461, Springer, 2012, pp. 168–79, doi:10.1007/978-3-642-32650-9_15.

Kakvi, Saqib, et al. “Certifying RSA.”10.1007/978-3-642-34961-4_25__Advances in Cryptology – ASIACRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 404–14, doi:10.1007/978-3-642-34961-4_25.

Kakvi, Saqib, and Eike Kiltz. “Optimal Security Proofs for Full Domain Hash, Revisited.”10.1007/978-3-642-29011-4_32__Advances in Cryptology – EUROCRYPT 2012, Springer Berlin Heidelberg, 2012, pp. 537–53, doi:10.1007/978-3-642-29011-4_32.

Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Continuous Local Strategies for Robotic Formation Problems.”10.1007/978-3-642-30850-5_2__Experimental Algorithms, 2012, doi:10.1007/978-3-642-30850-5_2.

Kempkes, Barbara, and Friedhelm Meyer auf der Heide. “Local, Self-Organizing Strategies for Robotic Formation Problems.”10.1007/978-3-642-28209-6_2__Algorithms for Sensor Systems, 2012, doi:10.1007/978-3-642-28209-6_2.

Baier, Robert, and Mirko Hessel-von Molo. “Newton’s Method and Secant Method for Set-Valued Mappings.”10.1007/978-3-642-29843-1_9__Large-Scale Scientific Computing, 2012, doi:10.1007/978-3-642-29843-1_9.

Jager, Tibor, et al. “Bleichenbacher’s Attack Strikes Again: Breaking PKCS .5 in XML Encryption.”10.1007/978-3-642-33167-1_43__Computer Security – ESORICS 2012, 2012, doi:10.1007/978-3-642-33167-1_43.

Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.”10.1007/978-3-642-33179-4_48__Advances in Visual Computing, vol. 7431, 2012, pp. 502–12, doi:10.1007/978-3-642-33179-4_48.

Hamann, Heiko, et al. “Evolving for Creativity: Maximizing Complexity in a Self-Organized Multi-Particle System.”10.1007/978-3-642-21283-3_55__10th European Conference on Artificial Life (ECAL’09), vol. 5777, 2011, pp. 442--449, doi:10.1007/978-3-642-21283-3_55.

Lettmann, Theodor, et al. “Modeling Agents and Agent Systems.”10.1007/978-3-642-24016-4_9__Transactions on Computational Collective Intelligence V, Springer Berlin Heidelberg, 2011, pp. 157–81, doi:10.1007/978-3-642-24016-4_9.

Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”10.1007/978-3-642-18381-2_15__SOFSEM 2011: Theory and Practice of Computer Science, 2011, doi:10.1007/978-3-642-18381-2_15.

Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.”10.1007/978-3-642-22012-8_52__Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.

Nebe, Karsten, et al. “Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction.”10.1007/978-3-642-21605-3_11__Human-Computer Interaction. Interaction Techniques and Environments., edited by Julie Anne Jacko, vol. 6762, Springer Berlin Heidelberg, 2011, pp. 100–09, doi:10.1007/978-3-642-21605-3_11.

Fischer, Holger Gerhard, et al. “A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities.”10.1007/978-3-642-21753-1_4__Human Centered Design, edited by Masaaki Kurosu, vol. 6776, Springer Berlin Heidelberg, 2011, pp. 28–37, doi:10.1007/978-3-642-21753-1_4.

Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”10.1007/978-3-642-18381-2_15__37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15.

Brandes, Philipp, et al. “Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally.”10.1007/978-3-642-22212-2_13__Structural Information and Communication Complexity, 2011, doi:10.1007/978-3-642-22212-2_13.

Benter, Markus, et al. “Mixing Bottom-Up and Top-Down XPath Query Evaluation.”10.1007/978-3-642-23737-9_3__East European Conference on Advances in Databases and Information Systems, Springer, 2011, pp. 27–41, doi:10.1007/978-3-642-23737-9_3.

Bätz, Alexander, et al. “Updates on Grammar-Compressed XML Data.”10.1007/978-3-642-24577-0_17__Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer, 2011, pp. 154–66, doi:10.1007/978-3-642-24577-0_17.

Böttcher, Stefan, et al. “TraCX: Transformation of Compressed XML.”10.1007/978-3-642-24577-0_19__Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, Springer, 2011, pp. 182–93, doi:10.1007/978-3-642-24577-0_19.

Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.”10.1007/978-3-642-22012-8_52__Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.

Fuchs, Christian. “Como podemos definir vigilância?”https://doi.org/10.11606/issn.1982-8160.v5i1p109-136__MATRIZes, vol. 5, no. 1, 2011, pp. 109–33, doi:https://doi.org/10.11606/issn.1982-8160.v5i1p109-136.

Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.”10.1007/978-3-642-05118-0_43__Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, vol. 5873, 2010, pp. 624--639, doi:10.1007/978-3-642-05118-0_43.

Hamann, Heiko, et al. “A Model of Symmetry Breaking in Collective Decision-Making.”10.1007/978-3-642-15193-4_60__From Animals to Animats 11, vol. 6226, Springer, 2010, pp. 639–48, doi:10.1007/978-3-642-15193-4_60.

Grzablewicz, Ryszard, et al. “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.

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”10.1007/978-3-642-13731-0_21__SWAT 2010, Springer Berlin Heidelberg, 2010, pp. 212–23, doi:10.1007/978-3-642-13731-0_21.

Seebach, Hella, et al. “Designing Self-Healing in Automotive Systems.”10.1007/978-3-642-16576-4_4__Lecture Notes in Computer Science, 2010, doi:10.1007/978-3-642-16576-4_4.

Briest, Patrick, et al. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.”10.1007/978-3-642-17572-5_37__Workshop on Internet and Network Economics (WINE), 2010, doi:10.1007/978-3-642-17572-5_37.

Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.”10.1007/978-3-642-17289-2_60__Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.

Böttcher, Stefan, et al. “Searchable Compression of Office Documents by XML Schema Subtraction.”10.1007/978-3-642-15684-7_9__Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, Springer, 2010, pp. 103–12, doi:10.1007/978-3-642-15684-7_9.

Degener, Bastian, et al. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.”10.1007/978-3-642-13284-1_14__Structural Information and Communication Complexity, 2010, pp. 168–82, doi:10.1007/978-3-642-13284-1_14.

Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. 2010, doi:10.1007/978-3-642-14162-1.

Abramsky, Samson, et al., editors. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. 2010, doi:10.1007/978-3-642-14165-2.

Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.”10.1007/978-3-540-30545-3_23__Practical Aspects of Knowledge Management, 2010, doi:10.1007/978-3-540-30545-3_23.

Bonorden, Olaf, et al. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.”10.1007/978-3-642-05434-1_25__Algorithmic Aspects of Wireless Sensor Networks, Springer, 2009, pp. 252–62, doi:10.1007/978-3-642-05434-1_25.

Kakvi, Saqib. “Reinforcement Learning for Blackjack.”10.1007/978-3-642-04052-8_43__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2009, pp. 300–01, doi:10.1007/978-3-642-04052-8_43.

Schrieb, Jonas, et al. “Three-Valued Spotlight Abstractions.”10.1007/978-3-642-05089-3_8__FM 2009: Formal Methods, Springer Berlin Heidelberg, 2009, pp. 106–22, doi:10.1007/978-3-642-05089-3_8.

Briest, Patrick, et al. “On Stackelberg Pricing with Computationally Bounded Consumers.”10.1007/978-3-642-10841-9_6__Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-10841-9_6.

Biermann, Thorsten, et al. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.”10.1007/978-3-642-01399-7_69__NETWORKING 2009, Springer Berlin Heidelberg, 2009, pp. 883–94, doi:10.1007/978-3-642-01399-7_69.

Kakvi, Saqib. “Reinforcement Learning for Blackjack.”10.1007/978-3-642-04052-8_43__Lecture Notes in Computer Science, 2009, doi:10.1007/978-3-642-04052-8_43.

Briest, Patrick. “Uniform Budgets and the Envy-Free Pricing Problem.”10.1007/978-3-540-70575-8_66__Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP), 2008, doi:10.1007/978-3-540-70575-8_66.

Degener, Bastian, et al. “The Kinetic Facility Location Problem.”10.1007/978-3-540-69903-3_34__Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 2008, pp. 378–89, doi:10.1007/978-3-540-69903-3_34.

Hamann, Heiko, and Heinz Wörn. “Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem.”10.1007/978-3-540-69134-1_44__The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), vol. 5040, 2008, pp. 447--456, doi:10.1007/978-3-540-69134-1_44.

Lürwer-Brüggemeier, Katharina, and Martin Ziegler. “On Faster Integer Calculations Using Non-Arithmetic Primitives.”10.1007/978-3-540-85194-3_11__Unconventional Computing, 2008, doi:10.1007/978-3-540-85194-3_11.

Bienkowski, Marcin, and Jarosaw Kutyowski. “The K-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces.”10.1007/978-3-540-73951-7_30__Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73951-7_30.

May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”10.1007/3-540-45708-9_16__Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, 2007, pp. 242–56, doi:10.1007/3-540-45708-9_16.

Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”10.1007/3-540-44670-2_2__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 4–19, doi:10.1007/3-540-44670-2_2.

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”10.1007/3-540-45537-x_26__Selected Areas in Cryptography, Springer Berlin Heidelberg, 2007, pp. 325–41, doi:10.1007/3-540-45537-x_26.

May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.”10.1007/3-540-44670-2_10__Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2007, pp. 110–25, doi:10.1007/3-540-44670-2_10.

Blömer, Johannes. “A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers.”10.1007/3-540-68530-8_13__Algorithms — ESA’ 98, Springer Berlin Heidelberg, 2007, pp. 151–62, doi:10.1007/3-540-68530-8_13.

Dynia, Miroslaw, et al. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.”10.1007/978-3-540-69507-3_21__Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), vol. 4362, 2007, pp. 260--271, doi:10.1007/978-3-540-69507-3_21.

Ziegler, Martin. “(Short) Survey of Real Hypercomputation.”10.1007/978-3-540-73001-9_86__Lecture Notes in Computer Science, 2007, doi:10.1007/978-3-540-73001-9_86.

Meer, Klaus, and Martin Ziegler. “Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation.”10.1007/978-3-540-74456-6_64__Mathematical Foundations of Computer Science 2007, 2007, doi:10.1007/978-3-540-74456-6_64.

Monien, Burkhard, and Robert Preis. “Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs.”10.1007/3-540-44683-4_46__Mathematical Foundations of Computer Science 2001, 2007, doi:10.1007/3-540-44683-4_46.

Böttcher, Stefan, and Rita Steinmetz. “Evaluating XPath Queries on XML Data Streams.”10.1007/978-3-540-73390-4_10__Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–13, doi:10.1007/978-3-540-73390-4_10.

Böttcher, Stefan, and Rita Steinmetz. “Data Management for Mobile Ajax Web 2.0 Applications.”10.1007/978-3-540-74469-6_42__Database and Expert Systems Applications, 18th International Conference, DEXA 2007, Springer, 2007, pp. 424–33, doi:10.1007/978-3-540-74469-6_42.

Rührup, Stefan, and Christian Schindelhauer. “Online Multi-Path Routing in a Maze.”10.1007/11940128_65__Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006, doi:10.1007/11940128_65.

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.

Meschut, Gerson. “Mischbauweise Sorgt Für Frischen Wind.” Konstruktion, vol. 04, 2005, pp. 92–93.

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.

Bienkowski, Marcin, and Miroslaw Korzeniowski. “Dynamic Page Migration Under Brownian Motion.”10.1007/11549468_105__Proc. of the European Conference in Parallel Processing (Euro-Par), 2005, doi:10.1007/11549468_105.

Bienkowski, Marcin, and Jarosaw Byrka. “Bucket Game with Applications to Set Multicover and Dynamic Page Migration.”10.1007/11561071_72__Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005), vol. 3669, Springer , 2005, pp. 815–26, doi:10.1007/11561071_72.

Bienkowski, Marcin, et al. “Cube Connected Cycles Based Bluetooth Scatternet Formation.”10.1007/978-3-540-31956-6_49__Proceedings of the 4th International Conference on Networking, vol. 3420, Springer, 2005, pp. 413–20, doi:10.1007/978-3-540-31956-6_49.

Bienkowski, Marcin, et al. “Improved Algorithms for Dynamic Page Migration.”10.1007/978-3-540-31856-9_30__Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), 2005, pp. 365–76, doi:10.1007/978-3-540-31856-9_30.

Köhler, Sven, et al. “On Approximating Real-World Halting Problems.”10.1007/11537311_40__Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_40.

Meer, Klaus, and Martin Ziegler. “An Explicit Solution to Post’s Problem over the Reals.”10.1007/11537311_41__Fundamentals of Computation Theory, 2005, doi:10.1007/11537311_41.

Ziegler, Martin. “Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism.”10.1007/11494645_68__Proc. CiE 2005: New Computational Paradigms, vol. 3526, Springer, 2005, pp. 562–71, doi:10.1007/11494645_68.

Bienkowski, Marcin, et al. “Dynamic Load Balancing in Distributed Hash Tables.”10.1007/11558989_20__Peer-to-Peer Systems IV, 2005, doi:10.1007/11558989_20.

Bienkowski, Marcin, and Friedhelm Meyer auf der Heide. “Page Migration in Dynamic Networks.”10.1007/11549345_1__Mathematical Foundations of Computer Science 2005, 2005, doi:10.1007/11549345_1.