default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoseph Naor
Seffi Naor – Joseph (Seffi) Naor
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c152]Tomer Lange
, Joseph (Seffi) Naor, Gala Yadgar:
Optimal SSD Management with Predictions. SIGMETRICS (Abstracts) 2025: 52-54- [c151]Joseph (Seffi) Naor, Aravind Srinivasan, David Wajc:
Online Dependent Rounding Schemes for Bipartite Matchings, with. SODA 2025: 3116-3154 - 2024
- [c150]Yaron Fairstein, Joseph (Seffi) Naor, Tomer Tsachor:
Distributional Online Weighted Paging with Limited Horizon. APPROX/RANDOM 2024: 15:1-15:15 - [c149]Ilan Doron-Arad, Joseph (Seffi) Naor:
Non-Linear Paging. ICALP 2024: 57:1-57:19 - [c148]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
SSD Wear Leveling with Optimal Guarantees. SOSA 2024: 306-320 - [c147]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Covering and Packing Partially Ordered Items. WG 2024: 166-180 - [i22]Ilan Doron-Arad, Guy Kortsarz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Approximations and Hardness of Packing Partially Ordered Items. CoRR abs/2403.01568 (2024) - [i21]Ilan Doron-Arad, Joseph Naor:
Non-Linear Paging. CoRR abs/2404.13334 (2024) - 2023
- [j103]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
Offline and Online Algorithms for SSD Management. Commun. ACM 66(7): 129-137 (2023) - [j102]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197(2): 499-527 (2023) - [c146]Niv Buchbinder, Joseph (Seffi) Naor, David Wajc:
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA 2023: 2030-2068 - [i20]Joseph Naor, Aravind Srinivasan, David Wajc:
Online Dependent Rounding Schemes. CoRR abs/2301.08680 (2023) - 2022
- [j101]Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. Algorithmica 84(2): 304-324 (2022) - [j100]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
An almost optimal approximation algorithm for monotone submodular multiple knapsack. J. Comput. Syst. Sci. 125: 149-165 (2022) - [c145]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
Offline and Online Algorithms for SSD Management. SIGMETRICS (Abstracts) 2022: 89-90 - [c144]Christian Coester, Roie Levin, Joseph (Seffi) Naor, Ohad Talmon:
Competitive Algorithms for Block-Aware Caching. SPAA 2022: 161-172 - [e2]Joseph (Seffi) Naor, Niv Buchbinder:
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. SIAM 2022, ISBN 978-1-61197-707-3 [contents] - [i19]Christian Coester, Roie Levin, Joseph Naor, Ohad Talmon:
Competitive Algorithms for Block-Aware Caching. CoRR abs/2205.12249 (2022) - 2021
- [j99]Alfredo Torrico, Mohit Singh, Sebastian Pokutta, Nika Haghtalab, Joseph (Seffi) Naor, Nima Anari:
Structured Robust Submodular Maximization: Offline and Online Algorithms. INFORMS J. Comput. 33(4): 1590-1607 (2021) - [j98]Tomer Lange, Joseph (Seffi) Naor, Gala Yadgar:
Offline and Online Algorithms for SSD Management. Proc. ACM Meas. Anal. Comput. Syst. 5(3): 33:1-33:28 (2021) - [j97]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. ACM Trans. Economics and Comput. 9(2): 11:1-11:22 (2021) - [c143]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. APPROX-RANDOM 2021: 15:1-15:18 - [c142]Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor:
Invited Talks. CIAC 2021: 3-19 - [c141]Joseph (Seffi) Naor:
Recent Advances in Competitive Analysis of Online Algorithms. CIAC 2021: 19 - [c140]Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. IPCO 2021: 15-29 - [c139]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: 21099-21111 - [c138]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor:
Online Virtual Machine Allocation with Lifetime and Load Predictions. SIGMETRICS (Abstracts) 2021: 9-10 - [c137]Nikhil Bansal, Joseph (Seffi) Naor, Ohad Talmon:
Efficient Online Weighted Multi-Level Paging. SPAA 2021: 94-104 - [i18]Itay Hubara, Brian Chmiel, Moshe Island, Ron Banner, Seffi Naor, Daniel Soudry:
Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N: M Transposable Masks. CoRR abs/2102.08124 (2021) - [i17]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz:
General Knapsack Problems in a Dynamic Setting. CoRR abs/2105.00882 (2021) - [i16]Niv Buchbinder, Joseph Naor, David Wajc:
A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR abs/2106.04863 (2021) - 2020
- [c136]Yaron Fairstein, Dor Harris, Joseph Naor, Danny Raz:
NFV Placement in Resource-Scarce Edge Nodes. CCGRID 2020: 51-60 - [c135]Yaron Fairstein, Ariel Kulik, Joseph (Seffi) Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. ESA 2020: 44:1-44:19 - [i15]Yaron Fairstein, Ariel Kulik, Joseph Naor, Danny Raz, Hadas Shachnai:
A (1-e-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem. CoRR abs/2004.12224 (2020) - [i14]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor:
Online Virtual Machine Allocation with Predictions. CoRR abs/2011.06250 (2020) - [i13]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR abs/2012.02226 (2020)
2010 – 2019
- 2019
- [c134]Nima Anari, Nika Haghtalab, Seffi Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Structured Robust Submodular Maximization: Offline and Online Algorithms. AISTATS 2019: 3128-3137 - [c133]Joseph (Seffi) Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. ICALP 2019: 88:1-88:14 - [c132]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor:
k-Servers with a Smile: Online Algorithms via Projections. SODA 2019: 98-116 - [i12]Joseph Naor, Seeun William Umboh, David P. Williamson:
Tight Bounds for Online Weighted Tree Augmentation. CoRR abs/1904.11777 (2019) - 2018
- [j96]Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz:
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47(4): 1463-1482 (2018) - [j95]Joseph (Seffi) Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. ACM Trans. Economics and Comput. 6(3-4): 16:1-16:20 (2018) - [c131]Virajith Jalaparti, Chris Douglas, Mainak Ghosh, Ashvin Agrawal, Avrilia Floratou, Srikanth Kandula, Ishai Menache, Joseph (Seffi) Naor, Sriram Rao:
Netco: Cache and I/O Management for Analytics over Disaggregated Stores. SoCC 2018: 186-198 - [c130]Dor Harris, Joseph Naor, Danny Raz:
Latency Aware Placement in Multi-access Edge Computing. NetSoft 2018: 132-140 - [c129]Yaron Fairstein, Seffi Naor, Danny Raz:
Algorithms for Dynamic NFV Workload. WAOA 2018: 238-258 - [c128]Shuchi Chawla, Joseph (Seffi) Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. WINE 2018: 80-95 - [i11]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor:
k-Servers with a Smile: Online Algorithms via Projections. CoRR abs/1810.07508 (2018) - 2017
- [j94]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A greedy approximation algorithm for minimum-gap scheduling. J. Sched. 20(3): 279-292 (2017) - [j93]Moran Feldman, Joseph (Seffi) Naor:
Non-preemptive buffer management for latency sensitive packets. J. Sched. 20(4): 337-353 (2017) - [c127]Shahar Chen, Dotan Di Castro, Zohar S. Karnin, Liane Lewin-Eytan, Joseph (Seffi) Naor, Roy Schwartz:
Correlated Rounding of Multiple Uniform Matroids and Multi-Label Classification. ICALP 2017: 34:1-34:15 - [c126]Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [i10]Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR abs/1701.01936 (2017) - [i9]Nima Anari, Nika Haghtalab, Joseph Naor, Sebastian Pokutta, Mohit Singh, Alfredo Torrico:
Robust Submodular Maximization: Offline and Online Algorithms. CoRR abs/1710.04740 (2017) - 2016
- [j92]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41(2): 612-625 (2016) - [j91]Roee Engelberg, Joseph Naor:
Equilibria in Online Games. SIAM J. Comput. 45(2): 232-267 (2016) - [c125]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: 148-157 - [c124]Noa Elad, Satyen Kale, Joseph (Seffi) Naor:
Online Semidefinite Programming. ICALP 2016: 40:1-40:13 - [i8]Shuchi Chawla, Joseph Naor, Debmalya Panigrahi, Mohit Singh, Seeun William Umboh:
Timing Matters: Online Dynamics in Broadcast Games. CoRR abs/1611.07745 (2016) - 2015
- [j90]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - [j89]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [j88]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): 3:1-3:29 (2015) - [j87]Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic Clustering Games. ACM Trans. Parallel Comput. 2(1): 4:1-4:48 (2015) - [c123]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
Near optimal placement of virtual network functions. INFOCOM 2015: 1346-1354 - [c122]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. EC 2015: 131-148 - [c121]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. EC 2015: 715-732 - [i7]Yossi Azar, Inna Kalp-Shaltiel, Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Truthful Online Scheduling with Commitments. CoRR abs/1507.00773 (2015) - 2014
- [j86]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68(2): 390-403 (2014) - [j85]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. Theory Comput. Syst. 54(3): 388-406 (2014) - [j84]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency capping in online advertising. J. Sched. 17(4): 385-398 (2014) - [j83]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): 872-904 (2014) - [j82]Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor:
Smart Grid Network Optimization: Data-Quality-Aware Volume Reduction. IEEE Syst. J. 8(2): 450-460 (2014) - [c120]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA 2014: 209-221 - [c119]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
On the effect of forwarding table size on SDN network utilization. INFOCOM 2014: 1734-1742 - [c118]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Analysis via Regularization. SODA 2014: 436-444 - [c117]Robert Krauthgamer, Joseph Naor, Roy Schwartz, Kunal Talwar:
Non-Uniform Graph Partitioning. SODA 2014: 1229-1243 - [c116]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [c115]Peter Bodík, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Brief announcement: deadline-aware scheduling of big-data processing jobs. SPAA 2014: 211-213 - [i6]Joseph Naor, David Wajc:
Near-Optimum Online Ad Allocation for Targeted Advertising. CoRR abs/1409.8670 (2014) - [i5]Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor:
Online Packing and Covering Framework with Convex Objectives. CoRR abs/1412.8347 (2014) - 2013
- [j81]Niv Buchbinder, Joseph Naor:
Fair online load balancing. J. Sched. 16(1): 117-127 (2013) - [c114]Marek Chrobak, Uriel Feige, Mohammad Taghi Hajiaghayi, Sanjeev Khanna, Fei Li, Seffi Naor:
A Greedy Approximation Algorithm for Minimum-Gap Scheduling. CIAC 2013: 97-109 - [c113]Rami Cohen, Liane Lewin-Eytan, Joseph Naor, Danny Raz:
Almost optimal virtual machine placement for traffic intense data centers. INFOCOM 2013: 355-359 - [c112]Brendan Lucier, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Efficient online scheduling for deadline-sensitive jobs: extended abstract. SPAA 2013: 305-314 - [c111]Niv Buchbinder, Joseph Naor, Roy Schwartz:
Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544 - 2012
- [j80]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19:1-19:24 (2012) - [j79]Edward Bortnikov, Samir Khuller, Jian Li, Yishay Mansour, Joseph Naor:
The load-distance balancing problem. Networks 59(1): 22-29 (2012) - [j78]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012) - [j77]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): 477-487 (2012) - [c110]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - [c109]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 - [c108]Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd:
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) 2012: 586-597 - [c107]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. SPAA 2012: 255-266 - [c106]Moran Feldman, Liane Lewin-Eytan, Joseph Naor:
Hedonic clustering games. SPAA 2012: 267-276 - [c105]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. COLT 2012: 5.1-5.18 - [i4]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) - 2011
- [c104]Moran Feldman, Joseph Naor, Roy Schwartz:
Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract). APPROX-RANDOM 2011: 218-229 - [c103]Moran Feldman, Joseph Naor, Roy Schwartz, Justin Ward:
Improved Approximations for k-Exchange Systems - (Extended Abstract). ESA 2011: 784-798 - [c102]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-max Graph Partitioning and Small Set Expansion. FOCS 2011: 17-26 - [c101]Joseph Naor, Debmalya Panigrahi, Mohit Singh:
Online Node-Weighted Steiner Tree and Related Problems. FOCS 2011: 210-219 - [c100]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - [c99]Moran Feldman, Joseph Naor, Roy Schwartz:
A Unified Continuous Greedy Algorithm for Submodular Maximization. FOCS 2011: 570-579 - [c98]Moran Feldman, Joseph Naor, Roy Schwartz:
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract). ICALP (1) 2011: 342-353 - [c97]Navendu Jain, Ishai Menache, Joseph Naor, Jonathan Yaniv:
A Truthful Mechanism for Value-Based Scheduling in Cloud Computing. SAGT 2011: 178-189 - [c96]Miriam Allalouf, Gidon Gershinsky, Liane Lewin-Eytan, Joseph Naor:
Data-quality-aware volume reduction in smart grid networks. SmartGridComm 2011: 120-125 - [c95]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency Capping in Online Advertising. WADS 2011: 147-158 - [i3]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011) - [i2]Nikhil Bansal, Uriel Feige, Robert Krauthgamer, Konstantin Makarychev, Viswanath Nagarajan, Joseph Naor, Roy Schwartz:
Min-Max Graph Partitioning and Small Set Expansion. CoRR abs/1110.4319 (2011) - 2010
- [j76]Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear and ring networks. J. Discrete Algorithms 8(4): 346-355 (2010) - [j75]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010) - [j74]Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. ACM Trans. Algorithms 6(3): 47:1-47:22 (2010) - [c94]Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph Naor:
Approximation Algorithms for Diversified Search Ranking. ICALP (2) 2010: 273-284 - [c93]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - [c92]Moran Feldman, Joseph Naor:
Non-Preemptive Buffer Management for Latency Sensitive Packets. INFOCOM 2010: 186-190 - [c91]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410 - [c90]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55
2000 – 2009
- 2009
- [j73]Niv Buchbinder, Joseph Naor:
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. 3(2-3): 93-263 (2009) - [j72]Niv Buchbinder, Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34(2): 270-286 (2009) - [j71]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j70]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable Network Design with Degree or Order Constraints. SIAM J. Comput. 39(3): 1062-1087 (2009) - [j69]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): 18:1-18:17 (2009) - [c89]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM 2009: 145-153 - [c88]Joseph Naor, Danny Raz, Gabriel Scalosub:
Toward Optimal Utilization of Shared Random Access Channels. INFOCOM 2009: 2061-2069 - [c87]Robert Krauthgamer, Joseph Naor, Roy Schwartz:
Partitioning graphs into balanced components. SODA 2009: 942-949 - [e1]Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings. Lecture Notes in Computer Science 5687, Springer 2009, ISBN 978-3-642-03684-2 [contents] - 2008
- [j68]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
The Third Haifa Workshop on Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms. Discret. Appl. Math. 156(4): 407-408 (2008) - [j67]Irith Ben-Arroyo Hartman, Seffi Naor, Michal Penn, Uriel G. Rothblum:
Editorial. Discret. Appl. Math. 156(4): 410-411 (2008) - [j66]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): 2-26 (2008) - [j65]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
On the approximability of some network design problems. ACM Trans. Algorithms 4(2): 23:1-23:17 (2008) - [c86]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative Cost Sharing Games Via Subsidies. SAGT 2008: 337-349 - [c85]Moses Charikar, Howard J. Karloff, Claire Mathieu, Joseph Naor, Michael E. Saks:
Online multicast with egalitarian cost sharing. SPAA 2008: 70-76 - [c84]Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz:
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC 2008: 11-20 - [c83]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized competitive algorithms for generalized caching. STOC 2008: 235-244 - [c82]Joseph Naor, Danny Raz, Gabriel Scalosub:
Homogeneous Interference Game in Wireless Networks. WINE 2008: 514-521 - 2007
- [j64]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. Algorithmica 47(3): 343-364 (2007) - [j63]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut problems in graphs with a budget constraint. J. Discrete Algorithms 5(2): 262-279 (2007) - [j62]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): 1193-1206 (2007) - [j61]Julia Chuzhoy, Joseph Naor:
The Hardness of Metric Labeling. SIAM J. Comput. 36(5): 1376-1386 (2007) - [j60]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic aspects of bandwidth trading. ACM Trans. Algorithms 3(1): 10:1-10:19 (2007) - [c81]Niv Buchbinder, Kamal Jain, Joseph Naor:
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA 2007: 253-264 - [c80]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533 - [c79]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS 2007: 507-517 - [c78]David Amzallag, Joseph Naor, Danny Raz:
Algorithmic Aspects of Access Networks Design in B3G/4G Cellular Networks. INFOCOM 2007: 991-999 - [c77]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Maximum-lifetime routing: system optimization & game-theoretic perspectives. MobiHoc 2007: 160-169 - [c76]Roee Engelberg, Joseph Naor:
Equilibria in online games. SODA 2007: 149-158 - [c75]Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh:
Survivable network design with degree or order constraints. STOC 2007: 651-660 - 2006
- [j59]Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling. J. ACM 53(5): 707-721 (2006) - [j58]Yigal Bejerano, Joseph Naor, Alexander Sprintson:
Efficient algorithms for shared backup allocation in networks with partial information. J. Comb. Optim. 12(1-2): 17-34 (2006) - [j57]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling Split Intervals. SIAM J. Comput. 36(1): 1-15 (2006) - [j56]Julia Chuzhoy, Joseph Naor:
Covering Problems with Hard Capacities. SIAM J. Comput. 36(2): 498-515 (2006) - [j55]Chandra Chekuri, Sudipto Guha, Joseph Naor:
The Steiner k-Cut Problem. SIAM J. Discret. Math. 20(1): 261-271 (2006) - [j54]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. ACM Trans. Algorithms 2(4): 640-660 (2006) - [j53]Yigal Bejerano, Mark A. Smith, Joseph Naor, Nicole Immorlica:
Efficient location area planning for personal communication systems. IEEE/ACM Trans. Netw. 14(2): 438-450 (2006) - [c74]Niv Buchbinder, Joseph Naor:
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS 2006: 293-304 - [c73]Roee Engelberg, Jochen Könemann, Stefano Leonardi, Joseph Naor:
Cut Problems in Graphs with a Budget Constraint. LATIN 2006: 435-446 - [c72]Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-cooperative multicast and facility location games. EC 2006: 72-81 - [c71]Niv Buchbinder, Joseph Naor:
Fair online load balancing. SPAA 2006: 291-298 - [c70]David Amzallag, Joseph Naor, Danny Raz:
Coping with Interference: From Maximum Coverage to Planning Cellular Networks. WAOA 2006: 29-42 - 2005
- [j52]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz:
Building Edge-Failure Resilient Networks. Algorithmica 43(1-2): 17-41 (2005) - [j51]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. J. ACM 52(4): 538-551 (2005) - [c69]Joseph Naor:
From Balanced Graph Partitioning to Balanced Metric Labeling. ESA 2005: 9 - [c68]Niv Buchbinder, Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing Problems. ESA 2005: 689-701 - [c67]Yigal Bejerano, Joseph Naor, Alexander Sprintson:
Efficient Algorithms for Shared Backup Allocation in Networks with Partial Information. ESA 2005: 702-713 - [c66]Joseph Naor, Adi Rosén, Gabriel Scalosub:
Online time-constrained scheduling in linear networks. INFOCOM 2005: 855-865 - [c65]Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor:
Approximating the average response time in broadcast scheduling. SODA 2005: 215-221 - [c64]Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh Sinha:
On the approximability of some network design problems. SODA 2005: 943-951 - [c63]Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber:
Traffic engineering of management flows by link augmentations on confluent trees. SPAA 2005: 289-298 - [c62]Joseph Naor, Roy Schwartz:
Balanced metric labeling. STOC 2005: 582-591 - 2004
- [j50]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Admission Control in Networks with Advance Reservations. Algorithmica 40(4): 293-304 (2004) - [j49]Ari Freund, Joseph Naor:
Approximating the Advertisement Placement Problem. J. Sched. 7(5): 365-374 (2004) - [j48]Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin:
A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem. SIAM J. Discret. Math. 18(3): 608-625 (2004) - [j47]Moses Charikar, Joseph Naor, Baruch Schieber:
Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. 12(2): 340-348 (2004) - [c61]Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor:
Machine Minimization for Scheduling Jobs with Interval Constraints. FOCS 2004: 81-90 - [c60]Julia Chuzhoy, Joseph Naor:
The Hardness of Metric Labeling. FOCS 2004: 108-114 - [c59]Joseph Naor, Roy Schwartz:
The directed circular arrangement problem. SODA 2004: 86-95 - [c58]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. SODA 2004: 577-586 - [c57]Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor:
Asymmetric k-center is log* n-hard to approximate. STOC 2004: 21-27 - [c56]Julia Chuzhoy, Joseph Naor:
New hardness results for congestion minimization and machine scheduling. STOC 2004: 28-34 - 2003
- [j46]Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive On-Line Switching Policies. Algorithmica 36(3): 225-247 (2003) - [j45]Amotz Bar-Noy, Joseph Naor, Baruch Schieber:
Pushing Dependent Data in Clients-Providers-Servers Systems. Wirel. Networks 9(5): 421-430 (2003) - [c55]Chandra Chekuri, Sudipto Guha, Joseph Naor:
Approximating Steiner k-Cuts. ICALP 2003: 189-199 - [c54]Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor:
Algorithmic Aspects of Bandwidth Trading. ICALP 2003: 751-766 - [c53]Joseph Naor, Hadas Shachnai, Tami Tamir:
Real-Time Scheduling with a Budget. ICALP 2003: 1123-1137 - [c52]Yigal Bejerano, Nicole Immorlica, Joseph Naor, Mark A. Smith:
Efficient location area planning for personal communication systems. MobiCom 2003: 109-121 - [c51]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The online set cover problem. STOC 2003: 100-105 - [i1]Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor:
Asymmetric k-center is log*n-hard to Approximate. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j44]Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling. Math. Oper. Res. 27(3): 518-544 (2002) - [j43]Yigal Bejerano, Israel Cidon, Joseph Naor:
Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach. IEEE/ACM Trans. Netw. 10(6): 749-760 (2002) - [c50]Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Routing and Admission Control in Networks with Advance Reservations. APPROX 2002: 215-228 - [c49]Julia Chuzhoy, Joseph Naor:
Covering Problems with Hard Capacities. FOCS 2002: 481-489 - [c48]Sanjeev Khanna, Joseph Naor, Danny Raz:
Control Message Aggregation in Group Communication Protocols. ICALP 2002: 135-146 - [c47]Juan A. Garay, Joseph Naor, Bülent Yener, Peng Zhao:
On-line Admission Control and Packet Scheduling with Interleaving. INFOCOM 2002: 94-103 - [c46]Ari Freund, Joseph Naor:
Approximating the Advertisement Placement Problem. IPCO 2002: 415-424 - [c45]Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph Naor, Danny Raz:
Building Edge-Failure Resilient Networks. IPCO 2002: 439-456 - [c44]Amotz Bar-Noy, Ari Freund, Shimon Landa, Joseph Naor:
Competitive on-line switching policies. SODA 2002: 525-534 - [c43]Reuven Bar-Yehuda, Magnús M. Halldórsson, Joseph Naor, Hadas Shachnai, Irina Shapira:
Scheduling split intervals. SODA 2002: 732-741 - [c42]Amotz Bar-Noy, Sudipto Guha, Yoav Katz, Joseph Naor, Baruch Schieber, Hadas Shachnai:
Throughput maximization of real-time scheduling with batching. SODA 2002: 742-751 - 2001
- [j42]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. J. ACM 48(5): 1069-1090 (2001) - [j41]Reuven Bar-Yehuda, Guy Even, Jon Feldman, Joseph Naor:
Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems. J. Graph Algorithms Appl. 5(4): 1-27 (2001) - [j40]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Approximating the Throughput of Multiple Machines in Real-Time Scheduling. SIAM J. Comput. 31(2): 331-352 (2001) - [j39]Joseph Naor, Leonid Zosin:
A 2-Approximation Algorithm for the Directed Multiway Cut Problem. SIAM J. Comput. 31(2): 477-482 (2001) - [j38]Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Balancing in a Hierarchical Server Topology. SIAM J. Comput. 31(2): 527-549 (2001) - [c41]Joseph Naor, Yuval Rabani:
Tree packing and approximating k-cuts. SODA 2001: 26-27 - [c40]Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin:
Approximation algorithms for the metric labeling problem via a new linear programming formulation. SODA 2001: 109-118 - [c39]Chandra Chekuri, Sanjeev Khanna, Joseph Naor:
A deterministic algorithm for the cost-distance problem. SODA 2001: 232-233 - 2000
- [j37]Joseph Naor, Ariel Orda, Yael Petruschka:
Dynamic storage allocation with known durations. Discret. Appl. Math. 100(3): 203-213 (2000) - [j36]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-conquer approximation algorithms via spreading metrics. J. ACM 47(4): 585-616 (2000) - [j35]Randeep Bhatia, Samir Khuller, Joseph Naor:
The Loading Time Scheduling Problem. J. Algorithms 36(1): 1-33 (2000) - [j34]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Message Multicasting in Heterogeneous Networks. SIAM J. Comput. 30(2): 347-358 (2000) - [j33]Guy Even, Joseph Naor, Leonid Zosin:
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. SIAM J. Comput. 30(4): 1231-1252 (2000) - [j32]Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. SIAM J. Discret. Math. 13(2): 255-267 (2000) - [c38]Yigal Bejerano, Israel Cidon, Joseph Naor:
Dynamic session management for static and mobile users: a competitive on-line algorithmic approach. DIAL-M 2000: 65-74 - [c37]Yigal Bejerano, Israel Cidon, Joseph Naor:
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach. INFOCOM 2000: 198-207 - [c36]Moses Charikar, Joseph Naor, Baruch Schieber:
Resource Optimization in QoS Multicast Routing of Real-Time Multimedia. INFOCOM 2000: 1518-1527 - [c35]Amotz Bar-Noy, Joseph Naor, Baruch Schieber:
Pushing dependent data in clients-providers-servers systems. MobiCom 2000: 222-230 - [c34]Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd:
Directed network design with orientation constraints. SODA 2000: 663-671 - [c33]Amotz Bar-Noy, Reuven Bar-Yehuda, Ari Freund, Joseph Naor, Baruch Schieber:
A unified approach to approximating resource allocation and scheduling. STOC 2000: 735-744
1990 – 1999
- 1999
- [j31]Samir Khuller, Anna Moss, Joseph Naor:
The Budgeted Maximum Coverage Problem. Inf. Process. Lett. 70(1): 39-45 (1999) - [j30]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SIAM J. Comput. 28(6): 2187-2214 (1999) - [c32]Amotz Bar-Noy, Ari Freund, Joseph Naor:
On-Line Load Banancing in a Hierarchical Server Topology. ESA 1999: 77-88 - [c31]Sudipto Guha, Anna Moss, Joseph Naor, Baruch Schieber:
Efficient Recovery from Power Outage (Extended Abstract). STOC 1999: 574-582 - [c30]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Approximating the Throughput of Multiple Machines Under Real-Time Scheduling. STOC 1999: 622-631 - 1998
- [j29]Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs. Algorithmica 20(2): 151-174 (1998) - [j28]Yossi Azar, Rajeev Motwani, Joseph Naor:
Approximating Probability Distributions Using Small Sample Spaces. Comb. 18(2): 151-171 (1998) - [j27]Joseph Naor, Ariel Orda, Raphael Rom:
Scheduled Hot-Potato Routing. J. Graph Algorithms Appl. 2(4): 1-20 (1998) - [j26]Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth:
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SIAM J. Comput. 27(4): 942-959 (1998) - [c29]Amotz Bar-Noy, Randeep Bhatia, Joseph Naor, Baruch Schieber:
Minimizing Service and Operation Costs of Periodic Scheduling (Extended Abstract). SODA 1998: 11-20 - [c28]Amotz Bar-Noy, Sudipto Guha, Joseph Naor, Baruch Schieber:
Multicasting in Heterogeneous Networks. STOC 1998: 448-453 - 1997
- [c27]Joseph Naor, Ariel Orda, Yael Petruschka:
Dynamic Storage Allocation with Known Durations. ESA 1997: 378-387 - [c26]Joseph Naor, Baruch Schieber:
Improved Approximations for Shallow-Light Spanning Trees. FOCS 1997: 536-541 - [c25]Joseph Naor, Leonid Zosin:
A 2-Approximation Algorithm for the Directed Multiway Cut Problem. FOCS 1997: 548-553 - [c24]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Spreading Metric Based Graph Partitioning Algorithms. PP 1997 - [c23]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Fast Approximate Graph Partitioning Algorithms. SODA 1997: 639-648 - 1996
- [j25]Dorit S. Hochbaum, Joseph Naor:
Approximation Algorithms for Network Design Problems on Bounded Subsets. J. Algorithms 21(2): 403-414 (1996) - [j24]Michael Luby, Joseph Naor, Ariel Orda:
Tight Bounds for Dynamic Storage Allocation. SIAM J. Discret. Math. 9(1): 155-166 (1996) - [j23]Yossi Azar, Joseph Naor, Raphael Rom:
Routing Strategies for Fast Networks. IEEE Trans. Computers 45(2): 165-173 (1996) - [c22]Guy Even, Joseph Naor, Leonid Zosin:
An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem. FOCS 1996: 310-319 - [c21]Guy Even, Joseph Naor, Baruch Schieber, Leonid Zosin:
Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications. ISTCS 1996: 78-88 - 1995
- [j22]Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. J. Algorithms 18(2): 221-237 (1995) - [j21]Joseph Naor, Ron M. Roth:
Constructions of Permutation Arrays for Certain Scheduling Cost Measures. Random Struct. Algorithms 6(1): 39-50 (1995) - [j20]Gary L. Miller, Joseph Naor:
Flow in Planar Graphs with Multiple Sources and Sinks. SIAM J. Comput. 24(5): 1002-1017 (1995) - [c20]Guy Even, Joseph Naor, Satish Rao, Baruch Schieber:
Divide-and-Conquer Approximation Algorithms via Spreading Metrics (Extended Abstract). FOCS 1995: 62-71 - [c19]Randeep Bhatia, Samir Khuller, Joseph Naor:
The Loading Time Scheduling Problem (Extended Abstract). FOCS 1995: 72-81 - [c18]Joseph Naor, Ariel Orda, Raphael Rom:
Scheduled Hot-Potato Routing. INFOCOM 1995: 579-586 - [c17]Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan:
Approximating Minimum Feedback Sets and Multi-Cuts in Directed Graphs. IPCO 1995: 14-28 - 1994
- [j19]Samir Khuller, Joseph Naor:
Flow in Planar Graphs with Vertex Capacities. Algorithmica 11(3): 200-225 (1994) - [j18]Rajeev Motwani, Joseph Naor, Moni Naor:
The Probabilistic Method Yields Deterministic Parallel Algorithms. J. Comput. Syst. Sci. 49(3): 478-516 (1994) - [j17]Dorit S. Hochbaum, Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs With Two Variables per Inequality. SIAM J. Comput. 23(6): 1179-1192 (1994) - [c16]Reuven Bar-Yehuda, Dan Geiger, Joseph Naor, Ron M. Roth:
Approximation Algorithms for the Vertex Feedback Set Problem with Applications to Constraint Satisfaction and Bayesian Inference. SODA 1994: 344-354 - [c15]Michael Luby, Joseph Naor, Ariel Orda:
Tight Bounds for Dynamic Storage Allocation. SODA 1994: 724-732 - 1993
- [j16]Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir:
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. 62: 69-83 (1993) - [j15]Joseph Naor, Moni Naor:
Small-Bias Probability Spaces: Efficient Constructions and Applications. SIAM J. Comput. 22(4): 838-856 (1993) - [j14]Samir Khuller, Joseph Naor, Philip N. Klein:
The Lattice Structure of Flow in Planar Graphs. SIAM J. Discret. Math. 6(3): 477-490 (1993) - 1992
- [j13]Amotz Bar-Noy, Rajeev Motwani, Joseph Naor:
The Greedy Algorithm is Optimal for On-Line Edge Coloring. Inf. Process. Lett. 44(5): 251-253 (1992) - [j12]Amotz Bar-Noy, Rajeev Motwani, Joseph Naor:
A Linear Time Approach to the Set Maxima Problem. SIAM J. Discret. Math. 5(1): 1-9 (1992) - [j11]Noga Alon, Jehoshua Bruck, Joseph Naor, Moni Naor, Ron M. Roth:
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Trans. Inf. Theory 38(2): 509-516 (1992) - [c14]Yossi Azar, Joseph Naor, Raphael Rom:
Routing Strategies for Fast Networks. INFOCOM 1992: 170-179 - [c13]Dorit S. Hochbaum, Joseph Naor:
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality. IPCO 1992: 44-59 - [c12]Yossi Azar, Joseph Naor, Raphael Rom:
The Competitiveness of On-Line Assignments. SODA 1992: 203-210 - 1991
- [j10]Marek Chrobak, Joseph Naor:
An Efficient Parallel Algorithm for Computing a Large Independent Set in Planar Graph. Algorithmica 6(6): 801-815 (1991) - [c11]Samir Khuller, Joseph Naor:
Flow in Planar Graphs: A Survey of Results. Planar Graphs 1991: 59-84 - 1990
- [j9]Amotz Bar-Noy, Joseph Naor, Moni Naor:
One-Bit Algorithms. Distributed Comput. 4: 3-8 (1990) - [j8]Joseph Naor, Mark B. Novick:
An Efficient Reconstruction of a Graph from its Line Graph in Parallel. J. Algorithms 11(1): 132-143 (1990) - [j7]Amotz Bar-Noy, Joseph Naor:
Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments. SIAM J. Discret. Math. 3(1): 7-20 (1990) - [c10]Samir Khuller, Joseph Naor:
Flow in Planar Graphs with Vertex Capacities. IPCO 1990: 367-384 - [c9]Joseph Naor, Moni Naor:
Small-bias Probability Spaces: Efficient Constructions and Applications. STOC 1990: 213-223
1980 – 1989
- 1989
- [j6]Joseph Naor, Moni Naor, Alejandro A. Schäffer:
Fast Parallel Algorithms for Chordal Graphs. SIAM J. Comput. 18(2): 327-349 (1989) - [j5]Eli Gafni, Joseph Naor, Prabhakar Ragde:
On Separating the Erew and Crew Pram Models. Theor. Comput. Sci. 68(3): 343-346 (1989) - [c8]Rajeev Motwani, Joseph Naor, Moni Naor:
The Probabilistic Method Yields Deterministic Parallel Algorithms. FOCS 1989: 8-13 - [c7]Gary L. Miller, Joseph Naor:
Flow in Planar Graphs with Multiple Sources and Sinks (Extended Abstract). FOCS 1989: 112-117 - [c6]Marek Chrobak, Joseph Naor:
An Efficient Parallel Algorithm for Computing a Large Independent Set in a Plan Graph. SPAA 1989: 379-387 - [c5]Marek Chrobak, Joseph Naor, Mark B. Novick:
Using Bounded Degree Spanning Trees in the Design of Efficient Algorithms on Claw-Free Graphs. WADS 1989: 147-162 - 1988
- [j4]Mauricio Karchmer, Joseph Naor:
A Fast Parallel Algorithm to Color a Graph with Delta Colors. J. Algorithms 9(1): 83-91 (1988) - [c4]Joseph Naor:
Computing a Perfect Matching in a Line Graph. AWOC 1988: 139-148 - [c3]Amotz Bar-Noy, Joseph Naor, Moni Naor:
One Bit Algorithms. PODC 1988: 66-76 - 1987
- [b1]Joseph Naor:
אלגוריתמים במערכות מקביליות ומבוזרות (Algorithms in distributed and parallel systems.). Hebrew University of Jerusalem, Israel, 1987 - [j3]Joseph Naor:
A Fast Parallel Coloring of Planar Graphs with Five Colors. Inf. Process. Lett. 25(1): 51-53 (1987) - [c2]Joseph Naor, Moni Naor, Alejandro A. Schäffer:
Fast Parallel Algorithms for Chordal Graphs (Extended Abstract). STOC 1987: 355-364 - 1984
- [j2]Shmuel Peleg, Joseph Naor, Ralph Hartley, David Avnir:
Multiple Resolution Texture Analysis and Classification. IEEE Trans. Pattern Anal. Mach. Intell. 6(4): 518-523 (1984) - 1983
- [j1]Joseph Naor, Shmuel Peleg:
Hierarchical image representation for compression, filtering and normalization. Pattern Recognit. Lett. 2(1): 43-46 (1983) - [c1]Joseph Naor, Shmuel Peleg:
Image Compression and Filtering Using Pyramid Data Structures. IJCAI 1983: 1086-1088
Coauthor Index
[j102] [c146] [e2] [c140] [c138] [i16] [i14] [i13] [c132] [j96] [i11] [c126] [i10] [j92] [c125] [j90] [j89] [j86] [j84] [c120] [c118] [c116] [i5] [j81] [c111] [j80] [j78] [j77] [c110] [c109] [c105] [i4] [c100] [c95] [i3] [j75] [c93] [c91] [c90] [j73] [j72] [j71] [c89] [c86] [c83] [c81] [c80] [c79] [j54] [c74] [c71] [c68] [c58] [c51]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-07-09 21:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
