Sciweavers

112 search results - page 8 / 23
» Rounds in Communication Complexity Revisited
Sort
View
INFORMATICALT
2006
100views more  INFORMATICALT 2006»
13 years 7 months ago
Optimal Agreement in a Scale-Free Network Environment
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...
Shu-Ching Wang, Kuo-Qin Yan, Mao-Lun Chiang
SIGCOMM
2006
ACM
14 years 1 months ago
Revisiting IP multicast
This paper revisits a much explored topic in networking – the search for a simple yet fully-general multicast design. The many years of research into multicast routing have led ...
Sylvia Ratnasamy, Andrey Ermolinskiy, Scott Shenke...
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
13 years 12 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy
COCO
2005
Springer
110views Algorithms» more  COCO 2005»
14 years 1 months ago
Prior Entanglement, Message Compression and Privacy in Quantum Communication
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
ESAS
2004
Springer
14 years 1 months ago
Public Key Cryptography in Sensor Networks - Revisited
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Gunnar Gaubatz, Jens-Peter Kaps, Berk Sunar