Sciweavers

TCS
2010
13 years 5 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
TCS
2010
13 years 5 months ago
Towards practical feasibility of core computation in data exchange
Abstract. Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the c...
Reinhard Pichler, Vadim Savenkov
TCS
2010
13 years 5 months ago
Euclidean TSP on two polygons
We give an O(n2 m + nm2 + m2 log m) time and O(n2 + m2 ) space algorithm for finding the shortest traveling salesman tour through the vertices of two simple polygonal obstacles i...
Jeff Abrahamson, Ali Shokoufandeh
TCS
2010
13 years 5 months ago
Computing the graph-based parallel complexity of gene assembly
We consider a graph-theoretical formalization of the process of gene assembly in ciliates introduced in Ehrenfeucht et al (2003), where a gene is modeled as a signed graph. The ge...
Artiom Alhazov, Chang Li, Ion Petre
TCS
2010
13 years 5 months ago
Size versus stability in the marriage problem
Péter Biró, David Manlove, Shubham M...
TCS
2010
13 years 5 months ago
Comparing First-Fit and Next-Fit for online edge coloring
Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt...
TCS
2010
13 years 5 months ago
On the expressiveness of interaction
Subbisimilarity is proposed as a general tool to classify the relative expressive power of process calculi. The expressiveness of several variants of CCS is compared in terms of t...
Yuxi Fu, Hao Lu
TCS
2010
13 years 5 months ago
Arrows for secure information flow
This paper presents an embedded security sublanguage for enforcing informationflow policies in the standard Haskell programming language. The sublanguage provides useful informat...
Peng Li, Steve Zdancewic
TCS
2010
13 years 5 months ago
Non-cooperative facility location and covering games
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
Jean Cardinal, Martin Hoefer