Sciweavers

37 search results - page 2 / 8
» Uniformity of Improved Versions of Chord
Sort
View
COCO
2009
Springer
155views Algorithms» more  COCO 2009»
13 years 12 months ago
Weak Derandomization of Weak Algorithms: Explicit Versions of Yao's Lemma
—A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x)] ≥ 1−ρ (where the probability is over the...
Ronen Shaltiel
COMPUTING
2010
13 years 2 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
SC
2004
ACM
13 years 10 months ago
A Peer-to-Peer Replica Location Service Based on a Distributed Hash Table
A Replica Location Service (RLS) allows registration and discovery of data replicas. In earlier work, we proposed an RLS framework and described the performance and scalability of...
Min Cai, Ann L. Chervenak, Martin R. Frank
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
13 years 3 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
JNW
2006
120views more  JNW 2006»
13 years 5 months ago
An EMST Based Look-up Protocol for Peer to Peer Networks
-- Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems a...
Tarun Bansal, Pankaj Ghanshani