Sciweavers

ICALP
2003
Springer
14 years 4 months ago
Scaled Dimension and Nonuniform Complexity
Resource-bounded dimension is a complexity-theoretic extension of classical Hausdorff dimension introduced by Lutz (2000) in order to investigate the fractal structure of sets th...
John M. Hitchcock, Jack H. Lutz, Elvira Mayordomo
ICALP
2003
Springer
14 years 4 months ago
Resource Access and Mobility Control with Dynamic Privileges Acquisition
µKlaim is a process language that permits programming distributed systems made up of several mobile components interacting through multiple distributed tuple spaces. We present th...
Daniele Gorla, Rosario Pugliese
ICALP
2003
Springer
14 years 4 months ago
An Improved Approximation Algorithm for Vertex Cover with Hard Capacities
Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Ko...
ICALP
2003
Springer
14 years 4 months ago
The Cell Probe Complexity of Succinct Data Structures
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
Anna Gál, Peter Bro Miltersen
ICALP
2003
Springer
14 years 4 months ago
Optimal Cache-Oblivious Implicit Dictionaries
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
Gianni Franceschini, Roberto Grossi
ICALP
2003
Springer
14 years 4 months ago
Convergence Time to Nash Equilibria
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
Eyal Even-Dar, Alexander Kesselman, Yishay Mansour
ICALP
2003
Springer
14 years 4 months ago
Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...
ICALP
2003
Springer
14 years 4 months ago
Online Load Balancing Made Simple: Greedy Strikes Back
We provide a new simpler approach to the on-line load balancing problem in the case of restricted assignment of temporary weighted tasks. The approach is very general and allows to...
Pierluigi Crescenzi, Giorgio Gambosi, Gaia Nicosia...
ICALP
2003
Springer
14 years 4 months ago
Solving the Robots Gathering Problem
Abstract. Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct co...
Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe...