Sciweavers

1718 search results - page 127 / 344
» Communicating more than nothing
Sort
View
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
14 years 1 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young
PRDC
2002
IEEE
14 years 1 months ago
Energy Efficient and Robust Multicast Protocol for Mobile Ad Hoc Networks
This paper reevaluates the multicast protocols for MANETs in terms of energy efficiency and proposes a new robust multicast protocol, called Two-Tree Multicast (TTM). Multicast pr...
Sangman Moh, Chansu Yu, Ben Lee, Hee Yong Youn
ICALP
2001
Springer
14 years 22 days ago
Secure Games with Polynomial Expressions
Abstract. We present the first private information retrieval (PIR) scheme which is both, deterministically correct and has poly-logarithmic communication complexity. Our PIR proto...
Aggelos Kiayias, Moti Yung
BDA
1997
13 years 9 months ago
A Non-Blocking Single-Phase Commit Protocol for Rigorous Participants
Transactional standards have been promoted by OMG and X/Open to allow heterogeneous resources to participate in an Atomic Commitment Protocol (ACP), namely the two-phase commit pro...
Maha Abdallah, Philippe Pucheral
HPDC
2010
IEEE
13 years 9 months ago
LogGOPSim: simulating large-scale applications in the LogGOPS model
We introduce LogGOPSim--a fast simulation framework for parallel algorithms at large-scale. LogGOPSim utilizes a slightly extended version of the well-known LogGPS model in combin...
Torsten Hoefler, Timo Schneider, Andrew Lumsdaine