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

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.
LibreCat: /record/3026
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.
LibreCat: /record/18929
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.
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.”10.1007/978-3-540-74456-6_64__Mathematical Foundations of Computer Science 2007, 2007, doi: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.”10.1007/3-540-44683-4_46__Mathematical Foundations of Computer Science 2001, 2007, doi: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.”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.
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.”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.
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.”10.1007/11940128_65__Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006, doi:10.1007/11940128_65.
LibreCat: /record/19838
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.
LibreCat: /record/24277
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.
LibreCat: /record/3004
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.
LibreCat: /record/3005
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.
LibreCat: /record/3007
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.
LibreCat: /record/18926
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.
LibreCat: /record/17987
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.
LibreCat: /record/16472
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.
LibreCat: /record/16473
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.
LibreCat: /record/15150
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.
LibreCat: /record/15152
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.
LibreCat: /record/35958
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.
LibreCat: /record/53181
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.
LibreCat: /record/19835
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.
LibreCat: /record/19836
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.
LibreCat: /record/19912
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.
LibreCat: /record/3006
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.
LibreCat: /record/3010
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.
LibreCat: /record/26991
DOI: 10.1007/11561071_5

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.
LibreCat: /record/18768
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.
LibreCat: /record/18867
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.
LibreCat: /record/18912
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.
LibreCat: /record/18915
DOI: 10.1007/11561071_72