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
LibreCat: /record/16404
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
LibreCat: /record/13301
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
LibreCat: /record/19724
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
LibreCat: /record/2920
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
LibreCat: /record/3000
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
LibreCat: /record/23744
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
LibreCat: /record/1830
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
LibreCat: /record/9616
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
LibreCat: /record/19686
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
LibreCat: /record/19003
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
LibreCat: /record/20367
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
LibreCat: /record/17978
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
LibreCat: /record/24276
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
LibreCat: /record/3019
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
LibreCat: /record/3020
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
LibreCat: /record/3021
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
LibreCat: /record/3022
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
LibreCat: /record/3026
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
LibreCat: /record/18929
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
LibreCat: /record/17982
DOI: 10.1007/978-3-540-73001-9_86