@inproceedings{19686, author = {{Briest, Patrick}}, booktitle = {{Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP)}}, isbn = {{9783540705741}}, issn = {{0302-9743}}, title = {{{Uniform Budgets and the Envy-Free Pricing Problem}}}, doi = {{10.1007/978-3-540-70575-8_66}}, year = {{2008}}, } @inproceedings{19003, author = {{Degener, Bastian and Gehweiler, Joachim and Lammersen, Christiane}}, booktitle = {{Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT)}}, isbn = {{9783540699002}}, issn = {{0302-9743}}, pages = {{378--389}}, title = {{{The Kinetic Facility Location Problem}}}, doi = {{10.1007/978-3-540-69903-3_34}}, year = {{2008}}, } @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}}, }