`Travelled to:`

1 × Austria

1 × Norway

1 × United Kingdom

13 × USA

2 × Canada

`Collaborated with:`

E.Cohen D.Koller R.Srikant J.Y.Halpern M.Ajtai I.Adler ∅ J.Rao G.M.Lohman V.Markl M.Kutsch T.M.Tran P.J.Haas J.Langford M.W.Seeger B.v.Stengel R.Fagin G.S.Lueker V.Ramachandran A.A.Munshi C.Zhang C.Ho R.Agrawal Q.Huang B.Dom W.Niblack D.Dash A.Ailamaki U.Srivastava

`Talks about:`

algorithm (5) linear (3) inequ (3) time (3) two (3) log (3) function (2) variabl (2) program (2) predict (2)

## Person: Nimrod Megiddo

### DBLP: Megiddo:Nimrod

### Contributed to:

### Wrote 18 papers:

- CIKM-2008-DashRMAL #analysis
- Dynamic faceted search for discovery-driven analysis (DD, JR, NM, AA, GML), pp. 3–12.
- SIGMOD-2006-MarklKTHM #consistency #estimation #named
- MAXENT: consistent cardinality estimation in action (VM, MK, TMT, PJH, NM), pp. 775–777.
- VLDB-2005-MarklMKTHS
- Consistently Estimating the Selectivity of Conjuncts of Predicates (VM, NM, MK, TMT, PJH, US), pp. 373–384.
- SIGMOD-2002-RaoZML #automation #database #design #parallel #physics
- Automating physical database design in a parallel database (JR, CZ, NM, GML), pp. 558–569.
- ICML-2001-LangfordSM #bound #classification #predict
- An Improved Predictive Accuracy Bound for Averaging Classifiers (JL, MWS, NM), pp. 290–297.
- KDD-1998-MegiddoS #predict
- Discovering Predictive Association Rules (NM, RS), pp. 274–278.
- SIGMOD-1997-HoAMS #query
- Range Queries in OLAP Data Cubes (CTH, RA, NM, RS), pp. 73–88.
- ICPR-1996-HuangDMN #image #representation
- Segmenting and representing background in color images (QH, BD, NM, WN), pp. 13–17.
- STOC-1994-KollerMS #algorithm #game studies #performance #random
- Fast algorithms for finding randomized strategies in game trees (DK, NM, BvS), pp. 750–759.
- STOC-1993-KollerM #constraints
- Constructing small sample spaces satisfying given constraints (DK, NM), pp. 268–277.
- STOC-1992-AjtaiM #algorithm #linear #programming
- A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension (MA, NM), pp. 327–338.
- STOC-1991-CohenM #algorithm #difference #linear
- Improved Algorithms for Linear Inequalities with Two Variables per Inequality (EC, NM), pp. 145–155.
- STOC-1989-CohenM #algorithm #detection #graph #polynomial
- Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (EC, NM), pp. 523–534.
- LICS-1988-FaginHM #logic #reasoning
- A Logic for Reasoning about Probabilities (RF, JYH, NM), pp. 410–421.
- STOC-1986-LuekerMR #difference #linear #programming
- Linear Programming with Two Variables per Inequality in Poly-Log Time (GSL, NM, VR), pp. 196–205.
- STOC-1985-HalpernMM #nondeterminism #precise
- Optimal Precision in the Presence of Uncertainty (JYH, NM, AAM), pp. 346–355.
- STOC-1984-AdlerM #algorithm #bound #polynomial
- A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension (IA, NM), pp. 312–323.
- STOC-1978-Megiddo #combinator #optimisation
- Combinatorial Optimization with Rational Objective Functions (NM), pp. 1–12.