Sciweavers

5334 search results - page 281 / 1067
» Communicating quantum processes
Sort
View
CONCUR
2006
Springer
15 years 10 months ago
A Capability Calculus for Concurrency and Determinism
Abstract. We present a capability calculus for checking partial confluence of channel-communicating concurrent processes. Our approach automatically detects more programs to be par...
Tachio Terauchi, Alex Aiken
ICISC
2009
138views Cryptology» more  ICISC 2009»
15 years 3 months ago
Cryptanalysis of a Message Recognition Protocol by Mashatan and Stinson
At CANS 2008, Mashatan and Stinson suggested a message recognition protocol for ad hoc pervasive networks. The protocol provides a procedure to resynchronize in case of a (possibly...
Madeline González Muñiz, Rainer Stei...
SPAA
2009
ACM
16 years 29 days ago
Locally scalable randomized consensus for synchronous crash failures
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...
Bogdan S. Chlebus, Dariusz R. Kowalski
WORDS
2003
IEEE
15 years 11 months ago
An Optimal Atomic Broadcast Protocol and an Implementation Framework
Atomic Broadcast (where all processes deliver broadcast messages in the same order) is a very useful group communication primitive for building fault-tolerant distributed systems....
Paul D. Ezhilchelvan, Doug Palmer, Michel Raynal
ESORICS
2009
Springer
16 years 29 days ago
A Spatial Cloaking Framework Based on Range Search for Nearest Neighbor Search
For nearest neighbor search, a user queries a server for nearby points of interest (POIs) with his/her location information. Our aim is to protect the user’s sensitive informatio...
Hyoungshick Kim