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