5377 search results - page 871 / 1076 » Programming Languages For Interactive Computing |
119
Voted
CC
2007
Springer
15 years 9 months ago
2007
Springer
Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the...
123
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
132
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
127
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
140
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Motivated by the challenging task of designing “secure” vote storage mechanisms, we study information storage mechanisms that operate in extremely hostile environments. In suc...