Follow
Joseph Seffi Naor
Joseph Seffi Naor
Verified email at cs.technion.ac.il
Title
Cited by
Cited by
Year
Multiple resolution texture analysis and classification
S Peleg, J Naor, R Hartley, D Avnir
IEEE Transactions on Pattern Analysis and Machine Intelligence, 518-523, 1984
11911984
The budgeted maximum coverage problem
S Khuller, A Moss, JS Naor
Information processing letters 70 (1), 39-45, 1999
10671999
Small-bias probability spaces: Efficient constructions and applications
J Naor, M Naor
Proceedings of the twenty-second annual ACM symposium on Theory of computing …, 1990
9311990
Near optimal placement of virtual network functions
R Cohen, L Lewin-Eytan, JS Naor, D Raz
2015 IEEE Conference on Computer Communications (INFOCOM), 1346-1354, 2015
5462015
A unified approach to approximating resource allocation and scheduling
A Bar-Noy, R Bar-Yehuda, A Freund, J Naor, B Schieber
Journal of the ACM (JACM) 48 (5), 1069-1090, 2001
5122001
A tight linear time (1/2)-approximation for unconstrained submodular maximization
N Buchbinder, M Feldman, J Seffi, R Schwartz
SIAM Journal on Computing 44 (5), 1384-1402, 2015
4382015
Approximating minimum feedback sets and multicuts in directed graphs
G Even, J Naor, B Schieber, M Sudan
Algorithmica 20, 151-174, 1998
404*1998
The design of competitive online algorithms via a primal–dual approach
N Buchbinder, JS Naor
Foundations and Trends® in Theoretical Computer Science 3 (2–3), 93-263, 2009
4002009
Online primal-dual algorithms for maximizing ad-auctions revenue
N Buchbinder, K Jain, J Naor
Algorithms–ESA 2007: 15th Annual European Symposium, Eilat, Israel, October …, 2007
3692007
Online primal-dual algorithms for covering and packing
N Buchbinder, J Naor
Mathematics of Operations Research 34 (2), 270-286, 2009
315*2009
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
N Alon, J Bruck, J Naor, M Naor, RM Roth
IEEE Transactions on information theory 38 (2), 509-516, 1992
3141992
The competitiveness of on-line assignments
Y Azar, J Naor, R Rom
Journal of Algorithms 18 (2), 221-237, 1995
3091995
Submodular maximization with cardinality constraints
N Buchbinder, M Feldman, J Naor, R Schwartz
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
2932014
The online set cover problem
N Alon, B Awerbuch, Y Azar
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2932003
Minimizing service and operation costs of periodic scheduling
A Bar-Noy, R Bhatia, J Naor, B Schieber
Mathematics of Operations Research 27 (3), 518-544, 2002
2782002
A unified continuous greedy algorithm for submodular maximization
M Feldman, J Naor, R Schwartz
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 570-579, 2011
2772011
Divide-and-conquer approximation algorithms via spreading metrics
G Even, JS Naor, S Rao, B Schieber
Journal of the ACM (JACM) 47 (4), 585-616, 2000
2752000
Approximating the throughput of multiple machines in real-time scheduling
A Bar-Noy, S Guha, J Naor, B Schieber
SIAM Journal on Computing 31 (2), 331-352, 2001
2332001
Simple and fast algorithms for linear and integer programs with two variables per inequality
DS Hochbaum, J Naor
SIAM Journal on Computing 23 (6), 1179-1192, 1994
2071994
Scheduling split intervals
R Bar-Yehuda, MM Halldórsson, J Naor, H Shachnai, I Shapira
SIAM Journal on Computing 36 (1), 1-15, 2006
2022006
The system can't perform the operation now. Try again later.
Articles 1–20