Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nimrod Megiddo
2010 – today
- 2013
[c41]Jalal Mahmud, Michelle X. Zhou, Nimrod Megiddo, Jeffrey Nichols, Clemens Drews: Recommending targeted strangers from whom to solicit information on social media. IUI 2013: 37-48
2000 – 2009
- 2008
- [c40]Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia Ailamaki, Guy M. Lohman: Dynamic faceted search for discovery-driven analysis. CIKM 2008: 3-12
- [c39]Hongxia Jin, Jeffrey B. Lotspiech, Michael Nelson, Nimrod Megiddo: Adaptive traitor tracing for large anonymous attack. Digital Rights Management Workshop 2008: 1-8
- [c38]Hongxia Jin, Jeffery Lotspiech, Nimrod Megiddo: Efficient Coalition Detection in Traitor Tracing. SEC 2008: 365-380
- 2007
- [j51]Volker Markl, Peter J. Haas, Marcel Kutsch, Nimrod Megiddo, Utkarsh Srivastava, Tam Minh Tran: Consistent selectivity estimation via maximum entropy. VLDB J. 16(1): 55-76 (2007)
- [c37]
- [c36]Nimrod Megiddo, Vijay V. Vazirani: Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. WINE 2007: 362-367
- 2006
- [j50]Daniela Pucci de Farias, Nimrod Megiddo: Combining expert advice in reactive environments. J. ACM 53(5): 762-799 (2006)
- [j49]
- [c35]Marcel Kutsch, Peter J. Haas, Volker Markl, Nimrod Megiddo, Tam Minh Tran: Integrating a Maximum-Entropy Cardinality Estimator into DB2 UDB. EDBT 2006: 1092-1096
- [c34]Volker Markl, Marcel Kutsch, Tam Minh Tran, Peter J. Haas, Nimrod Megiddo: MAXENT: consistent cardinality estimation in action. SIGMOD Conference 2006: 775-777
- 2005
- [c33]Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam Minh Tran, Peter J. Haas, Utkarsh Srivastava: Consistently Estimating the Selectivity of Conjuncts of Predicates. VLDB 2005: 373-384
- [e1]Nimrod Megiddo, Yinfeng Xu, Binhai Zhu (Eds.): Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings. Lecture Notes in Computer Science 3521, Springer 2005, ISBN 3-540-26224-5
- 2004
- [j48]Nimrod Megiddo, Dharmendra S. Modha: Outperforming LRU with an Adaptive Replacement Cache Algorithm. IEEE Computer 37(4): 58-65 (2004)
- [c32]Daniela Pucci de Farias, Nimrod Megiddo: Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments. NIPS 2004
- 2003
- [c31]
- [c30]Daniela Pucci de Farias, Nimrod Megiddo: How to Combine Expert (and Novice) Advice when Actions Impact the Environment? NIPS 2003
- 2002
- [c29]Felix Naumann, Ching-Tien Ho, Xuqing Tian, Laura M. Haas, Nimrod Megiddo: Attribute Classification Using Feature Analysis. ICDE 2002: 271
- [c28]Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman: Automating physical database design in a parallel database. SIGMOD Conference 2002: 558-569
- 2001
- [j47]Miklós Ajtai, Nimrod Megiddo, Orli Waarts: Improved Algorithms and Analysis for Secretary Problems and Generalizations. SIAM J. Discrete Math. 14(1): 1-27 (2001)
- [c27]John Langford, Matthias Seeger, Nimrod Megiddo: An Improved Predictive Accuracy Bound for Averaging Classifiers. ICML 2001: 290-297
- 2000
- [j46]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin: A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1-2): 297-308 (2000)
- [c26]Vivek Sarkar, Nimrod Megiddo: An analytical model for loop tiling and its solution. ISPASS 2000: 146-153
1990 – 1999
- 1998
- [j45]Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya: A modified layered-step interior-point algorithm for linear programming. Math. Program. 82: 339-355 (1998)
- [j44]Peter A. Beling, Nimrod Megiddo: Using Fast Matrix Multiplication to Find Basic Solutions. Theor. Comput. Sci. 205(1-2): 307-316 (1998)
- [c25]Sunita Sarawagi, Rakesh Agrawal, Nimrod Megiddo: Discovery-Driven Exploration of OLAP Data Cubes. EDBT 1998: 168-182
- [c24]
- 1997
- [c23]Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant: Range Queries in OLAP Data Cubes. SIGMOD Conference 1997: 73-88
- [c22]Nimrod Megiddo, Vivek Sarkar: Optimal Weighted Loop Fusion for Parallel Programs. SPAA 1997: 282-291
- 1996
- [j43]Tibor Hegedüs, Nimrod Megiddo: on the Geometric Separability of Boolean Functions. Discrete Applied Mathematics 66(3): 205-218 (1996)
- [j42]Shinji Mizuno, Nimrod Megiddo, Takashi Tsuchiya: A Linear Programming Instance with Many Crossover Events. J. Complexity 12(4): 474-479 (1996)
- [j41]Miklós Ajtai, Nimrod Megiddo: A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions. SIAM J. Comput. 25(6): 1171-1195 (1996)
- [c21]Qian Huang, Nimrod Megiddo: Color image background segmentation and representation. ICIP (3) 1996: 1027-1030
- 1995
- [c20]Miklós Ajtai, Nimrod Megiddo, Orli Waarts: Improved Algorithms and Analysis for Secretary Problems and Generalizations. FOCS 1995: 473-482
- 1994
- [j40]Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11(3): 320-340 (1994)
- [j39]
- [j38]Edith Cohen, Nimrod Megiddo: New algorithms for generalized network flows. Math. Program. 64: 325-336 (1994)
- [j37]Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23(6): 1313-1347 (1994)
- [j36]Daphne Koller, Nimrod Megiddo: Constructing Small Sample Spaces Satisfying Given Constraints. SIAM J. Discrete Math. 7(2): 260-274 (1994)
- [c19]Tomás Feder, Nimrod Megiddo, Serge A. Plotkin: A Sublinear Parallel Algorithm for Stable Matching. SODA 1994: 632-637
- [c18]Daphne Koller, Nimrod Megiddo, Bernhard von Stengel: Fast algorithms for finding randomized strategies in game trees. STOC 1994: 750-759
- 1993
- [j35]Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40(4): 791-830 (1993)
- [j34]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Math. Program. 59: 1-21 (1993)
- [j33]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61: 263-280 (1993)
- [j32]Dorit S. Hochbaum, Nimrod Megiddo, Joseph Naor, Arie Tamir: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality. Math. Program. 62: 69-83 (1993)
- [c17]Nimrod Megiddo, Moni Naor, David P. Anderson: The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993: 43-48
- [c16]Daphne Koller, Nimrod Megiddo: Constructing small sample spaces satisfying given constraints. STOC 1993: 268-277
- 1992
- [j31]
- [j30]Masakazu Kojima, Nimrod Megiddo, Yinyu Ye: An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54: 267-279 (1992)
- [c15]
- [c14]Miklós Ajtai, Nimrod Megiddo: A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimension. STOC 1992: 327-338
- 1991
- [b1]Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science 538, Springer 1991, ISBN 3-540-54509-3
- [j29]Refael Hassin, Nimrod Megiddo: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30(1): 29-42 (1991)
- [j28]Nimrod Megiddo: On Finding Primal- and Dual-Optimal Bases. INFORMS Journal on Computing 3(1): 63-65 (1991)
- [j27]Nimrod Megiddo, Christos H. Papadimitriou: On Total Functions, Existence Theorems and Computational Complexity. Theor. Comput. Sci. 81(2): 317-324 (1991)
- [c13]Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991: 120-130
- [c12]Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). STOC 1991: 145-155
- 1990
- [j26]Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo: A Logic for Reasoning about Probabilities. Inf. Comput. 87(1/2): 78-128 (1990)
- [j25]Nimrod Megiddo: On the Complexity of Some Geometric Problems in Unbounded Dimension. J. Symb. Comput. 10(3/4): 327-334 (1990)
- [j24]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran: Linear Programming with Two Variables per Inequality in Poly-Log Time. SIAM J. Comput. 19(6): 1000-1010 (1990)
- [c11]
1980 – 1989
- 1989
- [j23]
- [j22]
- [c10]Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). STOC 1989: 523-534
- 1988
- [j21]Nimrod Megiddo: On the Complexity of Polyhedral Separability. Discrete & Computational Geometry 3: 325-337 (1988)
- [j20]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou: The complexity of searching a graph. J. ACM 35(1): 18-44 (1988)
- [j19]Nimrod Megiddo, Uzi Vishkin: On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. 61: 307-316 (1988)
- [c9]Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo: A Logic for Reasoning about Probabilities. LICS 1988: 410-421
- 1986
- [j18]Nimrod Megiddo: Introduction: New Approaches to Linear Programming. Algorithmica 1(4): 387-394 (1986)
- [j17]Nimrod Megiddo, Eitan Zemel: An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem. J. Algorithms 7(3): 358-368 (1986)
- [c8]George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran: Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version). STOC 1986: 196-205
- [c7]
- 1985
- [j16]Ilan Adler, Nimrod Megiddo: A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension. J. ACM 32(4): 871-895 (1985)
- [j15]Refael Hassin, Nimrod Megiddo: An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6(2): 265-274 (1985)
- [j14]
- [j13]Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi: Optimal precision in the presence of uncertainty. J. Complexity 1(2): 170-196 (1985)
- [c6]Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi: Optimal Precision in the Presence of Uncertainty (Preliminary Version). STOC 1985: 346-355
- 1984
- [j12]Nimrod Megiddo: Linear Programming in Linear Time When the Dimension Is Fixed. J. ACM 31(1): 114-127 (1984)
- [j11]Nimrod Megiddo, Kenneth J. Supowit: On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13(1): 182-196 (1984)
- [c5]Ilan Adler, Nimrod Megiddo: A Simplex Algorithm Whose Average Number of Steps is Bounded between Two Quadratic Functions of the Smaller Dimension. STOC 1984: 312-323
- 1983
- [j10]Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. J. ACM 30(4): 852-865 (1983)
- [j9]Nimrod Megiddo: Towards a Genuinely Polynomial Algorithm for Linear Programming. SIAM J. Comput. 12(2): 347-353 (1983)
- [j8]Nimrod Megiddo, Arie Tamir: New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12(4): 751-758 (1983)
- [j7]Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R3 and Related Problems. SIAM J. Comput. 12(4): 759-776 (1983)
- 1982
- [j6]Nimrod Megiddo: Is Binary Encoding Appropriate for the Problem-Language Relationship? Theor. Comput. Sci. 19: 337-341 (1982)
- [c4]Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R^3 and Related Problems. FOCS 1982: 329-338
- 1981
- [j5]Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran: An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10(2): 328-337 (1981)
- [c3]Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou: The Complexity of Searching a Graph (Preliminary Version). FOCS 1981: 376-385
- [c2]Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. FOCS 1981: 399-408
1970 – 1979
- 1979
- [j4]
- 1978
- [j3]
- [j2]Nimrod Megiddo, Arie Tamir: An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7(2): 154-157 (1978)
- [c1]
- 1977
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-08 22:50 CEST by the dblp team