Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Awerbuch, Baruch - Department of Computer Science, Johns Hopkins University
Online Client-Server Load Balancing Without Global Information Baruch Awerbuch
Throughput-Competitive On-Line Routing Baruch Awerbuch
To appear in Proc. 27'th ACM Symposium on Theory Of Computing (STOC), May 1995 1 Improved Approximation Guarantees for MinimumWeight kTrees and
Tradeoffs in worst-case equilibria Baruch Awerbuch
Applying Static Network Protocols to Dynamic Networks Yehuda Afek \Lambda Baruch Awerbuch y Eli Gafni z
Distributed Algorithms for Multicommodity Flow Problems via Approximate Steepest Descent Framework
Consistent, Order-Preserving Data Management in Distributed Storage Systems
The Online Set Cover Problem (Extended Abstract)
Robust Random Number Generation for Peer-to-Peer Systems
The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments
Reducing Truth-telling Online Mechanisms to Online Optimization
Towards Scalable and Robust Overlay Networks Baruch Awerbuch
Competitive Routing of Virtual Circuits with Unknown Duration Baruch Awerbuch \Lambda
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios Ittai Abraham
A Denial-of-Service Resistant DHT Baruch Awerbuch 1
Group Spreading: A Protocol for Provably Secure Distributed Name Service
The Pulse Protocol: Energy Efficient Infrastructure Access
BuyatBulk Network Design Baruch Awerbuch \Lambda Yossi Azar y
High Throughput Route Selection in Multi-rate Ad Hoc Wireless Networks
Anycasting in Adversarial Systems: Routing and Admission Control
