Eitan Zemel | Academic Influence

Eitan Zemel's AcademicInfluence.com Rankings

Eitan Zemel

Computer Science

#4537

World Rank

#4787

Historical Rank

#1466

USA Rank

Artificial Intelligence

#5297

World Rank

#5368

Historical Rank

#292

USA Rank

Machine Learning

#5331

World Rank

#5399

Historical Rank

#213

USA Rank

Database

#8667

World Rank

#9091

Historical Rank

#1173

USA Rank

computer-science Degrees

Download Badge

Computer Science

Eitan Zemel's Degrees

Masters Computer Science Stanford University

Similar Degrees You Can Earn

Best Online Master's in Computer Science

Why Is Eitan Zemel Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Eitan Zemel is the Vice Dean for Strategic Initiatives and the W. Edwards Deming Professor of Quality and Productivity at New York University's Stern School of Business. He also teaches courses in operations management and operations strategy at NYU. Professor Zemel also teaches for the Master of Science in Business Analytics Program for Executives , which is jointly hosted by NYU Stern and NYU Shanghai.

(See a Problem?)

Eitan Zemel's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

An Algorithm for Large Zero-One Knapsack Problems (1980) (493)
Nash and correlated equilibria: Some complexity considerations (1989) (428)
A General Framework for the Study of Decentralized Distribution Systems (2001) (299)
Totally Balanced Games and Games of Flow (1982) (233)
The Maximum Coverage Location Problem (1983) (220)
Facets of the Knapsack Polytope From Minimal Covers (1978) (215)
Managing Business Process Flows (1999) (186)
Generalized Network Problems Yielding Totally Balanced Games (1982) (182)
Hashing vectors for tabu search (1993) (135)
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems (1981) (135)
An O(n) Algorithm for the Linear Multiple Choice Knapsack Problem and Related Problems (1984) (130)
Easily Computable Facets of the Knapsack Polytope (1989) (99)
Measuring the Quality of Approximate Solutions to Zero-One Programming Problems (1978) (91)
On the Core and Dual Set of Linear Programming Games (1984) (82)
Lifting the facets of zero–one polytopes (1978) (79)
Probabilistic analysis of geometric location problems (1984) (67)
On the order of eliminating dominated strategies (1990) (67)
The Linear Multiple Choice Knapsack Problem (1980) (62)
On Shortest Paths in Graphs with Random Weights (1985) (61)
The Complexity of Eliminating Dominated Strategies (1993) (56)
Corporate Governance in the Modern Financial Sector (2009) (40)
Sourcing Through Auctions and Audits (2008) (38)
Small Talk and Cooperation A Note on Bounded Rationality (1989) (34)
Competitive location in the plane (1986) (32)
Lifting the Facets of 0-1 Polytopes. (1974) (30)
Is every cycle basis fundamental? (1989) (28)
Polynomial algorithms for estimating network reliability (1982) (28)
Probabilistic Analysis of the Capacitated Transportation Problem (1988) (27)
Unintended Acceleration: Toyota’s Recall Crisis (2016) (25)
A linear-time algorithm for solving continuous maximin knapsack problems (1991) (24)
The Complexity of Lifted Inequalities for the Knapsack Problem (1992) (22)
An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem (1986) (22)
Solving Large Zero-One Knapsack Problems. (1977) (20)
On search over rationals (1981) (14)
Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes (1998) (14)
Locating Centers on a Tree with Discontinuous Supply and Demand Regions (1982) (14)
Critical Cutsets of Graphs and Canonical Facets of Set-Packing Polytopes (1977) (13)
Durability of Capital Goods: Taxes and Market Structure (1977) (10)
Graph substitution and set packing polytopes (1977) (9)
Learning from Mistakes: A Note on Just-in-Time Systems (1996) (8)
A linear time randomizing algorithm for searching ranked functions (1987) (7)
On Communication, Bounded Complexity, and Cooperation (1985) (5)
All the Facets of Zero-One Programming Polytopes with Positive Coefficients. (1975) (5)
Supply Intelligence (2003) (5)
Random Binary Search: A Randomizing Algorithm for Global Optimization in $R^1$ (1986) (4)
Costly Enforcement of Quality Standards in Decentralized Supply Chains (2008) (4)
Offshore & Onshore Contracts (2005) (2)
Managing Business Process Flows with 3.5 Disk (1999) (1)
A Linear Time Randomizing Algorithm for Local Roots and Optima of Ranked Functions (1983) (1)
Chapter 7: Executive Summary (2009) (1)
Comment on 'some computational results on real 0-1 knapsack problems' (1987) (1)
The Greed and Regret Problem (2007) (1)
A note on the properties of the optimal solution(s) of the Greed and Regret problem (2010) (0)
On Thc Computational Complexity of Facets of the Knapsack Problem (1986) (0)
Sourcing through Auctions and Audits 1 (2007) (0)
Error Noted in a Paper by Jacobs, Silan, and Clemson (1998) (0)

This paper list is powered by the following services:

Other Resources About Eitan Zemel

en.wikipedia.org

What Schools Are Affiliated With Eitan Zemel?

Eitan Zemel is affiliated with the following schools: