On total functions, existence theorems and computational complexity
- Nimrod Megiddo
- Christos H. Papadimitriou
- 1991
- Theoretical Computer Science
Publications
This is our catalog of publications authored by IBM researchers, in collaboration with the global research community. It’s an ever-growing body of work that shows why IBM is one of the most important contributors to modern computing.
Date
Featured collections
Popular topics
79 results for Nimrod Megiddo
Approximation algorithms for hitting objects with straight lines
- Refael Hassin
- Nimrod Megiddo
- 1991
- Discrete Applied Mathematics
A unified approach to interior point algorithms for linear complementarity problems: A summary
- Masakazu Kojima
- Nimrod Megiddo
- et al.
- 1991
- Operations Research Letters
On finding primal- and dual-optimal bases
- Nimrod Megiddo
- 1991
- ORSA journal on computing
On the complexity of some geometric problems in unbounded dimension
- Nimrod Megiddo
- 1990
- Journal of Symbolic Computation
A logic for reasoning about probabilities
- Ronald Fagin
- Joseph Y. Halpern
- et al.
- 1990
- Information and Computation
Extending NC and RNC algorithms
- Nimrod Megiddo
- 1989
- Algorithmica
On orientations and shortest paths
- Rafael Hassin
- Nimrod Megiddo
- 1989
- Linear Algebra and Its Applications
On the ε-perturbation method for avoiding degeneracy
- Nimrod Megiddo
- R. Chandrasekaran
- 1989
- Operations Research Letters
Boundary behavior of interior point algorithms in linear programming
- Nimrod Megiddo
- M. Shub
- 1989
- Mathematics of Operations Research