84 search results - page 9 / 17 » icalp 2010 |
161
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Given an ML function f : (int->int)->int how can we rigorously specify that f is pure, i.e., produces no side-effects other than those arising from calling its func...
140
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
157
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
133
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
We find “combinatorially optimal” (guaranteed by the degree-sequence alone) independent sets for graphs and hypergraps in linear space in the semi-streaming model. We also pr...
159
click to vote
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...