STACS
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
For every k ≥ 1 and two finite fields F and F , we design a polynomial-time algorithm that given a matroid M of branch-width at most k represented over F decides whether M is ...
STACS
2007
Springer
14 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
14 years 6 months ago
2007
Springer
STACS
2007
Springer
14 years 6 months ago
2007
Springer
STACS
2007
Springer
14 years 6 months ago
2007
Springer
STACS
2007
Springer
14 years 6 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
STACS
2007
Springer
14 years 6 months ago
2007
Springer
Coalgebras provide a unifying semantic framework for a wide variety of modal logics. It has previously been shown that the class of
STACS
2007
Springer
14 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´...
STACS
2007
Springer
14 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...