78 search results - page 9 / 16 » Clock Synchronization: Open Problems in Theory and Practice |
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
IMCS
2007
13 years 7 months ago
2007
Purpose – This paper aims to report on the results of an analysis of the computer security problem space, to suggest the areas with highest potential for making progress in the ...
CSL
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
TIT
1998
13 years 7 months ago
1998
—Constrained codes are a key component in the digital recording devices that have become ubiquitous in computer data storage and electronic entertainment applications. This paper...
ESORICS
2010
Springer
13 years 8 months ago
2010
Springer
Fair exchange is one of the most fundamental problems in secure distributed computation. Alice has something that Bob wants, and Bob has something that Alice wants. A fair exchang...