35 search results - page 7 / 7 » Non-deterministic Computations in ELAN |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
SIGECOM
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of a spatially distributed market with strategic agents. A single good is traded in a set of independent markets, where shipment between markets is possibl...
PADL
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Static software checking tools are useful as an additional automated software inspection step that can easily be integrated in the development cycle and assist in creating secure,...
SIGCOMM
1998
ACM
13 years 9 months ago
1998
ACM
Several recent proposals for an “active networks” architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range...