Nimrod Megiddo
#4,518
Most Influential Person Now
American computer scientist and mathematician
Nimrod Megiddo's AcademicInfluence.com Rankings
Nimrod Megiddomathematics Degrees
Mathematics
#476
World Rank
#935
Historical Rank
Measure Theory
#707
World Rank
#954
Historical Rank
Download Badge
Computer Science Mathematics
Nimrod Megiddo's Degrees
- PhD Computer Science Stanford University
- Masters Mathematics Tel Aviv University
- Bachelors Mathematics Tel Aviv University
Similar Degrees You Can Earn
Why Is Nimrod Megiddo Influential?
(Suggest an Edit or Addition)According to Wikipedia, Nimrod Megiddo is a mathematician and computer scientist. He is a research scientist at the IBM Almaden Research Center and Stanford University. His interests include combinatorial optimization, algorithm design and analysis, game theory, and machine learning. He was one of the first people to propose a solution to the bounding sphere and smallest-circle problem.
Nimrod Megiddo'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
- ARC: A Self-Tuning, Low Overhead Replacement Cache (2003) (921)
- Linear-time algorithms for linear programming in R3 and related problems (1982) (894)
- Linear Programming in Linear Time When the Dimension Is Fixed (1984) (712)
- On the Complexity of Some Common Geometric Location Problems (1984) (690)
- Pathways to the optimal set in linear programming (1989) (659)
- Applying parallel computation algorithms in the design of serial algorithms (1981) (627)
- A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems (1991) (592)
- A logic for reasoning about probabilities (1988) (555)
- Combinatorial optimization with rational objective functions (1978) (498)
- The complexity of searching a graph (1981) (396)
- Discovery-Driven Exploration of OLAP Data Cubes (1998) (393)
- Range queries in OLAP data cubes (1997) (333)
- Linear-Time Algorithms for Linear Programming in R^3 and Related Problems (1982) (311)
- A primal—dual infeasible-interior-point algorithm for linear programming (1993) (291)
- Efficient Computation of Equilibria for Extensive Two-Person Games (1996) (282)
- On Total Functions, Existence Theorems and Computational Complexity (1991) (261)
- Outperforming LRU with an adaptive replacement cache algorithm (2004) (242)
- Automating physical database design in a parallel database (2002) (240)
- Strategic Classification (2015) (232)
- Optimal flows in networks with multiple sources and sinks (1974) (231)
- Fast algorithms for finding randomized strategies in game trees (1994) (224)
- The Maximum Coverage Location Problem (1983) (220)
- The complexity of two-person zero-sum games in extensive form (1992) (219)
- On the complexity of locating linear facilities in the plane (1982) (206)
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree (1978) (199)
- Boundary Behavior of Interior Point Algorithms in Linear Programming (1989) (152)
- On the complexity of polyhedral separability (1988) (149)
- An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems (1981) (135)
- New Results on the Complexity of p-Center Problems (1983) (130)
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality (1993) (126)
- Homotopy Continuation Methods for Nonlinear Complementarity Problems (1991) (124)
- Dynamic faceted search for discovery-driven analysis (2008) (124)
- Towards a Genuinely Polynomial Algorithm for Linear Programming (1983) (123)
- Discovering Predictive Association Rules (1998) (123)
- Advances in Economic Theory: On the complexity of linear programming (1987) (121)
- On Finding Primal- and Dual-Optimal Bases (1991) (120)
- On the Nonmonotonicity of the Bargaining Set, the Kernel and the Nucleolus of Game (1974) (116)
- Operations Research Letters (2011) (109)
- The Weighted Euclidean 1-Center Problem (1983) (106)
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension (1985) (105)
- Approximation algorithms for hitting objects with straight lines (1991) (100)
- Cost allocation for steiner trees (1978) (90)
- Linear time algorithms for some separable quadratic programming problems (1993) (80)
- Partitioning with Two Lines in the Plane (1985) (80)
- Computing circular separability (1986) (78)
- Improved algorithms for linear inequalities with two variables per inequality (1991) (78)
- Consistent selectivity estimation via maximum entropy (2007) (75)
- An interior point potential reduction algorithm for the linear complementarity problem (1992) (74)
- Constructing small sample spaces satisfying given constraints (1993) (73)
- A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort (1979) (70)
- On Play by Means of Computing Machines (1986) (66)
- Online Learning with Prior Knowledge (2007) (66)
- Optimal weighted loop fusion for parallel programs (1997) (65)
- Cyclic Ordering is NP-Complete (1977) (63)
- A GOOD ALGORITHM FOR LEXICOGRAPHICALLY OPTIMAL FLOWS IN MULTI-TERMINAL NETWORKS (1977) (63)
- Progress in Mathematical Programming (1989) (62)
- Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs (1989) (61)
- On repeated games with incomplete information played by non-Bayesian players (1980) (60)
- Consistently Estimating the Selectivity of Conjuncts of Predicates (2005) (59)
- A Note on the Complexity of P � Matrix LCP and Computing an Equilibrium (1988) (59)
- On the ball spanned by balls (1989) (58)
- On the existence and uniqueness of solutions in nonlinear complementarity theory (1977) (56)
- Parallel linear programming in fixed dimension almost surely in constant time (1990) (56)
- On the Complexity of Some Geometric Problems in Unbounded Dimension (1990) (55)
- Progress in Mathematical Programming: Interior-Point and Related Methods (2011) (55)
- How to Combine Expert (and Novice) Advice when Actions Impact the Environment? (2003) (54)
- Recommending targeted strangers from whom to solicit information on social media (2013) (54)
- Optimal precision in the presence of uncertainty (1985) (54)
- Improved algorithms and analysis for secretary problems and generalizations (1995) (53)
- A General Framework of Continuation Methods for Complementarity Problems (1993) (53)
- Finding mixed strategies with small supports in extensive form games (1996) (52)
- Theoretical convergence of large-step primal—dual interior point algorithms for linear programming (1993) (51)
- Attribute classification using feature analysis (2002) (51)
- Finding Least-Distances Lines (1983) (50)
- On Finding a Minimum Dominating Set in a Tournament (1988) (49)
- An analytical model for loop tiling and its solution (2000) (46)
- An Improved Predictive Accuracy Bound for Averaging Classifiers (2001) (42)
- Maximizing Concave Functions in Fixed Dimension (1993) (41)
- Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments (2004) (41)
- Combining expert advice in reactive environments (2006) (40)
- Recognizing Properties of Periodic Graphs (1990) (37)
- Fast indexing method for multidimensional nearest-neighbor search (1998) (37)
- Partial and complete cyclic orders (1976) (37)
- Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs (1993) (36)
- A note on degeneracy in linear programming (1986) (36)
- New algorithms for generalized network flows (1992) (36)
- Essays in Game Theory, In Honor of Michael Maschler (1994) (33)
- A modified layered-step interior-point algorithm for linear programming (1998) (31)
- On Play by Means of Computing Machines (Preliminary Version).@@@A Theory of Higher Order Probabilities.@@@Knowledge and Efficient Computation.@@@Realizability Semantics for Error-Tolerant Logics (Preliminary Version). (1988) (31)
- Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm (1986) (31)
- on the Geometric Separability of Boolean Functions (1996) (30)
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension (1984) (29)
- Using Fast Matrix Multiplication to Find Basic Solutions (1998) (28)
- A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension (1992) (27)
- On the ε-perturbation method for avoiding degeneracy (1989) (27)
- Adaptive Caching in Big SQL using the HDFS Cache (2016) (26)
- On orientations and shortest paths (1989) (26)
- A unified approach to interior point algorithms for linear complementarity problems: A summary (1991) (23)
- An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem (1986) (22)
- A sublinear parallel algorithm for stable matching (1994) (21)
- A monotone complementarity problem with feasible solutions but no complementary solutions (1977) (21)
- New results on the average behavior of simplex algorithms (1984) (20)
- Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon (1991) (20)
- On the parametric nonlinear complementarity problem (1978) (20)
- The Complexity of Searching a Graph (Preliminary Version) (1981) (19)
- Algorithms and complexity analysis for some flow problems (1991) (18)
- Linear programming with two variables per inequality in poly-log time (1986) (18)
- Introduction: New approaches to linear programming (1986) (18)
- Path Independent Choices (1978) (17)
- A Note on Approximate Linear Programming (1992) (17)
- On computable beliefs of rational machines (1989) (17)
- One Up on LRU (2003) (17)
- On the expected number of linear complementarity cones intersected by random and semi-random rays (1986) (15)
- Efficient Coalition Detection in Traitor Tracing (2008) (15)
- Carving Perfect Layers out of Docker Images (2019) (15)
- Horizontal and vertical decomposition in interior point methods for linear programs (1994) (15)
- Linear-Time Algorithms for Linear Programming in R and Related Problems (1983) (14)
- Dynamic location problems (1986) (14)
- EFFICIENT NEAREST NEIGHBOR INDEXING BASED ON A COLLECTION OF SPACE FILLING CURVES (1997) (14)
- Is Binary Encoding Appropriate for the Problem-Language Relationship? (1982) (13)
- Linear programming in low dimensions (1997) (13)
- Nucleoluses of Compound Simple Games (1974) (12)
- Mixtures of order matrices and generalized order matrices (1977) (12)
- The kernel and the nucleolus of a product of simple games (1971) (11)
- A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions (1996) (11)
- Segmenting and representing background in color images (1996) (10)
- Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets (2007) (10)
- On monotonicity in parametric linear complementarity problems (1977) (10)
- An analysis of EUV resist stochastic printing failures (2019) (8)
- Tensor Decomposition of Cooperative Games (1975) (8)
- Optimizing The Selection of Strangers To Answer Questions in Social Media (2014) (8)
- LINEAR PROGRAMMING (1986) (1987) (8)
- An O(N log N) Algorithm for a Class of Matching Problems (1978) (7)
- An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function (1985) (7)
- On Solving the Linear Programming Problem Approximately (1990) (7)
- A Two-Resource Allocation Problem Solvable in Linear Time (1985) (7)
- A Linear Programming Instance with Many Crossover Events (1996) (6)
- The Relation Between the Path of Centers and Smale's Regularization of the Linear Programming Problem (1991) (6)
- Adaptive Caching Algorithms for Big Data Systems (2015) (6)
- Equilibrium in prediction markets with buyers and sellers (2010) (6)
- AI Descartes: Combining Data and Theory for Derivable Scientific Discovery (2021) (5)
- Adaptive traitor tracing for large anonymous attack (2008) (5)
- Techniques for Speeding up Range-Max Queries in OLAP Data Cubes (1997) (5)
- Research Report FINDING A LINE OF SIGHT THRU BOXES IN d-SPACE IN LINEAR TIME (1996) (5)
- The minimum reservation rate problem in digital audio/video systems (1993) (5)
- MAXENT: consistent cardinality estimation in action (2006) (5)
- Contribution of EUV resist counting statistics to stochastic printing failures (2021) (4)
- A General NP-Completeness Theorem (1999) (4)
- Interval hash tree: an efficient index structure for searching object queries in large image databases (2000) (4)
- Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB (2006) (4)
- Research REMARKS ON BOUNDED RATIONALITY (1986) (4)
- Kernels of compound games with simple components (1974) (3)
- On the complexity of the one-terminal network design problem (1982) (3)
- Pursuing Mobile Hiders in a Graph (1978) (3)
- Color image background segmentation and representation (1996) (3)
- ON FINDING ADDITIVE , SUPERADDITIVE AND SUBADDITIVE SET-FUNCTIONS SUBJECT TO LINEAR INEQUALITIES (2004) (2)
- ON THE COMPLEXITY OF SOLVING THE GENERALIZED SET PACKING PROBLEM APPROXIMATELY (2004) (2)
- A Lagrangian Relaxation Method for Approximating the Analytic Center of a Polytope (1992) (2)
- Symbolic Regression using Mixed-Integer Nonlinear Optimization (2020) (2)
- On Fulkerson's Conjecture About Consistent Labeling Processes (1979) (2)
- An Anomaly Detection Approach for Plankton Species Discovery (2022) (2)
- Linear Programming (for the Encyclopedia of Microcomputers) (1991) (2)
- On Probabilistic Machines, Bounded Rationality and Average-Case Complexity (1994) (2)
- Bayesian Experimental Design for Symbolic Discovery (2022) (2)
- Formation of Preferences and Strategic Analysis : Can they be Decoupled ? (2001) (1)
- IBM Research Report Efficient Traitor Tracing (2006) (1)
- Formation of preferences and strategic analysis (2010) (1)
- Linear programming (2018) (1)
- On Play by Means of Computing Machines .A Theory of Higher Order Probabilities.Knowledge and Efficient Computation.Realizability Semantics for Error-Tolerant Logics (1988) (1)
- An intergenerational cake eating game (1979) (1)
- Fairness in Scheduling On-line Load Balancing with Applications to Machine Scheduling and Virtual Circuit Routing. In (1995) (0)
- Towards a Formal Analysis of Emotions in Games (2010) (0)
- Basic analysis of the UIP method (1991) (0)
- Edge Three-Coloring of Tournaments (1978) (0)
- Equilibrium Computation (2014) (0)
- 38 LINEAR PROGRAMMING (1997) (0)
- Optimal Precision in the Presence of Uncertainty (Preliminary Version) (1985) (0)
- 50 LINEAR PROGRAMMING (2016) (0)
- LINEAR PROGRAMMING (1 986) (1987) (0)
- Proceedings of the First international conference on Algorithmic Applications in Management (2005) (0)
- Tree Network and Planar Rectilinear Location Theory (A. J. W. Kolen) (1988) (0)
- 10171 Abstracts Collection - Equilibrium Computation (2010) (0)
- 10171 Abstracts Collection Equilibrium Computation Dagstuhl Seminar (2008) (0)
- Combining data and theory for derivable scientific discovery with AI-Descartes (2023) (0)
- Preface (2006) (0)
- A Note on Karmarkar s Projective Transformation (2004) (0)
- Listing service (1971) (0)
- A class of potential reduction algorithms (1991) (0)
- Formatting Instructions for MOR Articles (2000) (0)
- Equilibrium Computation (Dagstuhl Seminar 14342) (2014) (0)
- The class of linear complementarity problems with P 0-matrices (1991) (0)
- Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings (2005) (0)
- 49 LINEAR PROGRAMMING (2017) (0)
- SVM Computation in a Distributed Database (2013) (0)
- Final Report on ONR Contract N00014-94-C-0007. (1997) (0)
- Extending NC and RNC algorithms (1989) (0)
- “Inscrutable” badges for verifying a mobile missile Quota (1989) (0)
- Initial points and stopping criteria (1991) (0)
- CHOICE FUNCTIONS: A mapping c: X*- X is called a choice function, if for every (1980) (0)
- A Conjugate Direction Method for Approximating the Analytic Center of a Polytope (1998) (0)
- Integration of Data and Theory for Accelerated Derivable Symbolic Discovery (2021) (0)
- Proofs of convergence theorems (1991) (0)
- Constructing Small Sample Spaces for De � Randomization of Algorithms (2004) (0)
- NOTE Partitioning with Two Lines in the Plane (1985) (0)
This paper list is powered by the following services:
Other Resources About Nimrod Megiddo
What Schools Are Affiliated With Nimrod Megiddo?
Nimrod Megiddo is affiliated with the following schools:
