TY - CONF AU - Briest, Patrick ID - 19686 SN - 0302-9743 T2 - Proceedings of the 35th InternationalColloquium on Automata, Languages and Programming (ICALP) TI - Uniform Budgets and the Envy-Free Pricing Problem ER - TY - CONF AU - Degener, Bastian AU - Gehweiler, Joachim AU - Lammersen, Christiane ID - 19003 SN - 0302-9743 T2 - Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT) TI - The Kinetic Facility Location Problem ER - TY - CONF AU - Hamann, Heiko AU - Wörn, Heinz ID - 20367 SN - 0302-9743 T2 - The tenth International Conference on Simulation of Adaptive Behavior (SAB'08) TI - Aggregating Robots Compute: An Adaptive Heuristic for the Euclidean Steiner Tree Problem VL - 5040 ER - TY - CHAP AU - Lürwer-Brüggemeier, Katharina AU - Ziegler, Martin ID - 17978 SN - 0302-9743 T2 - Unconventional Computing TI - On Faster Integer Calculations Using Non-arithmetic Primitives ER - TY - CONF AB - 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. AU - Bienkowski, Marcin AU - Kutyłowski, Jarosław ID - 24276 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - The k-Resource Problem on Uniform and on Uniformly Decomposable Metric Spaces ER - TY - CHAP AU - May, Alexander ID - 3019 SN - 0302-9743 T2 - Advances in Cryptology — CRYPTO 2002 TI - Cryptanalysis of Unbalanced RSA with Small CRT-Exponent ER - TY - CHAP AU - Blömer, Johannes AU - May, Alexander ID - 3020 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Low Secret Exponent RSA Revisited ER - TY - CHAP AU - Blömer, Johannes AU - May, Alexander ID - 3021 SN - 0302-9743 T2 - Selected Areas in Cryptography TI - Key Revocation with Interval Cover Families ER - TY - CHAP AU - May, Alexander AU - Silverman, Joseph H. ID - 3022 SN - 0302-9743 T2 - Lecture Notes in Computer Science TI - Dimension Reduction Methods for Convolution Modular Lattices ER - TY - CHAP AU - Blömer, Johannes ID - 3026 SN - 0302-9743 T2 - Algorithms — ESA’ 98 TI - A Probabilistic Zero-Test for Expressions Involving Roots of Rational Numbers ER -