54 search results - page 11 / 11 » Proving Copyless Message Passing |
SPAA
2009
ACM
14 years 5 days ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
ICFP
2008
ACM
14 years 5 months ago
2008
ACM
Transactional events (TE) are an approach to concurrent programming that enriches the first-class synchronous message-passing of Concurrent ML (CML) with a combinator that allows ...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
ICCHP
2004
Springer
13 years 10 months ago
2004
Springer
: Multimedia and Hypermedia technologies can be successfully used in education and rehabilitation for cognitively disabled persons. In particular, storytelling has always proved su...