A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...
Model composition helps designers managing complexities by modeling different system views separately, and later compose them into an integrated model. In the past years, researche...
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, Dav...
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...