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 × Spain
1 × Switzerland
1 × The Netherlands
10 × USA
2 × France
2 × United Kingdom
Collaborated with:
N.Buchbinder R.Schwartz S.Guha B.Schieber J.Chuzhoy N.Bansal M.Naor A.Bar-Noy M.Singh S.Khanna A.Freund M.Feldman C.Chekuri H.Shachnai T.Tamir D.Raz A.A.Schäffer R.Ravi N.Jain I.Menache F.B.Shepherd K.Jain A.Kazeykina R.Manokaran P.Raghavendra L.C.Lau M.R.Salavatipour R.Bhatia A.Moss N.Alon B.Awerbuch Y.Azar R.Bar-Yehuda E.Halperin G.Kortsarz
Talks about:
algorithm (6) approxim (6) schedul (4) problem (3) network (3) metric (3) hard (3) cut (3) constraint (2) bandwidth (2)

Person: Joseph Naor

DBLP DBLP: Naor:Joseph

Contributed to:

STOC 20132013
ICALP (1) 20122012
ICALP (2) 20122012
ICALP (1) 20112011
ICALP (1) 20102010
ICALP (2) 20102010
STOC 20082008
STOC 20072007
STOC 20052005
STOC 20042004
ICALP 20032003
STOC 20032003
ICALP 20022002
STOC 20002000
STOC 19991999
STOC 19981998
STOC 19901990
STOC 19871987

Wrote 23 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-v2-2012-JainMNS #migration #network #virtual machine
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks (NJ, IM, JN, FBS), pp. 586–597.
ICALP-v1-2011-FeldmanNS #algorithm
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm — (MF, JN, RS), pp. 342–353.
ICALP-v1-2010-BansalBN #problem
Metrical Task Systems and the k-Server Problem on HSTs (NB, NB, JN), pp. 287–298.
ICALP-v2-2010-BansalJKN #algorithm #approximate #ranking
Approximation Algorithms for Diversified Search Ranking (NB, KJ, AK, JN), pp. 273–284.
STOC-2008-BansalBN #algorithm #random
Randomized competitive algorithms for generalized caching (NB, NB, JN), pp. 235–244.
STOC-2008-ManokaranNRS #metric #multi
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling (RM, JN, PR, RS), pp. 11–20.
STOC-2007-LauNSS #constraints #design #network #order
Survivable network design with degree or order constraints (LCL, JN, MRS, MS), pp. 651–660.
STOC-2005-NaorS #metric
Balanced metric labeling (JN, RS), pp. 582–591.
STOC-2004-ChuzhoyGHKKN #approximate #symmetry
Asymmetric k-center is log* n-hard to approximate (JC, SG, EH, SK, GK, JN), pp. 21–27.
STOC-2004-ChuzhoyN #scheduling
New hardness results for congestion minimization and machine scheduling (JC, JN), pp. 28–34.
ICALP-2003-BhatiaCFN #algorithm #aspect-oriented
Algorithmic Aspects of Bandwidth Trading (RB, JC, AF, JN), pp. 751–766.
ICALP-2003-ChekuriGN #approximate
Approximating Steiner k-Cuts (CC, SG, JN), pp. 189–199.
ICALP-2003-NaorST #realtime #scheduling
Real-Time Scheduling with a Budget (JN, HS, TT), pp. 1123–1137.
STOC-2003-AlonAA #online #problem #set
The online set cover problem (NA, BA, YA, NB, JN), pp. 100–105.
ICALP-2002-KhannaNR #communication #protocol
Control Message Aggregation in Group Communication Protocols (SK, JN, DR), pp. 135–146.
STOC-2000-Bar-NoyBFNS #approach #approximate #resource management #scheduling
A unified approach to approximating resource allocation and scheduling (ABN, RBY, AF, JN, BS), pp. 735–744.
STOC-1999-Bar-NoyGNS #approximate #multi #realtime #scheduling #throughput
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling (ABN, SG, JN, BS), pp. 622–631.
STOC-1999-GuhaMNS #performance
Efficient Recovery from Power Outage (SG, AM, JN, BS), pp. 574–582.
STOC-1998-Bar-NoyGNS #multi #network
Multicasting in Heterogeneous Networks (ABN, SG, JN, BS), pp. 448–453.
STOC-1990-NaorN #performance #probability
Small-bias Probability Spaces: Efficient Constructions and Applications (JN, MN), pp. 213–223.
STOC-1987-NaorNS #algorithm #graph #parallel #performance
Fast Parallel Algorithms for Chordal Graphs (JN, MN, AAS), pp. 355–364.

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.