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

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

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

Klompmaker F, Paelke V, Fischer HG. A Taxonomy-Based Approach towards NUI Interaction Design. In: Distributed, Ambient, and Pervasive Interactions. Vol 8028. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:32-41. doi:10.1007/978-3-642-39351-8_4

Fischer HG, Strenge B, Nebe K. 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. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:252-261. doi:10.1007/978-3-642-39229-0_28

Place T, van Rooijen L, Zeitoun M. 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. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:729-740. doi:10.1007/978-3-642-40313-2_64

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

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

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

Hamann H, Engelbrecht A, Birattari M, et al. Towards Swarm Calculus: Universal Properties of Swarm Performance and Collective Decisions. In: Swarm Intelligence: 8th International Conference, ANTS 2012. Vol 7461. Berlin, Heidelberg: Springer; 2012:168-179. doi:10.1007/978-3-642-32650-9_15

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

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

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

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

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

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

Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: Advances in Visual Computing. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512. doi:10.1007/978-3-642-33179-4_48

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

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

Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: SOFSEM 2011: Theory and Practice of Computer Science. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-18381-2_15

Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52

Nebe K, Klompmaker F, Jung H, Fischer HG. Exploiting New Interaction Techniques for Disaster Control Management Using Multitouch-, Tangible- and Pen-Based-Interaction. In: Jacko JA, ed. Human-Computer Interaction. Interaction Techniques and Environments. Vol 6762. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:100-109. doi:10.1007/978-3-642-21605-3_11

Fischer HG, Nebe K, Klompmaker F. A Holistic Model for Integrating Usability Engineering and Software Engineering Enriched with Marketing Activities. In: Kurosu M, ed. Human Centered Design. Vol 6776. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2011:28-37. doi:10.1007/978-3-642-21753-1_4

Cord-Landwehr A, Degener B, Fischer M, 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). Springer; 2011:178-189. doi:10.1007/978-3-642-18381-2_15

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

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

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

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

Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming. Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52

Fuchs C. Como podemos definir vigilância? MATRIZes. 2011;5(1):109-133. doi:https://doi.org/10.11606/issn.1982-8160.v5i1p109-136

Mense M, Schindelhauer C. 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. Lecture Notes in Computer Science. ; 2010:624--639. doi:10.1007/978-3-642-05118-0_43

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

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

Ackermann MR, Blömer J. Bregman Clustering for Separable Instances. In: SWAT 2010. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:212-223. doi:10.1007/978-3-642-13731-0_21

Seebach H, Nafz F, Holtmann J, et al. Designing Self-healing in Automotive Systems. In: Lecture Notes in Computer Science. ; 2010. doi:10.1007/978-3-642-16576-4_4

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Hamann H, Wörn H. 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. ; 2008:447--456. doi:10.1007/978-3-540-69134-1_44

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

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

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

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

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

May A, Silverman JH. Dimension Reduction Methods for Convolution Modular Lattices. In: Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2007:110-125. doi:10.1007/3-540-44670-2_10

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

Dynia M, Korzeniowski M, Kutyowski J. 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. ; 2007:260--271. doi:10.1007/978-3-540-69507-3_21

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Rührup S, Schindelhauer C, Volbert K. 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. ; 2005:244-257. doi:10.1007/11561354_21

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

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

Blömer J, May A. A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers. In: EUROCRYPT 2005. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg; 2005:251-267. doi:10.1007/11426639_15

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

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

Meschut G. Mischbauweise sorgt für frischen Wind. Konstruktion. 2005;04:92-93.

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

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

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

Bienkowski M, Byrka J. Bucket Game with Applications to Set Multicover and Dynamic Page Migration. In: Proc. of the 13th Annual European Symposium on Algorithms (ESA 2005). Vol 3669. Berlin, Heidelberg: Springer ; 2005:815-826. doi:10.1007/11561071_72

Bienkowski M, Brinkmann A, Korzeniowski M, Orhan O. Cube Connected Cycles Based Bluetooth Scatternet Formation. In: Proceedings of the 4th International Conference on Networking. Vol 3420.10.1007/978-3-540-31956-6_49__Lecture Notes in Computer Science. Berlin, Heidelberg: Springer; 2005:413-420. doi:10.1007/978-3-540-31956-6_49

Bienkowski M, Dynia M, Korzeniowski M. Improved Algorithms for Dynamic Page Migration. In: Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science. ; 2005:365-376. doi:10.1007/978-3-540-31856-9_30

Köhler S, Schindelhauer C, Ziegler M. On Approximating Real-World Halting Problems. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_40

Meer K, Ziegler M. An Explicit Solution to Post’s Problem over the Reals. In: Fundamentals of Computation Theory. Berlin, Heidelberg; 2005. doi:10.1007/11537311_41

Ziegler M. Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. In: Proc. CiE 2005: New Computational Paradigms. Vol 3526. Springer; 2005:562-571. doi:10.1007/11494645_68

Bienkowski M, Korzeniowski M, Meyer auf der Heide F. Dynamic Load Balancing in Distributed Hash Tables. In: Peer-to-Peer Systems IV. Berlin, Heidelberg; 2005. doi:10.1007/11558989_20

Bienkowski M, Meyer auf der Heide F. Page Migration in Dynamic Networks. In: Mathematical Foundations of Computer Science 2005. Berlin, Heidelberg; 2005. doi:10.1007/11549345_1

Bonorden O, Gehweiler J, Meyer auf der Heide F. A Web Computing Environment for Parallel Algorithms in Java. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:801-808. doi:10.1007/11752578_96

Bonorden O, Gehweiler J, Meyer auf der Heide F. Load Balancing Strategies in a Web Computing Environment. In: Proceeedings of 6th International Conference on Parallel Processing and Applied Mathematics (PPAM). ; 2005:839-846. doi:10.1007/11752578_101

Böttcher S, Steinmetz R. Detecting Privacy Violations in Sensitive XML Databases. In: Secure Data Management, Second VLDB Workshop, SDM 2005. Springer; 2005:143-154. doi:10.1007/11552338_10

Briest P, Brockhoff D, Degener B, et al. The Ising Model: Simple Evolutionary Algorithms as Adaptation Schemes. In: Parallel Problem Solving from Nature - PPSN VIII. Berlin, Heidelberg; 2004. doi:10.1007/978-3-540-30217-9_4

Blömer J, Guajardo J, Krummel V. Provably Secure Masking of AES. In: Selected Areas in Cryptography. Berlin, Heidelberg: Springer Berlin Heidelberg; 2004:69-83. doi:10.1007/978-3-540-30564-4_5