1716 search results - page 265 / 344 » Proving Conditional Termination |
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The automatic synthesis of programs from their specifications has been a dream of many researchers for decades. If we restrict to open finite-state reactive systems, th...
112
click to vote
TCC
2005
Springer
15 years 8 months ago
2005
Springer
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper...
125
click to vote
WAOA
2005
Springer
15 years 8 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
106
Voted
WCC
2005
Springer
15 years 8 months ago
2005
Springer
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
115
click to vote
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? W...