Sciweavers

1497 search results - page 186 / 300
» A Computational Model for Message Passing
Sort
View
ICDCS
2009
IEEE
14 years 5 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
PDP
2006
IEEE
14 years 2 months ago
A Hierarchical Consensus Protocol for Mobile Ad Hoc Networks
Mobile ad hoc networks (MANETs) raise new challenges in designing protocols for solving the consensus problem. Among the others, how to design message efficient protocols so as to...
Weigang Wu, Jiannong Cao, Jin Yang, Michel Raynal
ASIACRYPT
2003
Springer
14 years 1 months ago
Generalized Powering Functions and Their Application to Digital Signatures
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
Hisayoshi Sato, Tsuyoshi Takagi, Satoru Tezuka, Ka...
MIDDLEWARE
2009
Springer
14 years 22 days ago
How to Keep Your Head above Water While Detecting Errors
Today’s distributed systems need runtime error detection to catch errors arising from software bugs, hardware errors, or unexpected operating conditions. A prominent class of err...
Ignacio Laguna, Fahad A. Arshad, David M. Grothe, ...
EUROPAR
2006
Springer
13 years 12 months ago
A Practical Single-Register Wait-Free Mutual Exclusion Algorithm on Asynchronous Networks
This paper is motivated by a need of practical asynchronous network systems, i.e., a wait-free distributed mutual exclusion algorithm (WDME). The WDME algorithm is very appealing w...
Hyungsoo Jung, Heon Young Yeom