Bätz, Alexander, Stefan Böttcher, and Rita Hartel. “Updates on Grammar-Compressed XML Data.”https://doi.org/10.1007/978-3-642-24577-0_17__In Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, 154–66. Springer, 2011.https://doi.org/10.1007/978-3-642-24577-0_17 .
LibreCat: /record/15099
DOI: 10.1007/978-3-642-24577-0_17

Böttcher, Stefan, Rita Hartel, and Sebastian Stey. “TraCX: Transformation of Compressed XML.”https://doi.org/10.1007/978-3-642-24577-0_19__In Advances in Databases - 28th British National Conference on Databases, BNCOD 28, Revised Selected Papers, 182–93. Springer, 2011.https://doi.org/10.1007/978-3-642-24577-0_19 .
LibreCat: /record/15100
DOI: 10.1007/978-3-642-24577-0_19

Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.”https://doi.org/10.1007/978-3-642-22012-8_52__In Automata, Languages and Programming. Berlin, Heidelberg, 2011.https://doi.org/10.1007/978-3-642-22012-8_52 .
LibreCat: /record/16409
DOI: 10.1007/978-3-642-22012-8_52

Mense, Mario, and Christian Schindelhauer. “Read-Write-Codes: An Erasure Resilient Encoding System for Flexible Reading and Writing in Storage Networks.”https://doi.org/10.1007/978-3-642-05118-0_43__In Proceedings of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems, 5873:624--639. Lecture Notes in Computer Science, 2010.https://doi.org/10.1007/978-3-642-05118-0_43 .
LibreCat: /record/19796
DOI: 10.1007/978-3-642-05118-0_43

Hamann, Heiko, Bernd Meyer, Thomas Schmickl, and Karl Crailsheim. “A Model of Symmetry Breaking in Collective Decision-Making.”https://doi.org/10.1007/978-3-642-15193-4_60__In From Animals to Animats 11, 6226:639–48. Springer, 2010.https://doi.org/10.1007/978-3-642-15193-4_60 .
LibreCat: /record/20226
DOI: 10.1007/978-3-642-15193-4_60

Grzablewicz, Ryszard, Jarosaw Kutyowski, Mirosaw Kutyowski, and Wojciech Pietkiewicz. “Robust Undetectable Interference Watermarks.”https://doi.org/10.1007/11424826_55__ICCSA’05: Proceedings of the 2005 International Conference on Computational Science and Its Applications, 2010.https://doi.org/10.1007/11424826_55 .
LibreCat: /record/24282
DOI: 10.1007/11424826_55

Ackermann, Marcel R., and Johannes Blömer. “Bregman Clustering for Separable Instances.”https://doi.org/10.1007/978-3-642-13731-0_21__In SWAT 2010, 212–23. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13731-0_21 .
LibreCat: /record/2988
DOI: 10.1007/978-3-642-13731-0_21

Seebach, Hella, Florian Nafz, Jörg Holtmann, Jan Meyer, Matthias Tichy, Wolfgang Reif, and Wilhelm Schäfer. “Designing Self-Healing in Automotive Systems.”https://doi.org/10.1007/978-3-642-16576-4_4__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2010.https://doi.org/10.1007/978-3-642-16576-4_4 .
LibreCat: /record/20961
DOI: 10.1007/978-3-642-16576-4_4

Briest, Patrick, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai. “Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing.”https://doi.org/10.1007/978-3-642-17572-5_37__In Workshop on Internet and Network Economics (WINE), 2010.https://doi.org/10.1007/978-3-642-17572-5_37 .
LibreCat: /record/19029
DOI: 10.1007/978-3-642-17572-5_37

Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.”https://doi.org/10.1007/978-3-642-17289-2_60__In Advances in Visual Computing. Berlin, Heidelberg, 2010.https://doi.org/10.1007/978-3-642-17289-2_60 .
LibreCat: /record/16505
DOI: 10.1007/978-3-642-17289-2_60

Böttcher, Stefan, Rita Hartel, and Christian Messinger. “Searchable Compression of Office Documents by XML Schema Subtraction.”https://doi.org/10.1007/978-3-642-15684-7_9__In Database and XML Technologies - 7th International XML Database Symposium, XSym 2010, 103–12. Springer, 2010.https://doi.org/10.1007/978-3-642-15684-7_9 .
LibreCat: /record/15137
DOI: 10.1007/978-3-642-15684-7_9

Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf der Heide. “A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots.”https://doi.org/10.1007/978-3-642-13284-1_14__In Structural Information and Communication Complexity, 168–82. SIROCCO 2010. Berlin, Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13284-1_14 .
LibreCat: /record/16365
DOI: 10.1007/978-3-642-13284-1_14

Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II. Berlin, Heidelberg, 2010.https://doi.org/10.1007/978-3-642-14162-1 .
LibreCat: /record/16403
DOI: 10.1007/978-3-642-14162-1

Abramsky, Samson, Cyril Gavoille, Claude Kirchner, Friedhelm Meyer auf der Heide, and Paul G. Spirakis, eds. Automata, Languages and Programming, 37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part I. Berlin, Heidelberg, 2010.https://doi.org/10.1007/978-3-642-14165-2 .
LibreCat: /record/16404
DOI: 10.1007/978-3-642-14165-2

Trier, Matthias, and Claudia Müller. “Towards a Systematic Approach for Capturing Knowledge-Intensive Business Processes.”https://doi.org/10.1007/978-3-540-30545-3_23__In Practical Aspects of Knowledge Management. Berlin, Heidelberg, 2010.https://doi.org/10.1007/978-3-540-30545-3_23 .
LibreCat: /record/13301
DOI: 10.1007/978-3-540-30545-3_23

Bonorden, Olaf, Bastian Degener, Barbara Kempkes, and Peter Pietrzyk. “Complexity and Approximation of a Geometric Local Robot Assignment Problem.”https://doi.org/10.1007/978-3-642-05434-1_25__In Algorithmic Aspects of Wireless Sensor Networks, 252–62. Berlin, Heidelberg: Springer, 2009.https://doi.org/10.1007/978-3-642-05434-1_25 .
LibreCat: /record/19724
DOI: 10.1007/978-3-642-05434-1_25

Kakvi, Saqib. “Reinforcement Learning for Blackjack.”https://doi.org/10.1007/978-3-642-04052-8_43__In Lecture Notes in Computer Science, 300–301. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.https://doi.org/10.1007/978-3-642-04052-8_43 .
LibreCat: /record/2920
DOI: 10.1007/978-3-642-04052-8_43

Schrieb, Jonas, Heike Wehrheim, and Daniel Wonisch. “Three-Valued Spotlight Abstractions.”https://doi.org/10.1007/978-3-642-05089-3_8__In FM 2009: Formal Methods, 106–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.https://doi.org/10.1007/978-3-642-05089-3_8 .
LibreCat: /record/3000
DOI: 10.1007/978-3-642-05089-3_8

Briest, Patrick, Martin Hoefer, Luciano Gualà, and Carmine Ventre. “On Stackelberg Pricing with Computationally Bounded Consumers.”https://doi.org/10.1007/978-3-642-10841-9_6__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2009.https://doi.org/10.1007/978-3-642-10841-9_6 .
LibreCat: /record/23744
DOI: 10.1007/978-3-642-10841-9_6

Biermann, Thorsten, Arne Schwabe, and Holger Karl. “Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE.”https://doi.org/10.1007/978-3-642-01399-7_69__In NETWORKING 2009, 883–94. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009.https://doi.org/10.1007/978-3-642-01399-7_69 .
LibreCat: /record/1830
DOI: 10.1007/978-3-642-01399-7_69

Kakvi, Saqib. “Reinforcement Learning for Blackjack.”https://doi.org/10.1007/978-3-642-04052-8_43__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2009.https://doi.org/10.1007/978-3-642-04052-8_43 .
LibreCat: /record/9616
DOI: 10.1007/978-3-642-04052-8_43

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

Degener, Bastian, Joachim Gehweiler, and Christiane Lammersen. “The Kinetic Facility Location Problem.”https://doi.org/10.1007/978-3-540-69903-3_34__In Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT), 378–89, 2008.https://doi.org/10.1007/978-3-540-69903-3_34 .
LibreCat: /record/19003
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.”https://doi.org/10.1007/978-3-540-69134-1_44__In The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 5040:447--456, 2008.https://doi.org/10.1007/978-3-540-69134-1_44 .
LibreCat: /record/20367
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.”https://doi.org/10.1007/978-3-540-85194-3_11__In Unconventional Computing. Berlin, Heidelberg, 2008.https://doi.org/10.1007/978-3-540-85194-3_11 .
LibreCat: /record/17978
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.”https://doi.org/10.1007/978-3-540-73951-7_30__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2007.https://doi.org/10.1007/978-3-540-73951-7_30 .
LibreCat: /record/24276
DOI: 10.1007/978-3-540-73951-7_30

May, Alexander. “Cryptanalysis of Unbalanced RSA with Small CRT-Exponent.”https://doi.org/10.1007/3-540-45708-9_16__In Advances in Cryptology — CRYPTO 2002, 242–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45708-9_16 .
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Blömer, Johannes, and Alexander May. “Low Secret Exponent RSA Revisited.”https://doi.org/10.1007/3-540-44670-2_2__In Lecture Notes in Computer Science, 4–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_2 .
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Blömer, Johannes, and Alexander May. “Key Revocation with Interval Cover Families.”https://doi.org/10.1007/3-540-45537-x_26__In Selected Areas in Cryptography, 325–41. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-45537-x_26 .
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

May, Alexander, and Joseph H. Silverman. “Dimension Reduction Methods for Convolution Modular Lattices.”https://doi.org/10.1007/3-540-44670-2_10__In Lecture Notes in Computer Science, 110–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.https://doi.org/10.1007/3-540-44670-2_10 .
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

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

Dynia, Miroslaw, Miroslaw Korzeniowski, and Jarosaw Kutyowski. “Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs.”https://doi.org/10.1007/978-3-540-69507-3_21__In Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM’07), 4362:260--271, 2007.https://doi.org/10.1007/978-3-540-69507-3_21 .
LibreCat: /record/18929
DOI: 10.1007/978-3-540-69507-3_21

Ziegler, Martin. “(Short) Survey of Real Hypercomputation.”https://doi.org/10.1007/978-3-540-73001-9_86__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2007.https://doi.org/10.1007/978-3-540-73001-9_86 .
LibreCat: /record/17982
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.”https://doi.org/10.1007/978-3-540-74456-6_64__In Mathematical Foundations of Computer Science 2007. Berlin, Heidelberg, 2007.https://doi.org/10.1007/978-3-540-74456-6_64 .
LibreCat: /record/17983
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.”https://doi.org/10.1007/3-540-44683-4_46__In Mathematical Foundations of Computer Science 2001. Berlin, Heidelberg, 2007.https://doi.org/10.1007/3-540-44683-4_46 .
LibreCat: /record/16640
DOI: 10.1007/3-540-44683-4_46

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

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

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

Kutyowski, Jarosaw, and Filip Zagórski. “Reliable Broadcasting Without Collision Detection.”https://doi.org/10.1007/11611257_37__In SOFSEM 2006: Theory and Practice of Computer Science. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11611257_37 .
LibreCat: /record/24277
DOI: 10.1007/11611257_37

Blömer, Johannes, and Volker Krummel. “Fault Based Collision Attacks on AES.”https://doi.org/10.1007/11889700_11__In Lecture Notes in Computer Science, 106–20. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_11 .
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Blömer, Johannes, and Martin Otto. “Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered.”https://doi.org/10.1007/11889700_2__In Lecture Notes in Computer Science, 13–23. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_2 .
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Blömer, Johannes, Martin Otto, and Jean-Pierre Seifert. “Sign Change Fault Attacks on Elliptic Curve Cryptosystems.”https://doi.org/10.1007/11889700_4__In Lecture Notes in Computer Science, 36–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11889700_4 .
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Dynia, Miroslaw, Miroslaw Korzeniowski, and Christian Schindelhauer. “Power-Aware Collective Tree Exploration.”https://doi.org/10.1007/11682127_24__In Architecture of Computing Systems - ARCS, 341--351, 2006.https://doi.org/10.1007/11682127_24 .
LibreCat: /record/18926
DOI: 10.1007/11682127_24

Meer, Klaus, and Martin Ziegler. “Uncomputability Below the Real Halting Problem.”https://doi.org/10.1007/11780342_39__In Logical Approaches to Computational Barriers. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11780342_39 .
LibreCat: /record/17987
DOI: 10.1007/11780342_39

Demaine, Erik D., Friedhelm Meyer auf der Heide, Rasmus Pagh, and Mihai Petrafcu. “De Dictionariis Dynamicis Pauco Spatio Utentibus (lat. On Dynamic Dictionaries Using Little Space).”https://doi.org/10.1007/11682462_34__In LATIN 2006: Theoretical Informatics. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11682462_34 .
LibreCat: /record/16472
DOI: 10.1007/11682462_34

Dynia, M., J. Kutyowski, Friedhelm Meyer auf der Heide, and Christian Schindelhauer. “Smart Robot Teams Exploring Sparse Trees.”https://doi.org/10.1007/11821069_29__In Lecture Notes in Computer Science. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11821069_29 .
LibreCat: /record/16473
DOI: 10.1007/11821069_29

Böttcher, Stefan, and Rita Steinmetz. “DTD-Driven Structure Preserving XML Compression.”https://doi.org/10.1007/11788911_27__In Flexible and Efficient Information Handling, 23rd British National Conference on Databases, BNCOD 23, 266–69. Berlin, Heidelberg, 2006.https://doi.org/10.1007/11788911_27 .
LibreCat: /record/15150
DOI: 10.1007/11788911_27

Böttcher, Stefan, and Rita Steinmetz. “Information Disclosure by XPath Queries.”https://doi.org/10.1007/11844662_12__In Secure Data Management, Third VLDB Workshop, SDM 2006, 160–74. Springer, 2006.https://doi.org/10.1007/11844662_12 .
LibreCat: /record/15152
DOI: 10.1007/11844662_12

Fouvry, Étienne, and Jürgen Klüners. “Cohen–Lenstra Heuristics of Quadratic Number Fields.”https://doi.org/10.1007/11792086_4__In Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11792086_4 .
LibreCat: /record/35958
DOI: 10.1007/11792086_4

Geiselmann, Willi, Fabian Januszewski, Hubert Köpfer, Jan Pelzl, and Rainer Steinwandt. “A Simpler Sieving Device: Combining ECM and TWIRL.”https://doi.org/10.1007/11927587_12__In Information Security and Cryptology – ICISC 2006. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006.https://doi.org/10.1007/11927587_12 .
LibreCat: /record/53181
DOI: 10.1007/11927587_12