Sciweavers

FSTTCS
2007
Springer
13 years 10 months ago
A Formal Investigation of
The diff3 algorithm is widely considered the gold standard for merging uncoordinated changes to list-structured data such as text files. Surprisingly, its fundamental properties h...
Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce
FSTTCS
2007
Springer
13 years 10 months ago
A Theory for Game Theories
Abstract. We explain a double-category (of positions and plays) attached to the theory of HOgames (those with the so-called switching condition [7]) from which the category of aren...
Michel Hirschowitz, André Hirschowitz, Tom ...
FSTTCS
2007
Springer
13 years 10 months ago
The Multicore Revolution
Maurice Herlihy
FSTTCS
2007
Springer
13 years 10 months ago
Closures and Modules Within Linear Logic Concurrent Constraint Programming
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
Rémy Haemmerlé, François Fage...
FSTTCS
2007
Springer
13 years 10 months ago
Non-mitotic Sets
We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • 1-tt-reducibility a...
Christian Glaßer, Alan L. Selman, Stephen D....
FSTTCS
2007
Springer
13 years 10 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
FSTTCS
2007
Springer
13 years 10 months ago
"Rent-or-Buy" Scheduling and Cost Coloring Problems
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
Takuro Fukunaga, Magnús M. Halldórss...
FSTTCS
2007
Springer
13 years 10 months ago
Covering Graphs with Few Complete Bipartite Subgraphs
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
Herbert Fleischner, Egbert Mujuni, Daniël Pau...