49 search results - page 6 / 10 » stacs 2007 |
76
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We introduce a new class VPSPACE of families of polynomials. Roughly speaking, a family of polynomials is in VPSPACE if its coefficients can be computed in polynomial spa...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The sharing of content by communities of users (e.g., scientists) in a P2P context remains cumbersome. We argue that main reasons for this is the lack of calculus and alg...
88
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
We contribute to the study of efficient enumeration algorithms for all solutions of constraint satisfaction problems. The only algorithm known so far, presented by Creignou and H´...
107
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...