BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × France
1 × United Kingdom
2 × USA
Collaborated with:
J.Naor N.Bansal R.Schwartz R.Ravi M.Singh N.Alon B.Awerbuch Y.Azar
Talks about:
problem (3) algorithm (2) onlin (2) constraint (1) exponenti (1) multiway (1) function (1) competit (1) approxim (1) simplex (1)

Person: Niv Buchbinder

DBLP DBLP: Buchbinder:Niv

Contributed to:

STOC 20132013
ICALP (1) 20122012
ICALP (1) 20102010
STOC 20082008
STOC 20032003

Wrote 5 papers:

STOC-2013-BuchbinderNS #clustering #exponential #multi #problem
Simplex partitioning via exponential clocks and the multiway cut problem (NB, JN, RS), pp. 535–544.
ICALP-v1-2012-BuchbinderNRS #algorithm #approximate #constraints #online #rank
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (NB, JN, RR, MS), pp. 145–156.
ICALP-v1-2010-BansalBN #problem
Metrical Task Systems and the k-Server Problem on HSTs (NB, NB, JN), pp. 287–298.
STOC-2008-BansalBN #algorithm #random
Randomized competitive algorithms for generalized caching (NB, NB, JN), pp. 235–244.
STOC-2003-AlonAA #online #problem #set
The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.
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.