Sciweavers

Share
FCT
2007
Springer
8 years 12 months ago
On the Complexity of Kings
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
FCT
2007
Springer
9 years 2 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
FCT
2007
Springer
9 years 2 months ago
On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time
We investigate issues regarding two hard problems related to voting, the optimal weighted lobbying problem and the winner problem for Dodgson elections. Regarding the former, Chris...
Gábor Erdélyi, Lane A. Hemaspaandra,...
FCT
2007
Springer
9 years 2 months ago
Multi-dimensional Packing with Conflicts
We study the multi-dimensional version of the bin packing problem with conflicts. We are given a set of squares V = {1, 2, . . . , n} with sides s1, s2, . . . , sn [0, 1] and a co...
Leah Epstein, Asaf Levin, Rob van Stee
FCT
2007
Springer
9 years 2 months ago
Productivity of Stream Definitions
We give an algorithm for deciding productivity of a large and natural class of recursive stream definitions. A stream definition is called `productive' if it can be evaluated ...
Jörg Endrullis, Clemens Grabmayer, Dimitri He...
FCT
2007
Springer
9 years 2 months ago
Factorisation Forests for Infinite Words
The theorem of factorisation forests shows the existence of nested factorisations -- a la Ramsey -- for finite words. This theorem has important applications in semigroup theory, a...
Thomas Colcombet
FCT
2007
Springer
9 years 2 months ago
Local Testing of Message Sequence Charts Is Difficult
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. N...
FCT
2007
Springer
9 years 4 months ago
Complexity of Pebble Tree-Walking Automata
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
Mathias Samuelides, Luc Segoufin
books