11345 search results - page 1677 / 2269 » Foundations of Computer Science |
173
click to vote
ICALP
2007
Springer
16 years 18 days 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 ...
176
click to vote
ICALP
2007
Springer
16 years 18 days 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...
174
Voted
ICALP
2007
Springer
16 years 18 days ago
2007
Springer
Abstract. State-based systems and modal logics for reasoning about them often heterogeneously combine a number of features such as non-determinism and probabilities. Here, we show ...
153
click to vote
ICALP
2007
Springer
16 years 18 days ago
2007
Springer
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
163
click to vote
ICALP
2007
Springer
16 years 18 days ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...