Joseph Naor

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 21

Top Venues

CoRR

SODA

SIAM J. Comput.

Publications

Ilan Doron Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai
Approximations and Hardness of Packing Partially Ordered Items. CoRR (2024)
Ilan Doron Arad, Joseph Naor
Non-Linear Paging. CoRR (2024)
Joseph Naor, Aravind Srinivasan, David Wajc
Online Dependent Rounding Schemes. CoRR (2023)
Niv Buchbinder, Christian Coester, Joseph Naor
Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197 (2) (2023)
Christian Coester, Roie Levin, Joseph Naor, Ohad Talmon
Competitive Algorithms for Block-Aware Caching. CoRR (2022)
Niv Buchbinder, Joseph Naor, David Wajc
A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR (2021)
Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz
General Knapsack Problems in a Dynamic Setting. CoRR (2021)
Itay Hubara, Brian Chmiel, Moshe Island, Ron Banner, Joseph Naor, Daniel Soudry
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks. NeurIPS (2021)
Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai
-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR (2020)
Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor
Online Virtual Machine Allocation with Predictions. CoRR (2020)
Niv Buchbinder, Christian Coester, Joseph Naor
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR (2020)
Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz
NFV Placement in Resource-Scarce Edge Nodes. CCGRID (2020)
Joseph Naor, Seeun William Umboh, David P. Williamson
Tight Bounds for Online Weighted Tree Augmentation. CoRR (2019)
Dor Harris, Joseph Naor, Danny Raz
Latency Aware Placement in Multi-access Edge Computing. NetSoft (2018)
Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
k-Servers with a Smile: Online Algorithms via Projections. CoRR (2018)
Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR (2017)
Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico
Robust Submodular Maximization: Offline and Online Algorithms. CoRR (2017)
Roee Engelberg, Joseph Naor
Equilibria in Online Games. SIAM J. Comput. 45 (2) (2016)
Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41 (2) (2016)
Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS (2016)
Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh
Timing Matters: Online Dynamics in Broadcast Games. CoRR (2016)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44 (5) (2015)
Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz
Near optimal placement of virtual network functions. INFOCOM (2015)
Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv
Truthful Online Scheduling with Commitments. EC (2015)
Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
Near-Optimal Scheduling Mechanisms for Deadline-Sensitive Jobs in Large Computing Clusters. ACM Trans. Parallel Comput. 2 (1) (2015)
Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv
Truthful Online Scheduling with Commitments. CoRR (2015)
Moran Feldman, Liane Lewin-Eytan, Joseph Naor
Hedonic Clustering Games. ACM Trans. Parallel Comput. 2 (1) (2015)
Joseph Naor, David Wajc
Near-Optimum Online Ad Allocation for Targeted Advertising. EC (2015)
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
-Server Problem. J. ACM 62 (5) (2015)
Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
Frequency capping in online advertising. J. Sched. 17 (4) (2014)
Niv Buchbinder, Shahar Chen, Joseph Naor
Competitive Analysis via Regularization. SODA (2014)
Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz
On the effect of forwarding table size on SDN network utilization. INFOCOM (2014)
Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv
Brief announcement: deadline-aware scheduling of big-data processing jobs. SPAA (2014)
Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor
Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction. IEEE Syst. J. 8 (2) (2014)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
Submodular Maximization with Cardinality Constraints. SODA (2014)
Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor
Online Packing and Covering Framework with Convex Objectives. CoRR (2014)
Joseph Naor, David Wajc
Near-Optimum Online Ad Allocation for Targeted Advertising. CoRR (2014)
Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68 (2) (2014)
Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar
Non-Uniform Graph Partitioning. SODA (2014)
Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Theory Comput. Syst. 54 (3) (2014)
Niv Buchbinder, Shahar Chen, Joseph Naor
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA (2014)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion. SIAM J. Comput. 43 (2) (2014)
Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv
Efficient online scheduling for deadline-sensitive jobs: extended abstract. SPAA (2013)
Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz
Almost optimal virtual machine placement for traffic intense data centers. INFOCOM (2013)
Niv Buchbinder, Joseph Naor
Fair online load balancing. J. Sched. 16 (1) (2013)
Niv Buchbinder, Joseph Naor, Roy Schwartz
Simplex partitioning via exponential clocks and the multiway cut problem. STOC (2013)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS (2012)
Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) (2012)
Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor
The load-distance balancing problem. Networks 59 (1) (2012)
Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) (2012)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59 (4) (2012)
Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints CoRR (2012)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41 (2) (2012)
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. 20 (2) (2012)
Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
Unified Algorithms for Online Learning and Competitive Analysis. COLT (2012)
Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. SPAA (2012)
Moran Feldman, Liane Lewin-Eytan, Joseph Naor
Hedonic clustering games. SPAA (2012)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-Max Graph Partitioning and Small Set Expansion CoRR (2011)
Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor
Data-quality-aware volume reduction in smart grid networks. SmartGridComm (2011)
Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz
Min-max Graph Partitioning and Small Set Expansion. FOCS (2011)
Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
Frequency Capping in Online Advertising. WADS (2011)
Moran Feldman, Joseph Naor, Roy Schwartz
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS (2011)
Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. SAGT (2011)
Moran Feldman, Joseph Naor, Roy Schwartz
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) (2011)
Joseph Naor, Debmalya Panigrahi, Mohit Singh
Online Node-Weighted Steiner Tree and Related Problems. FOCS (2011)
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
A Polylogarithmic-Competitive Algorithm for the k-Server Problem CoRR (2011)
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS (2011)
Moran Feldman, Joseph Naor, Roy Schwartz
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM (2011)
Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA (2011)
Joseph Naor, Roy Schwartz
The directed circular arrangement problem. ACM Trans. Algorithms 6 (3) (2010)
Moran Feldman, Joseph Naor
Non-Preemptive Buffer Management for Latency Sensitive Packets. INFOCOM (2010)
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47 (1) (2010)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA (2010)
Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor
Approximation Algorithms for Diversified Search Ranking. ICALP (2) (2010)
Joseph Naor, Adi Rosén, Gabriel Scalosub
Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms 8 (4) (2010)
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM (2010)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
-Server Problem on HSTs. ICALP (1) (2010)
Niv Buchbinder, Joseph Naor
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. 3 (2-3) (2009)
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
The Online Set Cover Problem. SIAM J. Comput. 39 (2) (2009)
Niv Buchbinder, Joseph Naor
Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34 (2) (2009)
Robert Krauthgamer, Joseph Naor, Roy Schwartz
Partitioning graphs into balanced components. SODA (2009)
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39 (3) (2009)
Joseph Naor, Danny Raz, Gabriel Scalosub
Toward Optimal Utilization of Shared Random Access Channels. INFOCOM (2009)
Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai
Throughput maximization of real-time scheduling with batching. ACM Trans. Algorithms 5 (2) (2009)
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM (2009)
Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks
Online multicast with egalitarian cost sharing. SPAA (2008)
Joseph Naor, Danny Raz, Gabriel Scalosub
Homogeneous Interference Game in Wireless Networks. WINE (2008)
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-cooperative Cost Sharing Games Via Subsidies. SAGT (2008)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
Randomized competitive algorithms for generalized caching. STOC (2008)
Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph Naor, Baruch Schieber
Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees. Theory Comput. Syst. 42 (1) (2008)
Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC (2008)
Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha
On the approximability of some network design problems. ACM Trans. Algorithms 4 (2) (2008)
Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Maximum-lifetime routing: system optimization & game-theoretic perspectives. MobiHoc (2007)
Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor
Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms 3 (1) (2007)
Roee Engelberg, Joseph Naor
Equilibria in online games. SODA (2007)
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-Cooperative Multicast and Facility Location Games. IEEE J. Sel. Areas Commun. 25 (6) (2007)
Niv Buchbinder, Kamal Jain, Joseph Naor
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA (2007)
David Amzallag, Joseph Naor, Danny Raz
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks. INFOCOM (2007)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS (2007)
Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh
Survivable network design with degree or order constraints. STOC (2007)

Joseph Naor.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Joseph Naor