@inproceedings{20367,
  author       = {{Hamann, Heiko and Wörn, Heinz}},
  booktitle    = {{The tenth International Conference on Simulation of Adaptive Behavior (SAB'08)}},
  isbn         = {{9783540691334}},
  issn         = {{0302-9743}},
  pages        = {{447----456}},
  title        = {{{Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem}}},
  doi          = {{10.1007/978-3-540-69134-1_44}},
  volume       = {{5040}},
  year         = {{2008}},
}

@inbook{17978,
  author       = {{Lürwer-Brüggemeier, Katharina and Ziegler, Martin}},
  booktitle    = {{Unconventional Computing}},
  isbn         = {{9783540851936}},
  issn         = {{0302-9743}},
  title        = {{{On Faster Integer Calculations Using Non-arithmetic Primitives}}},
  doi          = {{10.1007/978-3-540-85194-3_11}},
  year         = {{2008}},
}

@inproceedings{24276,
  abstract     = {{We define a natural generalization of the prominent k-server problem, the k-resource problem. It occurs in metric spaces with some demands and resources given at its points. The demands may vary with time, but the total demand may never exceed k. The goal of an online algorithm is to satisfy demands by moving resources, while minimizing the cost for transporting resources. We give an asymptotically optimal O(log(min {n,k}))-competitive randomized algorithm and an O(min {k,n})-competitive deterministic one for the k-resource problem on uniform metric spaces consisting of n points. This extends known results for paging to the more general setting of k-resource.
Basing on the results for uniform metric spaces, we develop a randomized algorithm solving the k-resource and the k-server problem on metric spaces which can be decomposed into components far away from each other. The algorithm achieves a competitive ratio of O(log(min {n,k})), provided that it has some extra resources more than the optimal algorithm.
}},
  author       = {{Bienkowski, Marcin and Kutyłowski, Jarosław}},
  booktitle    = {{Lecture Notes in Computer Science}},
  issn         = {{0302-9743}},
  title        = {{{The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces}}},
  doi          = {{10.1007/978-3-540-73951-7_30}},
  year         = {{2007}},
}

@inbook{3019,
  author       = {{May, Alexander}},
  booktitle    = {{Advances in Cryptology — CRYPTO 2002}},
  isbn         = {{9783540440505}},
  issn         = {{0302-9743}},
  pages        = {{242--256}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Cryptanalysis of Unbalanced RSA with Small CRT-Exponent}}},
  doi          = {{10.1007/3-540-45708-9_16}},
  year         = {{2007}},
}

@inbook{3020,
  author       = {{Blömer, Johannes and May, Alexander}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540424888}},
  issn         = {{0302-9743}},
  pages        = {{4--19}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Low Secret Exponent RSA Revisited}}},
  doi          = {{10.1007/3-540-44670-2_2}},
  year         = {{2007}},
}

@inbook{3021,
  author       = {{Blömer, Johannes and May, Alexander}},
  booktitle    = {{Selected Areas in Cryptography}},
  isbn         = {{9783540430667}},
  issn         = {{0302-9743}},
  pages        = {{325--341}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Key Revocation with Interval Cover Families}}},
  doi          = {{10.1007/3-540-45537-x_26}},
  year         = {{2007}},
}

@inbook{3022,
  author       = {{May, Alexander and Silverman, Joseph H.}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540424888}},
  issn         = {{0302-9743}},
  pages        = {{110--125}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Dimension Reduction Methods for Convolution Modular Lattices}}},
  doi          = {{10.1007/3-540-44670-2_10}},
  year         = {{2007}},
}

@inbook{3026,
  author       = {{Blömer, Johannes}},
  booktitle    = {{Algorithms — ESA’ 98}},
  isbn         = {{9783540648482}},
  issn         = {{0302-9743}},
  pages        = {{151--162}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers}}},
  doi          = {{10.1007/3-540-68530-8_13}},
  year         = {{2007}},
}

@inproceedings{18929,
  author       = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Kutyłowski, Jarosław}},
  booktitle    = {{Proc. of the 33rd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'07)}},
  isbn         = {{9783540695066}},
  issn         = {{0302-9743}},
  pages        = {{260----271}},
  title        = {{{Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs}}},
  doi          = {{10.1007/978-3-540-69507-3_21}},
  volume       = {{4362}},
  year         = {{2007}},
}

@inbook{17982,
  author       = {{Ziegler, Martin}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540730002}},
  issn         = {{0302-9743}},
  title        = {{{(Short) Survey of Real Hypercomputation}}},
  doi          = {{10.1007/978-3-540-73001-9_86}},
  year         = {{2007}},
}

@inbook{17983,
  author       = {{Meer, Klaus and Ziegler, Martin}},
  booktitle    = {{Mathematical Foundations of Computer Science 2007}},
  isbn         = {{9783540744559}},
  issn         = {{0302-9743}},
  title        = {{{Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation}}},
  doi          = {{10.1007/978-3-540-74456-6_64}},
  year         = {{2007}},
}

@inbook{16640,
  author       = {{Monien, Burkhard and Preis, Robert}},
  booktitle    = {{Mathematical Foundations of Computer Science 2001}},
  isbn         = {{9783540424963}},
  issn         = {{0302-9743}},
  title        = {{{Upper Bounds on the Bisection Width of 3- and 4-Regular Graphs}}},
  doi          = {{10.1007/3-540-44683-4_46}},
  year         = {{2007}},
}

@inproceedings{15144,
  author       = {{Böttcher, Stefan and Steinmetz, Rita}},
  booktitle    = {{Data Management. Data, Data Everywhere, 24th British National Conference on Databases, BNCOD 24}},
  isbn         = {{9783540733898}},
  issn         = {{0302-9743}},
  pages        = {{101--113}},
  publisher    = {{Springer}},
  title        = {{{Evaluating XPath Queries on XML Data Streams}}},
  doi          = {{10.1007/978-3-540-73390-4_10}},
  year         = {{2007}},
}

@inproceedings{15146,
  author       = {{Böttcher, Stefan and Steinmetz, Rita}},
  booktitle    = {{Database and Expert Systems Applications, 18th International Conference, DEXA 2007}},
  isbn         = {{9783540744672}},
  issn         = {{0302-9743}},
  pages        = {{424--433}},
  publisher    = {{Springer}},
  title        = {{{Data Management for Mobile Ajax Web 2.0 Applications}}},
  doi          = {{10.1007/978-3-540-74469-6_42}},
  year         = {{2007}},
}

@inproceedings{19838,
  author       = {{Rührup, Stefan and Schindelhauer, Christian}},
  booktitle    = {{Proc. of the 17th International Symposium on Algorithms and Computation (ISAAC 2006)}},
  isbn         = {{9783540496946}},
  issn         = {{0302-9743}},
  title        = {{{Online Multi-path Routing in a Maze}}},
  doi          = {{10.1007/11940128_65}},
  year         = {{2006}},
}

@inproceedings{24277,
  abstract     = {{We propose a dynamic, ad-hoc communication network consisting of mobile units that can warn about traffic jams on motorways.

Our goal is to provide a practical, low cost solution. Therefore we consider very simple wireless communication hardware, without collision detection, with very small bandwidth and a probabilistic model of link failure.

We provide a complete system architecture. For this purpose we design and analyze solutions for size approximation, leader election and broadcasting. Our algorithms are fine-tuned for fast operation in a practical setting. We provide both a theoretical and experimental evaluation of our solutions.

Our contribution is much different from the previous work, where either pure theoretical models with a pure theoretical analysis are provided or algorithms working in practical models are evaluated only through simulations.}},
  author       = {{Kutyłowski, Jarosław and Zagórski, Filip}},
  booktitle    = {{SOFSEM 2006: Theory and Practice of Computer Science}},
  issn         = {{0302-9743}},
  title        = {{{Reliable Broadcasting Without Collision Detection}}},
  doi          = {{10.1007/11611257_37}},
  year         = {{2006}},
}

@inbook{3004,
  author       = {{Blömer, Johannes and Krummel, Volker}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540462507}},
  issn         = {{0302-9743}},
  pages        = {{106--120}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Fault Based Collision Attacks on AES}}},
  doi          = {{10.1007/11889700_11}},
  year         = {{2006}},
}

@inbook{3005,
  author       = {{Blömer, Johannes and Otto, Martin}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540462507}},
  issn         = {{0302-9743}},
  pages        = {{13--23}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Wagner’s Attack on a Secure CRT-RSA Algorithm Reconsidered}}},
  doi          = {{10.1007/11889700_2}},
  year         = {{2006}},
}

@inbook{3007,
  author       = {{Blömer, Johannes and Otto, Martin and Seifert, Jean-Pierre}},
  booktitle    = {{Lecture Notes in Computer Science}},
  isbn         = {{9783540462507}},
  issn         = {{0302-9743}},
  pages        = {{36--52}},
  publisher    = {{Springer Berlin Heidelberg}},
  title        = {{{Sign Change Fault Attacks on Elliptic Curve Cryptosystems}}},
  doi          = {{10.1007/11889700_4}},
  year         = {{2006}},
}

@inproceedings{18926,
  author       = {{Dynia, Miroslaw and Korzeniowski, Miroslaw and Schindelhauer, Christian}},
  booktitle    = {{Architecture of Computing Systems - ARCS}},
  isbn         = {{9783540327653}},
  issn         = {{0302-9743}},
  number       = {{3894}},
  pages        = {{341----351}},
  title        = {{{Power-Aware Collective Tree Exploration}}},
  doi          = {{10.1007/11682127_24}},
  year         = {{2006}},
}