2026 Joseph (Seffi) Naor: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	67	2190	2123	42	40	234	18624

Overview

Joseph (Seffi) Naor is affiliated with the Technion - Israel Institute of Technology in Israel. Their research primarily focuses on areas within computer science and engineering, with a strong emphasis on optimization and algorithmic problems.

Their main fields of study include:

Computer Science
Engineering

More specifically, their work covers several subfields such as:

Computer Networks and Communications
Artificial Intelligence
Industrial and Manufacturing Engineering
Computational Theory and Mathematics
Management Science and Operations Research

Joseph Naor's research topics include:

Optimization and Search Problems
Advanced Data Storage Technologies
Caching and Content Delivery
Optimization and Packing Problems
Algorithms and Data Compression
Complexity and Algorithms in Graphs
Cryptography and Data Security

The scientist has authored multiple papers across various publication venues, including:

ACM SIGMETRICS Performance Evaluation Review
Proceedings of the ACM on Measurement and Analysis of Computing Systems
arXiv (Cornell University)
Communications of the ACM
Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Examples of recent papers by Joseph Naor include:

Offline and Online Algorithms for SSD Management, 2021, Proceedings of the ACM on Measurement and Analysis of Computing Systems
A (1-e^-1-ε)-Approximation for the Monotone Submodular Multiple Knapsack Problem, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
Offline and Online Algorithms for SSD Management, 2023, Communications of the ACM
Online Virtual Machine Allocation with Lifetime and Load Predictions, 2021, ACM SIGMETRICS Performance Evaluation Review
Online k-taxi via Double Coverage and time-reverse primal-dual, 2022, Mathematical Programming

The scientist frequently collaborates with several co-authors, notably:

Tomer Lange
Gala Yadgar
Niv Buchbinder
Yaron Fairstein
Hadas Shachnai

Best Publications

Multiple Resolution Texture Analysis and Classification

Shmuel Peleg;Joseph Naor;Ralph Hartley;David Avnir

1218
Citations
The budgeted maximum coverage problem

Samir Khuller;Anna Moss;Joseph (Seffi) Naor

1181
Citations
Small-bias probability spaces: efficient constructions and applications

Joseph (Seffi) Naor;Moni Naor

946
Citations
A Tight Linear Time (1/2)-Approximation For Unconstrained Submodular Maximization

Niv Buchbinder;Moran Feldman;Joseph Seffi Naor;Roy Schwartz

807
Citations
A unified approach to approximating resource allocation and scheduling

Amotz Bar-Noy;Reuven Bar-Yehuda;Ari Freund;Joseph (Seffi) Naor

586
Citations
Near optimal placement of virtual network functions

Rami Cohen;Liane Lewin-Eytan;Joseph Seffi Naor;Danny Raz

565
Citations
Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

Guy Even;Joseph Naor;Baruch Schieber;Madhu Sudan

453
Citations
Minimizing Service and Operation Costs of Periodic Scheduling

Amotz Bar-Noy;Randeep Bhatia;Joseph Seffi Naor;Baruch Schieber

417
Citations
Online primal-dual algorithms for maximizing ad-auctions revenue

Niv Buchbinder;Kamal Jain;Joseph Seffi Naor

393
Citations
The competitiveness of on-line assignments

Yossi Azar;Joseph Seffi Naor;Raphael Rom

392
Citations
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs

N. Alon;J. Bruck;J. Naor;M. Naor

381
Citations
The Design of Competitive Online Algorithms via a Primal-Dual Approach

Niv Buchbinder;Joseph (Seffi) Naor

364
Citations
A Primal-Dual Randomized Algorithm for Weighted Paging

Nikhil Bansal;Niv Buchbinder;Joseph (Seffi) Naor

325
Citations
A Unified Continuous Greedy Algorithm for Submodular Maximization

Moran Feldman;Joseph (Seffi) Naor;Roy Schwartz

306
Citations
Divide-and-conquer approximation algorithms via spreading metrics

Guy Even;Joseph Seffi Naor;Satish Rao;Baruch Schieber

286
Citations
Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs

Unknown

280
Citations
Approximating the Throughput of Multiple Machines in Real-Time Scheduling

Amotz Bar-Noy;Sudipto Guha

274
Citations
Online Primal-Dual Algorithms for Covering and Packing

Niv Buchbinder;Joseph (Seffi) Naor

272
Citations
Submodular maximization with cardinality constraints

Niv Buchbinder;Moran Feldman;Joseph (Seffi) Naor;Roy Schwartz

271
Citations
Approximating the throughput of multiple machines under real-time scheduling

Amotz Bar-Noy;Sudipto Guha;Joseph (Seffi) Naor;Baruch Schieber

265
Citations
Survivable Network Design with Degree or Order Constraints

Lap Chi Lau;Joseph Seffi Naor;Mohammad R. Salavatipour;Mohit Singh

246
Citations

Frequent Co-Authors

Niv Buchbinder Tel Aviv University

Baruch Schieber New Jersey Institute of Technology

Amotz Bar-Noy City University of New York

Ishai Menache Microsoft (United States)

Nikhil Bansal University of Michigan–Ann Arbor

Danny Raz Technion – Israel Institute of Technology

Ariel Orda Technion – Israel Institute of Technology

Julia Chuzhoy Toyota Technological Institute at Chicago

Anupam Gupta Carnegie Mellon University

Chandra Chekuri University of Illinois at Urbana-Champaign

External Links

Wikipedia of Joseph (Seffi) Naor Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring online degrees in Computer Science opens up a flexible and affordable pathway for students from diverse backgrounds. Many students seek out cheap online colleges to keep education costs manageable without sacrificing quality. These programs often offer the same curriculum and accreditation as their on-campus counterparts.

If your academic performance in high school or college wasn’t perfect, don’t worry. There are best colleges for low gpa that provide second chances for motivated students to pursue Computer Science online.

Looking to get your degree as quickly as possible? Consider accelerated computer science degree options, which can help you graduate in less time and enter the workforce sooner.

Not sure which field to specialize in? Technology and computer science graduates have wide-ranging career options, similar to the variety available to those in other STEM fields. For inspiration, see what jobs can you get with an environmental science degree to understand the broad career landscape awaiting graduates.