STACS
2009
Springer
14 years 7 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
STACS
2009
Springer
14 years 7 months ago
2009
Springer
STACS
2009
Springer
14 years 7 months ago
2009
Springer
ABSTRACT. Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction...
STACS
2009
Springer
14 years 7 months ago
2009
Springer
We analyze the structure of equilibria and the price of anarchy in the family of network creation games considered extensively in the past few years, which attempt to unify the net...
STACS
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We consider the problem of representing, in a compressed format, a bitvector S of m bits with n 1s, supporting the following operations, where b ∈ {0, 1}:
STACS
2009
Springer
14 years 7 months ago
2009
Springer
STACS
2009
Springer
14 years 7 months ago
2009
Springer
STACS
2009
Springer
14 years 7 months ago
2009
Springer
STACS
2009
Springer
14 years 7 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
STACS
2009
Springer
14 years 7 months ago
2009
Springer