zbMATH — the first resource for mathematics

Megiddo, Nimrod

Compute Distance To:
 Author ID: megiddo.nimrod Published as: Megiddo, N.; Megiddo, Nimrod
 Documents Indexed: 115 Publications since 1971, including 6 Books
all top 5

Co-Authors

 43 single-authored 10 Kojima, Masakazu 7 Cohen, Edith 7 Mizuno, Shinji 7 Tamir, Arie 6 Koller, Daphne 4 Galil, Zvi 4 Hassin, Refael 3 Ajtai, Miklós 3 Noma, Toshihito 3 Papadimitriou, Christos Harilaos 3 Tsuchiya, Takashi 3 Zemel, Eitan 2 Adler, Ilan 2 Chandrasekaran, Ramaswamy 2 Feder, Tomás 2 Hakimi, Seifollah Louis 2 Halpern, Joseph Yehuda 2 Plotkin, Serge A. 2 von Stengel, Bernhard 2 Waarts, Orli 2 Xu, Yinfeng 2 Yoshise, Akiko 2 Zhu, Binhai 1 Agrawal, Shipra 1 Alon, Noga M. 1 Armbruster, Benjamin 1 Beling, Peter A. 1 Dyer, Martin E. 1 Fagin, Ronald 1 Garey, Michael Randolph 1 Hardt, Moritz 1 Hazan, Elad 1 Hegedűs, Tibor 1 Hochbaum, Dorit S. 1 Ichimori, Tetsuo 1 Johnson, David Stifler 1 Kalai, Ehud 1 Kosaraju, S. Rao 1 Lueker, George S. 1 Munshi, Ashfaq A. 1 Naor, Joseph Seffi 1 O’Rourke, Joseph 1 Pucci de Farias, Daniela 1 Ramachandran, Vijaya 1 Shub, Michael 1 Supowit, Kenneth J. 1 Todd, Michael J. 1 Vishkin, Uzi 1 Wootters, Mary 1 Ye, Yinyu
all top 5

Serials

 9 Mathematics of Operations Research 9 SIAM Journal on Computing 7 Journal of the Association for Computing Machinery 7 Mathematical Programming 7 Theoretical Computer Science 6 Mathematical Programming. Series A. Series B 5 Operations Research Letters 3 Journal of Algorithms 3 Algorithmica 3 Discrete & Computational Geometry 3 Games and Economic Behavior 2 Discrete Applied Mathematics 2 International Journal of Game Theory 2 SIAM Journal on Algebraic and Discrete Methods 2 Journal of Complexity 2 SIAM Journal on Discrete Mathematics 2 Linear Algebra and its Applications 2 SIAM Journal on Applied Mathematics 2 Bulletin of the American Mathematical Society 2 Lecture Notes in Computer Science 1 Discrete Mathematics 1 Information Processing Letters 1 Israel Journal of Mathematics 1 Econometrica 1 Mathematical Programming Study 1 Networks 1 Journal of Symbolic Computation 1 Information and Computation 1 Economics Letters 1 ORSA Journal on Computing 1 Bulletin of the American Mathematical Society. New Series 1 Journal of Inequalities and Applications 1 Journal of the ACM 1 RIMS Kokyuroku 1 Methods of Operations Research
all top 5

Fields

 73 Operations research, mathematical programming (90-XX) 64 Computer science (68-XX) 18 Game theory, economics, finance, and other social and behavioral sciences (91-XX) 14 Numerical analysis (65-XX) 12 Combinatorics (05-XX) 4 General and overarching topics; collections (00-XX) 4 Mathematical logic and foundations (03-XX) 4 Order, lattices, ordered algebraic structures (06-XX) 3 Convex and discrete geometry (52-XX) 2 Probability theory and stochastic processes (60-XX) 1 Geometry (51-XX) 1 Information and communication theory, circuits (94-XX)

Citations contained in zbMATH Open

101 Publications have been cited 2,608 times in 2,066 Documents Cited by Year
Linear-time algorithms for linear programming in $$R^ 3$$ and related problems. Zbl 0521.68034
Megiddo, Nimrod
1983
A unified approach to interior point algorithms for linear complementarity problems: A summary. Zbl 0745.90069
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito; Yoshise, Akiko
1991
Applying parallel computation algorithms in the design of serial algorithms. Zbl 0627.68034
Megiddo, Nimrod
1983
On the complexity of some common geometric location problems. Zbl 0534.68032
Megiddo, Nimrod; Supowit, Kenneth J.
1984
Combinatorial optimization with rational objective functions. Zbl 0425.90076
Megiddo, Nimrod
1979
Linear programming in linear time when the dimension is fixed. Zbl 0637.90064
Megiddo, Nimrod
1984
A logic for reasoning about probabilities. Zbl 0811.03014
Fagin, Ronald; Halpern, Joseph Y.; Megiddo, Nimrod
1990
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
1988
A primal-dual infeasible-interior-point algorithm for linear programming. Zbl 0808.90093
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
1993
Pathways to the optimal set in linear programming. Zbl 0687.90056
Megiddo, Nimrod
1989
Computational complexity of the game theory approach to cost allocation for a tree. Zbl 0397.90111
Megiddo, Nimrod
1978
A unified approach to interior point algorithms for linear complementary problems. Zbl 0766.90077
Kojima, Masakazu (ed.); Megiddo, Nimrod (ed.); Noma, Toshihito (ed.); Yoshise, Akiko (ed.)
1991
Boundary behavior of interior point algorithms in linear programming. Zbl 0675.90050
Megiddo, Nimrod; Shub, Michael
1989
Progress in mathematical programming. Interior-point and related methods. (Based on the conference held at Pacific Grove, California, March 1-4, 1987). Zbl 0669.00026
Megiddo, Nimrod (ed.)
1989
Homotopy continuation methods for nonlinear complementarity problems. Zbl 0744.90087
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito
1991
Optimal flows in networks with multiple sources and sinks. Zbl 0296.90048
Megiddo, Nimrod
1974
The maximum coverage location problem. Zbl 0514.90019
Megiddo, Nimrod; Zemel, Eitan; Hakimi, S. Louis
1983
An O(n $$log^ 2$$ n) algorithm for the kth longest path in a tree with applications to location problems. Zbl 0456.68071
Megiddo, N.; Tamir, A.; Zemel, E.; Chandrasekaran, R.
1981
New results on the complexity of p-center problems. Zbl 0521.68037
Megiddo, Nimrod; Tamir, Arie
1983
On total functions, existence theorems and computational complexity. Zbl 0731.68036
1991
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Zbl 0802.90080
Hochbaum, Dorit S.; Megiddo, Nimrod; Naor, Joseph; Tamir, Arie
1993
An interior point potential reduction algorithm for the linear complementarity problem. Zbl 0764.90083
Kojima, Masakazu; Megiddo, Nimrod; Ye, Yinyu
1992
On the complexity of locating linear facilities in the plane. Zbl 0507.90025
Megiddo, Nimrod; Tamir, Arie
1982
On finding primal- and dual-optimal bases. Zbl 0755.90056
Megiddo, Nimrod
1991
On the complexity of polyhedral separability. Zbl 0669.68035
Megiddo, Nimrod
1988
The weighted Euclidean 1-center problem. Zbl 0533.90030
Megiddo, Nimrod
1983
Partitioning with two lines in the plane. Zbl 0582.51013
Megiddo, Nimrod
1985
Towards a genuinely polynomial algorithm for linear programming. Zbl 0532.90061
Megiddo, Nimrod
1983
Approximation algorithms for hitting objects with straight lines. Zbl 0800.68619
Hassin, Refael; Megiddo, Nimrod
1991
Efficient computation of equilibria for extensive two-person games. Zbl 0859.90127
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
1996
The complexity of two-person zero-sum games in extensive form. Zbl 0758.90084
Koller, Daphne; Megiddo, Nimrod
1992
Computing circular separability. Zbl 0598.52008
O’Rourke, Joseph; Kosaraju, S. Rao; Megiddo, Nimrod
1986
Cost allocation for Steiner trees. Zbl 0378.90118
Megiddo, N.
1978
On the existence and uniqueness of solutions in nonlinear complementarity theory. Zbl 0363.90102
Megiddo, Nimrod; Kojima, Masakazu
1977
Linear time algorithms for some separable quadratic programming problems. Zbl 0793.90049
Megiddo, Nimrod; Tamir, Arie
1993
On the ball spanned by balls. Zbl 0688.90020
Megiddo, Nimrod
1989
On finding a minimum dominating set in a tournament. Zbl 0661.68064
Megiddo, Nimrod; Vishkin, Uzi
1988
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Zbl 0634.65044
1985
Finding least-distance lines. Zbl 0517.05007
Megiddo, Nimrod; Tamir, Arie
1983
Partial and complete cyclic orders. Zbl 0361.06001
Megiddo, Nimrod
1976
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Zbl 0780.90063
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
1993
On the complexity of some geometric problems in unbounded dimension. Zbl 0717.68046
Megiddo, Nimrod
1990
A fast selection algorithm and the problem of optimum distribution of effort. Zbl 0404.90062
Galil, Zvi; Megiddo, Nimrod
1979
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod
1978
A good algorithm for lexicographically optimal flows in multiterminal networks. Zbl 0354.90083
Megiddo, Nimrod
1977
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
2001
Fast algorithms for finding randomized strategies in game trees. Zbl 1345.68258
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
1994
Improved algorithms for linear inequalities with two variables per inequality. Zbl 0833.90094
Cohen, Edith; Megiddo, Nimrod
1994
Maximizing concave functions in fixed dimension. Zbl 0968.90504
Cohen, Edith; Megiddo, Nimrod
1993
A general framework of continuation methods for complementarity problems. Zbl 0801.90108
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
1993
A monotone complementarity problem with feasible solutions but no complementary solutions. Zbl 0353.90084
Megiddo, Nimrod
1977
On the complexity of linear programming. Zbl 0735.90044
Megiddo, Nimrod
1989
Introduction: New approaches to linear programming. Zbl 0612.90082
Megiddo, Nimrod
1986
A note on degeneracy in linear programming. Zbl 0596.90057
Megiddo, Nimrod
1986
Optimal precision in the presence of uncertainty. Zbl 0598.68033
Halpern, Joseph Y.; Megiddo, Nimrod; Munshi, Ashfaq A.
1985
Using fast matrix multiplication to find basic solutions. Zbl 0913.68079
Beling, Peter A.; Megiddo, Nimrod
1998
On the $$\epsilon$$-perturbation method for avoiding degeneracy. Zbl 0682.90057
Megiddo, Nimrod; Chandrasekaran, R.
1989
On orientations and shortest paths. Zbl 0678.05027
Hassin, Refael; Megiddo, Nimrod
1989
On repeated games with incomplete information played by non-Bayesian players. Zbl 0441.90118
Megiddo, N.
1980
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Zbl 0782.68053
Cohen, Edith; Megiddo, Nimrod
1993
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. Zbl 0618.90061
Megiddo, Nimrod
1986
On the parametric nonlinear complementarity problem. Zbl 0379.90094
Megiddo, Nimrod
1978
On the geometric separability of Boolean functions. Zbl 0854.68034
Hegedüs, Tibor; Megiddo, Nimrod
1996
An 0(n log n) randomizing algorithm for the weighted Euclidean 1-center problem. Zbl 0612.90033
Megiddo, Nimrod; Zemel, Eitan
1986
Recognizing properties of periodic graphs. Zbl 0753.05047
Cohen, Edith; Megiddo, Nimrod
1991
On the expected number of linear complementarity cones intersected by random and semi-random rays. Zbl 0613.90092
Megiddo, Nimrod
1986
A note on the generality of the self-dual algorithm with various starting points. Zbl 0561.90063
Megiddo, Nimrod
1985
Mixtures of order matrices and generalized order matrices. Zbl 0377.05008
Megiddo, Nimrod
1977
A modified layered-step interior-point algorithm for linear programming. Zbl 0920.90098
Megiddo, Nimrod; Mizuno, Shinji; Tsuchiya, Takashi
1998
New algorithms for generalized network flows. Zbl 0816.90057
Cohen, Edith; Megiddo, Nimrod
1994
Constructing small sample spaces satisfying given constraints. Zbl 0797.60018
Koller, Daphne; Megiddo, Nimrod
1994
New results on the average behavior of simplex algorithms. Zbl 0545.90066
Adler, Ilan; Megiddo, Nimrod; Todd, Michael J.
1984
Finding mixed strategies with small supports in extensive form games. Zbl 0856.90143
Koller, Daphne; Megiddo, Nimrod
1996
Constructing small sample spaces satisfying given constraints. Zbl 1310.68153
Koller, Daphne; Megiddo, Nimrod
1993
Exact computation of optimal inventory policies over an unbounded horizon. Zbl 0744.90021
Hassin, Refael; Megiddo, Nimrod
1991
Combinatorial optimization with rational objective functions. Zbl 1282.68141
Megiddo, Nimrod
1978
On monotonicity in parametric linear complementarity problems. Zbl 0367.90106
Megiddo, Nimrod
1977
A general NP-completeness theorem. Zbl 0815.68055
Megiddo, Nimrod
1993
On solving the linear programming problem approximately. Zbl 0747.90065
Megiddo, Nimrod
1990
On computable beliefs of rational machines. Zbl 0755.90106
Megiddo, Nimrod
1989
An optimal algorithm for finding all the jumps of a monotone step- function. Zbl 0593.68037
Hassin, Refael; Megiddo, Nimrod
1985
Is binary encoding appropriate for the problem-language relationship? Zbl 0484.68032
Megiddo, Nimrod
1982
Path independent choices. Zbl 0431.90008
Kalai, Ehud; Megiddo, Nimrod
1980
Nucleoluses of compound simple games. Zbl 0254.90065
Megiddo, Nimrod
1974
Online learning with prior knowledge. Zbl 1203.68152
2007
Combining expert advice in reactive environments. Zbl 1326.68268
Pucci de Farias, Daniela; Megiddo, Nimrod
2006
A sublinear parallel algorithm for stable matching. Zbl 0961.90088
Feder, Tomás; Megiddo, Nimrod; Plotkin, Serge A.
2000
A linear programming instance with many crossover events. Zbl 0869.90049
Mizuno, Shinji; Megiddo, Nimrod; Tsuchiya, Takashi
1996
A deterministic poly$$(\log\log n)$$-time $$n$$-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
1996
A note on approximate linear programming. Zbl 0762.90051
Megiddo, Nimrod
1992
The kernel and the nucleolus of a product of simple games. Zbl 0208.23006
Megiddo, N.
1971
Equilibrium in prediction markets with buyers and sellers. Zbl 1202.91112
Agrawal, Shipra; Megiddo, Nimrod; Armbruster, Benjamin
2010
Linear programming in low dimensions. Zbl 0904.90115
Dyer, Martin; Megiddo, Nimrod
1997
Parallel linear programming in fixed dimension almost surely in constant time. Zbl 0807.90080
Alon, Noga; Megiddo, Nimrod
1994
Algorithms and complexity analysis for some flow problems. Zbl 0795.68100
Cohen, Edith; Megiddo, Nimrod
1994
The relation between the path of centers and Smale’s regularization of the linear programming problem. Zbl 0727.65053
Kojima, Masakazu; Megiddo, Nimrod
1991
A two-resource allocation problem solvable in linear time. Zbl 0564.90025
Megiddo, Nimrod; Ichimori, Tetsuo
1985
An application of parallel computation to sequential computation: the problem of cost-effective resource allocation. Zbl 0458.68005
Megiddo, Nimrod
1981
On Fulkerson’s conjecture about consistent labeling processes. Zbl 0443.90107
Megiddo, Nimrod; Galil, Zvi
1979
An $$O(N\cdot \log N)$$ algorithm for a class of matching problems. Zbl 0375.68021
Megiddo, Nimrod; Tamir, Arie
1978
Equilibrium in prediction markets with buyers and sellers. Zbl 1202.91112
Agrawal, Shipra; Megiddo, Nimrod; Armbruster, Benjamin
2010
Online learning with prior knowledge. Zbl 1203.68152
2007
Combining expert advice in reactive environments. Zbl 1326.68268
Pucci de Farias, Daniela; Megiddo, Nimrod
2006
Improved algorithms and analysis for secretary problems and generalizations. Zbl 0969.65058
Ajtai, Miklos; Megiddo, Nimrod; Waarts, Orli
2001
A sublinear parallel algorithm for stable matching. Zbl 0961.90088
Feder, Tomás; Megiddo, Nimrod; Plotkin, Serge A.
2000
Using fast matrix multiplication to find basic solutions. Zbl 0913.68079
Beling, Peter A.; Megiddo, Nimrod
1998
A modified layered-step interior-point algorithm for linear programming. Zbl 0920.90098
Megiddo, Nimrod; Mizuno, Shinji; Tsuchiya, Takashi
1998
Linear programming in low dimensions. Zbl 0904.90115
Dyer, Martin; Megiddo, Nimrod
1997
Efficient computation of equilibria for extensive two-person games. Zbl 0859.90127
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
1996
On the geometric separability of Boolean functions. Zbl 0854.68034
Hegedüs, Tibor; Megiddo, Nimrod
1996
Finding mixed strategies with small supports in extensive form games. Zbl 0856.90143
Koller, Daphne; Megiddo, Nimrod
1996
A linear programming instance with many crossover events. Zbl 0869.90049
Mizuno, Shinji; Megiddo, Nimrod; Tsuchiya, Takashi
1996
A deterministic poly$$(\log\log n)$$-time $$n$$-processor algorithm for linear programming in fixed dimension. Zbl 0864.68105
Ajtai, Miklos; Megiddo, Nimrod
1996
Fast algorithms for finding randomized strategies in game trees. Zbl 1345.68258
Koller, Daphne; Megiddo, Nimrod; von Stengel, Bernhard
1994
Improved algorithms for linear inequalities with two variables per inequality. Zbl 0833.90094
Cohen, Edith; Megiddo, Nimrod
1994
New algorithms for generalized network flows. Zbl 0816.90057
Cohen, Edith; Megiddo, Nimrod
1994
Constructing small sample spaces satisfying given constraints. Zbl 0797.60018
Koller, Daphne; Megiddo, Nimrod
1994
Parallel linear programming in fixed dimension almost surely in constant time. Zbl 0807.90080
Alon, Noga; Megiddo, Nimrod
1994
Algorithms and complexity analysis for some flow problems. Zbl 0795.68100
Cohen, Edith; Megiddo, Nimrod
1994
A primal-dual infeasible-interior-point algorithm for linear programming. Zbl 0808.90093
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
1993
Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Zbl 0802.90080
Hochbaum, Dorit S.; Megiddo, Nimrod; Naor, Joseph; Tamir, Arie
1993
Linear time algorithms for some separable quadratic programming problems. Zbl 0793.90049
Megiddo, Nimrod; Tamir, Arie
1993
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Zbl 0780.90063
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
1993
Maximizing concave functions in fixed dimension. Zbl 0968.90504
Cohen, Edith; Megiddo, Nimrod
1993
A general framework of continuation methods for complementarity problems. Zbl 0801.90108
Kojima, Masakazu; Megiddo, Nimrod; Mizuno, Shinji
1993
Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Zbl 0782.68053
Cohen, Edith; Megiddo, Nimrod
1993
Constructing small sample spaces satisfying given constraints. Zbl 1310.68153
Koller, Daphne; Megiddo, Nimrod
1993
A general NP-completeness theorem. Zbl 0815.68055
Megiddo, Nimrod
1993
An interior point potential reduction algorithm for the linear complementarity problem. Zbl 0764.90083
Kojima, Masakazu; Megiddo, Nimrod; Ye, Yinyu
1992
The complexity of two-person zero-sum games in extensive form. Zbl 0758.90084
Koller, Daphne; Megiddo, Nimrod
1992
A note on approximate linear programming. Zbl 0762.90051
Megiddo, Nimrod
1992
A unified approach to interior point algorithms for linear complementarity problems: A summary. Zbl 0745.90069
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito; Yoshise, Akiko
1991
A unified approach to interior point algorithms for linear complementary problems. Zbl 0766.90077
Kojima, Masakazu (ed.); Megiddo, Nimrod (ed.); Noma, Toshihito (ed.); Yoshise, Akiko (ed.)
1991
Homotopy continuation methods for nonlinear complementarity problems. Zbl 0744.90087
Kojima, Masakazu; Megiddo, Nimrod; Noma, Toshihito
1991
On total functions, existence theorems and computational complexity. Zbl 0731.68036
1991
On finding primal- and dual-optimal bases. Zbl 0755.90056
Megiddo, Nimrod
1991
Approximation algorithms for hitting objects with straight lines. Zbl 0800.68619
Hassin, Refael; Megiddo, Nimrod
1991
Recognizing properties of periodic graphs. Zbl 0753.05047
Cohen, Edith; Megiddo, Nimrod
1991
Exact computation of optimal inventory policies over an unbounded horizon. Zbl 0744.90021
Hassin, Refael; Megiddo, Nimrod
1991
The relation between the path of centers and Smale’s regularization of the linear programming problem. Zbl 0727.65053
Kojima, Masakazu; Megiddo, Nimrod
1991
A logic for reasoning about probabilities. Zbl 0811.03014
Fagin, Ronald; Halpern, Joseph Y.; Megiddo, Nimrod
1990
On the complexity of some geometric problems in unbounded dimension. Zbl 0717.68046
Megiddo, Nimrod
1990
On solving the linear programming problem approximately. Zbl 0747.90065
Megiddo, Nimrod
1990
Pathways to the optimal set in linear programming. Zbl 0687.90056
Megiddo, Nimrod
1989
Boundary behavior of interior point algorithms in linear programming. Zbl 0675.90050
Megiddo, Nimrod; Shub, Michael
1989
Progress in mathematical programming. Interior-point and related methods. (Based on the conference held at Pacific Grove, California, March 1-4, 1987). Zbl 0669.00026
Megiddo, Nimrod (ed.)
1989
On the ball spanned by balls. Zbl 0688.90020
Megiddo, Nimrod
1989
On the complexity of linear programming. Zbl 0735.90044
Megiddo, Nimrod
1989
On the $$\epsilon$$-perturbation method for avoiding degeneracy. Zbl 0682.90057
Megiddo, Nimrod; Chandrasekaran, R.
1989
On orientations and shortest paths. Zbl 0678.05027
Hassin, Refael; Megiddo, Nimrod
1989
On computable beliefs of rational machines. Zbl 0755.90106
Megiddo, Nimrod
1989
The complexity of searching a graph. Zbl 0637.68081
Megiddo, N.; Hakimi, S. L.; Garey, M. R.; Johnson, D. S.; Papadimitriou, C. H.
1988
On the complexity of polyhedral separability. Zbl 0669.68035
Megiddo, Nimrod
1988
On finding a minimum dominating set in a tournament. Zbl 0661.68064
Megiddo, Nimrod; Vishkin, Uzi
1988
Computing circular separability. Zbl 0598.52008
O’Rourke, Joseph; Kosaraju, S. Rao; Megiddo, Nimrod
1986
Introduction: New approaches to linear programming. Zbl 0612.90082
Megiddo, Nimrod
1986
A note on degeneracy in linear programming. Zbl 0596.90057
Megiddo, Nimrod
1986
Improved asymptotic analysis of the average number of steps performed by the self-dual simplex algorithm. Zbl 0618.90061
Megiddo, Nimrod
1986
An 0(n log n) randomizing algorithm for the weighted Euclidean 1-center problem. Zbl 0612.90033
Megiddo, Nimrod; Zemel, Eitan
1986
On the expected number of linear complementarity cones intersected by random and semi-random rays. Zbl 0613.90092
Megiddo, Nimrod
1986
Partitioning with two lines in the plane. Zbl 0582.51013
Megiddo, Nimrod
1985
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension. Zbl 0634.65044
1985
Optimal precision in the presence of uncertainty. Zbl 0598.68033
Halpern, Joseph Y.; Megiddo, Nimrod; Munshi, Ashfaq A.
1985
A note on the generality of the self-dual algorithm with various starting points. Zbl 0561.90063
Megiddo, Nimrod
1985
An optimal algorithm for finding all the jumps of a monotone step- function. Zbl 0593.68037
Hassin, Refael; Megiddo, Nimrod
1985
A two-resource allocation problem solvable in linear time. Zbl 0564.90025
Megiddo, Nimrod; Ichimori, Tetsuo
1985
On the complexity of some common geometric location problems. Zbl 0534.68032
Megiddo, Nimrod; Supowit, Kenneth J.
1984
Linear programming in linear time when the dimension is fixed. Zbl 0637.90064
Megiddo, Nimrod
1984
New results on the average behavior of simplex algorithms. Zbl 0545.90066
Adler, Ilan; Megiddo, Nimrod; Todd, Michael J.
1984
Linear-time algorithms for linear programming in $$R^ 3$$ and related problems. Zbl 0521.68034
Megiddo, Nimrod
1983
Applying parallel computation algorithms in the design of serial algorithms. Zbl 0627.68034
Megiddo, Nimrod
1983
The maximum coverage location problem. Zbl 0514.90019
Megiddo, Nimrod; Zemel, Eitan; Hakimi, S. Louis
1983
New results on the complexity of p-center problems. Zbl 0521.68037
Megiddo, Nimrod; Tamir, Arie
1983
The weighted Euclidean 1-center problem. Zbl 0533.90030
Megiddo, Nimrod
1983
Towards a genuinely polynomial algorithm for linear programming. Zbl 0532.90061
Megiddo, Nimrod
1983
Finding least-distance lines. Zbl 0517.05007
Megiddo, Nimrod; Tamir, Arie
1983
On the complexity of locating linear facilities in the plane. Zbl 0507.90025
Megiddo, Nimrod; Tamir, Arie
1982
Is binary encoding appropriate for the problem-language relationship? Zbl 0484.68032
Megiddo, Nimrod
1982
An O(n $$log^ 2$$ n) algorithm for the kth longest path in a tree with applications to location problems. Zbl 0456.68071
Megiddo, N.; Tamir, A.; Zemel, E.; Chandrasekaran, R.
1981
An application of parallel computation to sequential computation: the problem of cost-effective resource allocation. Zbl 0458.68005
Megiddo, Nimrod
1981
On repeated games with incomplete information played by non-Bayesian players. Zbl 0441.90118
Megiddo, N.
1980
Path independent choices. Zbl 0431.90008
Kalai, Ehud; Megiddo, Nimrod
1980
Combinatorial optimization with rational objective functions. Zbl 0425.90076
Megiddo, Nimrod
1979
A fast selection algorithm and the problem of optimum distribution of effort. Zbl 0404.90062
Galil, Zvi; Megiddo, Nimrod
1979
On Fulkerson’s conjecture about consistent labeling processes. Zbl 0443.90107
Megiddo, Nimrod; Galil, Zvi
1979
Computational complexity of the game theory approach to cost allocation for a tree. Zbl 0397.90111
Megiddo, Nimrod
1978
Cost allocation for Steiner trees. Zbl 0378.90118
Megiddo, N.
1978
Cyclic ordering is NP-complete. Zbl 0383.68045
Galil, Zvi; Megiddo, Nimrod
1978
On the parametric nonlinear complementarity problem. Zbl 0379.90094
Megiddo, Nimrod
1978
Combinatorial optimization with rational objective functions. Zbl 1282.68141
Megiddo, Nimrod
1978
An $$O(N\cdot \log N)$$ algorithm for a class of matching problems. Zbl 0375.68021
Megiddo, Nimrod; Tamir, Arie
1978
On the existence and uniqueness of solutions in nonlinear complementarity theory. Zbl 0363.90102
Megiddo, Nimrod; Kojima, Masakazu
1977
A good algorithm for lexicographically optimal flows in multiterminal networks. Zbl 0354.90083
Megiddo, Nimrod
1977
A monotone complementarity problem with feasible solutions but no complementary solutions. Zbl 0353.90084
Megiddo, Nimrod
1977
Mixtures of order matrices and generalized order matrices. Zbl 0377.05008
Megiddo, Nimrod
1977
On monotonicity in parametric linear complementarity problems. Zbl 0367.90106
Megiddo, Nimrod
1977
Partial and complete cyclic orders. Zbl 0361.06001
Megiddo, Nimrod
1976
Tensor decomposition of cooperative games. Zbl 0364.90127
Megiddo, Nimrod
1975
Optimal flows in networks with multiple sources and sinks. Zbl 0296.90048
Megiddo, Nimrod
1974
Nucleoluses of compound simple games. Zbl 0254.90065
Megiddo, Nimrod
1974
...and 1 more Documents
all top 5