D-Index & Metrics Best Publications

Joseph (Seffi) Naor

Technion – Israel Institute of Technology
Israel

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 59 Citations 14,556 198 World Ranking 2240 National Ranking 44

Overview

What is he best known for?

The fields of study Joseph (Seffi) Naor is best known for:

Algorithm
Approximation algorithm
Feedback arc set

His study on Machine learning is interrelated to topics such as Value (mathematics) and Schema (genetic algorithms). Value (mathematics) and Machine learning are frequently intertwined in his study. His research on Mathematical analysis frequently links to adjacent areas such as Fractal. His research is interdisciplinary, bridging the disciplines of Integer programming and Algorithm. His Integer programming study typically links adjacent topics like Algorithm. Mathematical optimization is frequently linked to Heuristic in his study. He connects Combinatorics with Greedy algorithm in his research. Joseph (Seffi) Naor conducts interdisciplinary study in the fields of Greedy algorithm and Combinatorics through his works. Joseph (Seffi) Naor applies his multidisciplinary studies on Discrete mathematics and Theory of computation in his research.

His most cited work include:

The budgeted maximum coverage problem (813 citations)
Multiple Resolution Texture Analysis and Classification (707 citations)
Small-Bias Probability Spaces: Efficient Constructions and Applications (510 citations)

What are the main themes of his work throughout his whole career to date

Joseph (Seffi) Naor combines topics linked to Scheduling (production processes) and Approximation algorithm with his work on Mathematical optimization. He performs integrative study on Scheduling (production processes) and Mathematical optimization in his works. In his works, Joseph (Seffi) Naor conducts interdisciplinary research on Algorithm and Theory of computation. In his works, he conducts interdisciplinary research on Combinatorics and Geometry. In his works, Joseph (Seffi) Naor performs multidisciplinary study on Geometry and Combinatorics. Mathematical analysis and Upper and lower bounds are commonly linked in his work. Upper and lower bounds and Mathematical analysis are frequently intertwined in his study. Computer network and Distributed computing are two areas of study in which Joseph (Seffi) Naor engages in interdisciplinary research. He integrates Distributed computing with Computer network in his research.

Joseph (Seffi) Naor most often published in these fields:

Algorithm (47.83%)
Combinatorics (42.03%)
Mathematical optimization (40.58%)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Multiple Resolution Texture Analysis and Classification

Shmuel Peleg;Joseph Naor;Ralph Hartley;David Avnir.
IEEE Transactions on Pattern Analysis and Machine Intelligence (1984)

1193 Citations

The budgeted maximum coverage problem

Samir Khuller;Anna Moss;Joseph (Seffi) Naor.
Information Processing Letters (1999)

1028 Citations

Small-bias probability spaces: efficient constructions and applications

Joseph (Seffi) Naor;Moni Naor.
SIAM Journal on Computing (1993)

913 Citations

A unified approach to approximating resource allocation and scheduling

Amotz Bar-Noy;Reuven Bar-Yehuda;Ari Freund;Joseph (Seffi) Naor.
Journal of the ACM (2001)

547 Citations

Near optimal placement of virtual network functions

Rami Cohen;Liane Lewin-Eytan;Joseph Seffi Naor;Danny Raz.
international conference on computer communications (2015)

509 Citations

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

Niv Buchbinder;Moran Feldman;Joseph Seffi Naor;Roy Schwartz.
SIAM Journal on Computing (2015)

426 Citations

Approximating Minimum Feedback Sets and Multicuts in Directed Graphs

Guy Even;Joseph Naor;Baruch Schieber;Madhu Sudan.
Algorithmica (1998)

423 Citations

Minimizing Service and Operation Costs of Periodic Scheduling

Amotz Bar-Noy;Randeep Bhatia;Joseph Seffi Naor;Baruch Schieber.
Mathematics of Operations Research (2002)

413 Citations

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

N. Alon;J. Bruck;J. Naor;M. Naor.
international symposium on information theory (1991)

361 Citations

Online primal-dual algorithms for maximizing ad-auctions revenue

Niv Buchbinder;Kamal Jain;Joseph Seffi Naor.
european symposium on algorithms (2007)

350 Citations

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

Frequent Co-Authors

External Links

Google Scholar Profile