Find:
Searching for
PHRASE
nimrod megiddo
.
Restrict to:
Header
Title
Order by:
Expected citations
Hubs
Usage
Date
Try:
Google (CiteSeer)
Google (Web)
Yahoo!
MSN
CSB
DBLP
103 documents found.
Order: number of citations.
A Unified Approach to Interior Point Algorithms for.. - Kojima, Megiddo.. (1991)
(Correct)
(104 citations)
Problems: A Summary Masakazu Kojima
Nimrod Megiddo
y Toshihito Noma z Akiko Yoshise x
Problems: A Summary Masakazu Kojima,
Nimrod Megiddo
, Toshihito Noma, Akiko Yoshise
www.math.tau.ac.il/~megiddo/./psfiles/kmnys.ps.gz
A Logic for Reasoning about Probabilities - Fagin, Halpern, Megiddo (1990)
(Correct)
(96 citations)
Probabilities Ronald Fagin Joseph Y. Halpern
Nimrod Megiddo
IBM Almaden Research Center San Jose, CA
Probabilities Ronald Fagin, Joseph Y. Halpern,
Nimrod Megiddo
simon.cs.cornell.edu/Info/People/halpern/papers/probability_logic.ps
Homotopy Continuation Methods for Nonlinear Complementarity .. - Kojima, Megiddo, Noma (1989)
(Correct)
(34 citations)
Complementarity Problems Masakazu Kojima y
Nimrod Megiddo
z Toshihito Noma x January 1989 Abstract.
Complementarity Problems Masakazu Kojima,
Nimrod Megiddo
, Toshihito Noma
www.math.tau.ac.il/~megiddo/./psfiles/kmn.ps.gz
Range Queries in OLAP Data Cubes - Ho, Agrawal, Megiddo, Srikant (1997)
(Correct)
(31 citations)
OLAP Data Cubes Ching-Tien Ho Rakesh Agrawal
Nimrod Megiddo
Ramakrishnan Srikant IBM Almaden Research
OLAP Data Cubes Ching-Tien Ho, Rakesh Agrawal,
Nimrod Megiddo
, Ramakrishnan Srikant
www.almaden.ibm.com/cs/quest/papers/sigmod97_rsum.ps
Discovery-driven Exploration of OLAP Data Cubes - Sarawagi, Agrawal, Megiddo (1998)
(Correct)
(30 citations)
Data Cubes Sunita Sarawagi Rakesh Agrawal
Nimrod Megiddo
IBM Almaden Research Center, 650 Harry Road,
[SAM98] Sunita Sarawagi, Rakesh Agrawal, and
Nimrod Megiddo
. Discovery-driven exploration of OLAP data
www.almaden.ibm.com/u/ragrawal/papers/edbt98_ex.ps
Constructing Small Sample Spaces Satisfying Given Constraints - Koller, Megiddo (1993)
(Correct)
(29 citations)
Koller e-mail: daphne@cs.stanford.edu
Nimrod Megiddo
y e-mail: megiddo@almaden.ibm.com Abstract
Satisfying Given Constraints Daphne Koller,
Nimrod Megiddo
theory.stanford.edu/~megiddo/./psfiles/stoc93.ps.gz
On Finding Primal- and Dual-Optimal Bases - Nimrod Megiddo Revised (1991)
(Correct)
(23 citations)
On Finding Primal- and Dual-Optimal Bases
Nimrod Megiddo
revised June 1990) Abstract. Weshow that
On Finding Primal- and Dual-Optimal Bases
Nimrod Megiddo
Revised
theory.stanford.edu/%7Emegiddo/pdf/primdual.pdf
On The Complexity Of Polyhedral Separability - Nimrod Megiddo Ibm (1988)
(Correct)
(22 citations)
On The Complexity Of Polyhedral Separability
Nimrod Megiddo
Ibm Almaden Researchcenter, San Jose, Ca
On The Complexity Of Polyhedral Separability
Nimrod Megiddo
Ibm
theory.stanford.edu/%7Emegiddo/pdf/hausler.pdf
Tight Bounds and 2-Approximation Algorithms for.. - Hochbaum, Megiddo.. (1992)
(Correct)
(22 citations)
per Inequality Dorit S. Hochbaum
Nimrod Megiddo
y Joseph Naor z Arie Tamir x December
Variables per Inequality Dorit S. Hochbaum,
Nimrod Megiddo
, Joseph Naor, Arie Tamir
theory.stanford.edu/%7Emegiddo/pdf/2satful.pdf
The Complexity of Two-Person Zero-Sum Games in Extensive Form - Koller, Megiddo (1990)
(Correct)
(20 citations)
Games in ExtensiveForm Daphne Koller
Nimrod Megiddo
y November 1990 This paper investigates the
Games in Extensive Form Daphne Koller,
Nimrod Megiddo
theory.stanford.edu/%7Emegiddo/pdf/recall.pdf
Parallel Linear Programming in Fixed Dimension Almost Surely in.. - Noga Alon (1990)
(Correct)
(18 citations)
Almost Surely in Constant Time Noga Alon and
Nimrod Megiddo
IBM Almaden Research Center San Jose,
www.math.tau.ac.il/~megiddo/./psfiles/lpcitrev.ps.gz
Efficient Computation of Equilibria for Extensive.. - Koller, Megiddo, von.. (1995)
(Correct)
(17 citations)
Games Daphne Koller daphne@cs.berkeley.edu
Nimrod Megiddo
y megiddo@almaden.ibm.com Bernhard von
for Extensive Two-Person Games Daphne Koller,
Nimrod Megiddo
, Bernhard von Stengel
theory.stanford.edu/%7Emegiddo/pdf/lemke.pdf
Fast Algorithms for Finding Randomized Strategies in Game.. - Koller, Megiddo, von.. (1994)
(Correct)
(13 citations)
Trees Daphne Koller daphne@cs.berkeley.edu
Nimrod Megiddo
y megiddo@almaden.ibm.com Bernhard von
Strategies in Game Trees Daphne Koller,
Nimrod Megiddo
, Bernhard von Stengel
theory.stanford.edu/%7Emegiddo/pdf/stoc94.pdf
First 20 documents
Next 20
Try your query at:
Google (CiteSeer)
Google (Web)
Yahoo!
MSN
CSB
DBLP
CiteSeer.IST - Copyright
Penn State
and
NEC