Seguir
Joseph Seffi Naor
Joseph Seffi Naor
Dirección de correo verificada de cs.technion.ac.il
Título
Citado por
Citado por
Año
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
12071984
The budgeted maximum coverage problem
S Khuller, A Moss, JS Naor
Information processing letters 70 (1), 39-45, 1999
11811999
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
9881990
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
6032015
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
5382001
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
5022015
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
4582009
Approximating minimum feedback sets and multicuts in directed graphs
G Even, J Naor, B Schieber, M Sudan
Algorithmica 20, 151-174, 1998
453*1998
Online primal-dual algorithms for maximizing ad-auctions revenue
N Buchbinder, K Jain, J Naor
European Symposium on Algorithms, 253-264, 2007
3992007
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
3612014
Online primal-dual algorithms for covering and packing
N Buchbinder, J Naor
Mathematics of Operations Research 34 (2), 270-286, 2009
351*2009
The online set cover problem
N Alon, B Awerbuch, Y Azar
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
3342003
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
3301992
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
3142011
The competitiveness of on-line assignments
Y Azar, J Naor, R Rom
Journal of Algorithms 18 (2), 221-237, 1995
3081995
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
2872000
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
2812002
Approximating the throughput of multiple machines under real-time scheduling
A Bar-Noy, S Guha, J Naor, B Schieber
Proceedings of the thirty-first annual ACM symposium on Theory of Computing …, 1999
2671999
Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and Bayesian inference
R Bar-Yehuda, D Geiger, J Naor, RM Roth
SIAM journal on computing 27 (4), 942-959, 1998
2381998
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
2151994
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20