Sciweavers

2702 search results - page 152 / 541
» Message from the Editor
Sort
View
STOC
2005
ACM
132views Algorithms» more  STOC 2005»
16 years 6 months ago
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
Zeev Dvir, Amir Shpilka
PRDC
2007
IEEE
16 years 21 days ago
Implementation of a Flexible Membership Protocol on a Real-Time Ethernet Prototype
This paper describes the implementation of a processorgroup membership protocol in an experimental real-time network. The protocol is appropriate for fault-tolerant distributed sy...
Raul Barbosa, António Ferreira, Johan Karls...
COLCOM
2005
IEEE
16 years 1 days ago
SLACER: randomness to cooperation in peer-to-peer networks
Peer-to-peer applications can benefit from human friendship networks (e.g., e-mail contacts or instant message buddy lists). However these are not always available. We propose an...
David Hales, Stefano Arteconi, Özalp Babaoglu
EUROPAR
2005
Springer
15 years 12 months ago
Distributed Maintenance of a Spanning Tree Using Labeled Tree Encoding
Maintaining spanning trees in a distributed fashion is central to many networking applications. In this paper, we propose a self-stabilizing algorithm for maintaining a spanning tr...
Vijay K. Garg, Anurag Agarwal
ICCS
2004
Springer
15 years 11 months ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo