BibSLEIGH — Baruch

Travelled to:

1 × Finland
1 × The Netherlands
11 × USA
3 × Canada

Collaborated with:

Y.Azar ∅ C.Scheideler D.Peleg R.Khandekar A.Fiat S.Kutten R.D.Kleinberg T.Singh T.Leighton B.Patt-Shamir A.Epstein A.Brinkmann A.Meyerson L.Cowen M.A.Smith Y.Bartal A.Israeli Y.Shiloach S.Leonardi O.Regev F.T.Leighton A.Blum S.Vempala W.Aiello B.M.Maggs S.Rao M.E.Saks A.Bar-Noy N.Linial N.Alon N.Buchbinder J.Naor Y.Mansour G.Varghese F.M.Manshadi R.Gemula J.Mestre M.Sozio

Talks about:

distribut (10) algorithm (5) rout (5) network (4) onlin (4) time (4) asynchron (3) competit (3) approxim (3) problem (3)

Person: Baruch Awerbuch

DBLP: Awerbuch:Baruch

Contributed to:

2013

2008

2005

2004

2003

1999

1997

1996

1995

1994

1993

1992

1989

1987

1984

Wrote 24 papers:

VLDB-2013-ManshadiAGKMS #algorithm #distributed #scalability: A Distributed Algorithm for Large-Scale Generalized Matching (FMM, BA, RG, RK, JM, MS), pp. 613–624.
STOC-2008-AwerbuchK #distributed #linear #source code: Stateless distributed gradient descent for positive linear programs (BA, RK), pp. 691–700.
STOC-2005-AwerbuchAE #scalability: Large the price of routing unsplittable flow (BA, YA, AE), pp. 57–66.
ICALP-2004-AwerbuchS #distributed #protocol: Group Spreading: A Protocol for Provably Secure Distributed Name Service (BA, CS), pp. 183–195.
STOC-2004-AwerbuchK #adaptation #distributed #feedback #geometry #learning: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches (BA, RDK), pp. 45–53.
ICALP-2003-AwerbuchBS: Anycasting in Adversarial Systems: Routing and Admission Control (BA, AB, CS), pp. 1153–1168.
STOC-2003-AlonAA #online #problem #set: The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.
STOC-2003-AwerbuchAM #online #optimisation: Reducing truth-telling online mechanisms to online optimization (BA, YA, AM), pp. 503–510.
STOC-1999-AwerbuchALR #migration: Minimizing the Flow Time Without Migration (BA, YA, SL, OR), pp. 198–205.
STOC-1997-AwerbuchS #algorithm #multi #online: Online Algorithms for Selective Multicast and Maximal Dense Trees (BA, TS), pp. 354–362.
STOC-1996-AwerbuchAFL #how #nondeterminism: Making Commitments in the Face of Uncertainty: How to Pick a Winner Almost Every Time (BA, YA, AF, FTL), pp. 519–530.
STOC-1995-AwerbuchABV #approximate: Improved approximation guarantees for minimum-weight k-trees and prize-collecting salesmen (BA, YA, AB, SV), pp. 277–283.
STOC-1994-AwerbuchCS #distributed #performance #symmetry: Efficient asynchronous distributed symmetry breaking (BA, LC, MAS), pp. 214–223.
STOC-1994-AwerbuchL #algorithm #approximate #multi #network #problem: Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks (BA, TL), pp. 487–496.
STOC-1993-AielloAMR #approximate #network: Approximate load balancing on dynamic and asynchronous networks (WA, BA, BMM, SR), pp. 632–641.
STOC-1993-AwerbuchBF #distributed: Competitive distributed file allocation (BA, YB, AF), pp. 164–173.
STOC-1993-AwerbuchKMPV #self: Time optimal self-stabilizing synchronization (BA, SK, YM, BPS, GV), pp. 652–661.
STOC-1992-AwerbuchKP #distributed #scheduling: Competitive Distributed Job Scheduling (BA, SK, DP), pp. 571–580.
STOC-1992-AwerbuchPPS #adaptation #network: Adapting to Asynchronous Dynamic Networks (BA, BPS, DP, MES), pp. 557–570.
STOC-1989-Awerbuch #algorithm #distributed: Distributed Shortest Paths Algorithms (BA), pp. 490–500.
STOC-1989-AwerbuchBLP #adaptation #data type #distributed: Compact Distributed Data Structures for Adaptive Routing (BA, ABN, NL, DP), pp. 479–489.
STOC-1987-Awerbuch #algorithm #distributed #problem #summary: Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems (Detailed Summary) (BA), pp. 230–240.
STOC-1984-Awerbuch #network #performance #protocol: An Efficient Network Synchronization Protocol (BA), pp. 522–525.
STOC-1984-AwerbuchIS #parallel: Finding Euler Circuits in Logarithmic Parallel Time (BA, AI, YS), pp. 249–257.