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.
LibreCat: /record/15137
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.
LibreCat: /record/16365
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.
LibreCat: /record/16403
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.
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.”10.1007/978-3-540-30545-3_23__Practical Aspects of Knowledge Management, 2010, doi:10.1007/978-3-540-30545-3_23.
LibreCat: /record/13301
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.
LibreCat: /record/19724
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.
LibreCat: /record/2920
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.
LibreCat: /record/3000
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.
LibreCat: /record/23744
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.
LibreCat: /record/1830
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.
LibreCat: /record/9616
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.
LibreCat: /record/19686
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.
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.”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.
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.”10.1007/978-3-540-85194-3_11__Unconventional Computing, 2008, doi: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.”10.1007/978-3-540-73951-7_30__Lecture Notes in Computer Science, 2007, doi: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.”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.
LibreCat: /record/3019
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.
LibreCat: /record/3020
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.
LibreCat: /record/3021
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.
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10