Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem
H. Hamann, H. Wörn, in: The Tenth International Conference on Simulation of Adaptive Behavior (SAB’08), 2008, pp. 447--456.
LibreCat: /record/20367
DOI: 10.1007/978-3-540-69134-1_44

On Faster Integer Calculations Using Non-arithmetic Primitives
K. Lürwer-Brüggemeier, M. Ziegler, in: Unconventional Computing, Berlin, Heidelberg, 2008.
LibreCat: /record/17978
DOI: 10.1007/978-3-540-85194-3_11

The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces
M. Bienkowski, J. Kutyowski, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.
LibreCat: /record/24276
DOI: 10.1007/978-3-540-73951-7_30

Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
A. May, in: Advances in Cryptology — CRYPTO 2002, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 242–256.
LibreCat: /record/3019
DOI: 10.1007/3-540-45708-9_16

Low Secret Exponent RSA Revisited
J. Blömer, A. May, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 4–19.
LibreCat: /record/3020
DOI: 10.1007/3-540-44670-2_2

Key Revocation with Interval Cover Families
J. Blömer, A. May, in: Selected Areas in Cryptography, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 325–341.
LibreCat: /record/3021
DOI: 10.1007/3-540-45537-x_26

Dimension Reduction Methods for Convolution Modular Lattices
A. May, J.H. Silverman, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 110–125.
LibreCat: /record/3022
DOI: 10.1007/3-540-44670-2_10

A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers
J. Blömer, in: Algorithms — ESA’ 98, Springer Berlin Heidelberg, Berlin, Heidelberg, 2007, pp. 151–162.
LibreCat: /record/3026
DOI: 10.1007/3-540-68530-8_13

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

(Short) Survey of Real Hypercomputation
M. Ziegler, in: Lecture Notes in Computer Science, Berlin, Heidelberg, 2007.
LibreCat: /record/17982
DOI: 10.1007/978-3-540-73001-9_86

Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation
K. Meer, M. Ziegler, in: Mathematical Foundations of Computer Science 2007, Berlin, Heidelberg, 2007.
LibreCat: /record/17983
DOI: 10.1007/978-3-540-74456-6_64

Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs
B. Monien, R. Preis, in: Mathematical Foundations of Computer Science 2001, Berlin, Heidelberg, 2007.
LibreCat: /record/16640
DOI: 10.1007/3-540-44683-4_46

Evaluating XPath Queries on XML Data Streams
S. Böttcher, R. Steinmetz, in: Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24, Springer, 2007, pp. 101–113.
LibreCat: /record/15144
DOI: 10.1007/978-3-540-73390-4_10

Data Management for Mobile Ajax Web 2.0 Applications
S. Böttcher, R. Steinmetz, in: Database and Expert Systems Applications, 18th International Conference, DEXA 2007, Springer, 2007, pp. 424–433.
LibreCat: /record/15146
DOI: 10.1007/978-3-540-74469-6_42

Online Multi-path Routing in a Maze
S. Rührup, C. Schindelhauer, in: Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006), 2006.
LibreCat: /record/19838
DOI: 10.1007/11940128_65

Reliable Broadcasting Without Collision Detection
J. Kutyowski, F. Zagórski, in: SOFSEM 2006: Theory and Practice of Computer Science, Berlin, Heidelberg, 2006.
LibreCat: /record/24277
DOI: 10.1007/11611257_37

Fault Based Collision Attacks on AES
J. Blömer, V. Krummel, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 106–120.
LibreCat: /record/3004
DOI: 10.1007/11889700_11

Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered
J. Blömer, M. Otto, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 13–23.
LibreCat: /record/3005
DOI: 10.1007/11889700_2

Sign Change Fault Attacks on Elliptic Curve Cryptosystems
J. Blömer, M. Otto, J.-P. Seifert, in: Lecture Notes in Computer Science, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, pp. 36–52.
LibreCat: /record/3007
DOI: 10.1007/11889700_4

Power-Aware Collective Tree Exploration
M. Dynia, M. Korzeniowski, C. Schindelhauer, in: Architecture of Computing Systems - ARCS, 2006, pp. 341--351.
LibreCat: /record/18926
DOI: 10.1007/11682127_24