BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Germany
1 × Iceland
1 × Japan
1 × United Kingdom
2 × Canada
2 × Greece
9 × USA
Collaborated with:
I.Gamzu B.Awerbuch I.R.Cohen A.Fiat Y.Richter A.R.Karlin A.Epstein A.Z.Broder S.Leonardi X.Yin A.Meyerson S.Kamara F.B.Shepherd O.Regev F.T.Leighton A.Blum S.Vempala E.Upfal A.Madry T.Moscibroda D.Panigrahi A.Srinivasan B.E.Birnbaum C.Mathieu C.T.Nguyen N.Alon N.Buchbinder J.Naor E.Cohen H.Kaplan H.Räcke F.McSherry J.Saia J.Aspnes S.A.Plotkin O.Waarts N.Linial S.Phillips Y.Bartal E.Feuerstein A.Rosén
Talks about:
onlin (4) network (3) time (3) rout (3) pack (3) flow (3) approxim (2) schedul (2) program (2) switch (2)

Person: Yossi Azar

DBLP DBLP: Azar:Yossi

Contributed to:

ICALP (1) 20152015
STOC 20132013
ICALP (1) 20122012
ICALP (2) 20092009
STOC 20092009
ICALP (1) 20082008
STOC 20052005
STOC 20042004
STOC 20032003
STOC 20012001
STOC 19991999
ICALP 19961996
STOC 19961996
STOC 19951995
STOC 19941994
STOC 19931993
STOC 19921992

Wrote 23 papers:

Serving in the Dark should be done Non-Uniformly (YA, IRC), pp. 91–102.
The loss of serving in the dark (YA, IRC, IG), pp. 951–960.
STOC-2013-AzarCKS #bound #online
Tight bounds for online vector bin packing (YA, IRC, SK, FBS), pp. 961–970.
ICALP-v1-2012-AzarG #constraints #linear #performance
Efficient Submodular Function Maximization under Linear Packing Constraints (YA, IG), pp. 38–50.
ICALP-v2-2009-AzarMMPS #adaptation #network
Maximum Bipartite Flow in Networks with Adaptive Channel Width (YA, AM, TM, DP, AS), pp. 351–362.
STOC-2009-AzarGY #multi #ranking
Multiple intents re-ranking (YA, IG, XY), pp. 669–678.
ICALP-A-2008-AzarBKMN #algorithm #approximate
Improved Approximation Algorithms for Budgeted Allocations (YA, BEB, ARK, CM, CTN), pp. 186–197.
ICALP-A-2008-AzarG #framework #integer #source code #unification
Truthful Unification Framework for Packing Integer Programs with Choices (YA, IG), pp. 833–844.
STOC-2005-AwerbuchAE #scalability
Large the price of routing unsplittable flow (BA, YA, AE), pp. 57–66.
STOC-2005-AzarE #parallel #programming #scheduling
Convex programming for scheduling unrelated parallel machines (YA, AE), pp. 331–337.
STOC-2004-AzarR #network
The zero-one principle for switching networks (YA, YR), pp. 64–71.
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-2003-AzarCFKR #polynomial
Optimal oblivious routing in polynomial time (YA, EC, AF, HK, HR), pp. 383–388.
STOC-2003-AzarR #multi #network
Management of multi-queue switches in QoS networks (YA, YR), pp. 82–89.
STOC-2001-AzarFKMS #analysis
Spectral analysis of data (YA, AF, ARK, FM, JS), pp. 619–626.
STOC-1999-AwerbuchALR #migration
Minimizing the Flow Time Without Migration (BA, YA, SL, OR), pp. 198–205.
ICALP-1996-AzarBFFLR #on the
On Capital Investment (YA, YB, EF, AF, SL, AR), pp. 429–441.
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.
Balanced allocations (YA, AZB, ARK, EU), pp. 593–602.
STOC-1993-AspnesAFPW #online #scheduling
On-line load balancing with applications to machine scheduling and virtual circuit routing (JA, YA, AF, SAP, OW), pp. 623–631.
STOC-1992-AzarBKLP #random
Biased Random Walks (YA, AZB, ARK, NL, SP), pp. 1–9.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.