ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of d...
26
Voted
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
In this paper we give a finer separation of several known paging algorithms. This is accomplished using a new technique that we call relative interval analysis. This technique com...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
In an uncertain data set S = (S, p, f) where S is the ground set consisting of n elements, p : S → [0, 1] a probability function, and f : S → R a score function, each element i...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
We solve several fundamental geometric problems under a new streaming model recently proposed by Ruhl et al. [2, 12]. In this model, in one pass the input stream can be scanned to ...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
We introduces the umodules, a generalization of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and 2−structures...
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
ISAAC
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...