The following pages link to Baruch Awerbuch (Q202104):
Displaying 50 items.
- (Q588489) (redirect page) (← links)
- Fast distributed network decompositions and covers (Q676658) (← links)
- Towards a scalable and robust DHT (Q733718) (← links)
- Tell me who I am: An interactive recommendation system (Q733719) (← links)
- Competitive collaborative learning (Q959897) (← links)
- Robust random number generation for peer-to-peer systems (Q1004308) (← links)
- A new distributed depth-first-search algorithm (Q1062756) (← links)
- Maximizing job benefits on-line (Q1348735) (← links)
- Competitive distributed file allocation. (Q1427858) (← links)
- Piecemeal graph exploration by a mobile robot. (Q1854296) (← links)
- On-line generalized Steiner problem (Q1887091) (← links)
- Greedy distributed optimization of multi-commodity flows (Q2377262) (← links)
- Online linear optimization and adaptive routing (Q2462507) (← links)
- Collaborate with strangers to find own preferences (Q2471699) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- (Q2753725) (← links)
- Efficient asynchronous distributed symmetry breaking (Q2817612) (← links)
- Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (Q2817640) (← links)
- Minimizing the flow time without migration (Q2819546) (← links)
- Online client-server load balancing without global information (Q2921671) (← links)
- Improved recommendation systems (Q2921791) (← links)
- Distributed algorithms for multicommodity flow problems via approximate steepest descent framework (Q2933631) (← links)
- A jamming-resistant MAC protocol for single-hop wireless networks (Q2934331) (← links)
- Stateless distributed algorithms for near optimal maximum multicommodity flows (Q2934365) (← links)
- (Q2934686) (← links)
- Peer-to-peer systems for prefix search (Q2943751) (← links)
- Adapting to a reliable network path (Q2943777) (← links)
- A general approach to online network optimization problems (Q2944534) (← links)
- Slide—The Key to Polynomial End-to-End Communication (Q3125223) (← links)
- (Q3128890) (← links)
- (Q3128891) (← links)
- Minimizing the Flow Time Without Migration (Q3149872) (← links)
- Improved routing strategies with succinct tables (Q3212257) (← links)
- Optimal maintenance of a spanning tree (Q3452184) (← links)
- A trade-off between information and communication in broadcast protocols (Q3474265) (← links)
- On the effects of feedback in dynamic network protocols (Q3485849) (← links)
- Localized Client-Server Load Balancing without Global Information (Q3519396) (← links)
- A Denial-of-Service Resistant DHT (Q3523197) (← links)
- The Online Set Cover Problem (Q3558005) (← links)
- (Q3579479) (← links)
- Adaptive routing with end-to-end feedback (Q3580958) (← links)
- The online set cover problem (Q3581267) (← links)
- Reducing truth-telling online mechanisms to online optimization (Q3581276) (← links)
- Stateless Distributed Gradient Descent for Positive Linear Programs (Q3654384) (← links)
- Complexity of network synchronization (Q3765248) (← links)
- A new distributed algorithm to find breadth first search trees (Q3766873) (← links)
- Reducing complexities of the distributed max-flow and breadth-first-search algorithms by means of network synchronization (Q3787764) (← links)
- (Q3790654) (← links)
- (Q3796744) (← links)
- (Q3823129) (← links)
