| |
 |      |
                                               |
Note: Links lead to the DBLP on the Web. Nimrod Megiddo 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 Nimrod Megiddo, Yinfeng Xu , Binhai Zhu : Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings Springer 2005 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 Daniela Pucci de Farias , Nimrod Megiddo: Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments. NIPS 2004 Nimrod Megiddo, Dharmendra S. Modha : Outperforming LRU with an Adaptive Replacement Cache Algorithm. IEEE Computer 37 (4): 58-65 (2004) Nimrod Megiddo, Dharmendra S. Modha : ARC: A Self-Tuning, Low Overhead Replacement Cache. FAST 2003 Daniela Pucci de Farias , Nimrod Megiddo: How to Combine Expert (and Novice) Advice when Actions Impact the Environment? NIPS 2003 Felix Naumann , Ching-Tien Ho , Xuqing Tian , Laura M. Haas , Nimrod Megiddo: Attribute Classification Using Feature Analysis. ICDE 2002 : 271 Jun Rao , Chun Zhang , Nimrod Megiddo, Guy M. Lohman : Automating physical database design in a parallel database. SIGMOD Conference 2002 : 558-569 John Langford , Matthias Seeger , Nimrod Megiddo: An Improved Predictive Accuracy Bound for Averaging Classifiers. ICML 2001 : 290-297 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) Tomás Feder , Nimrod Megiddo, Serge A. Plotkin : A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233 (1-2): 297-308 (2000) Sunita Sarawagi , Rakesh Agrawal , Nimrod Megiddo: Discovery-Driven Exploration of OLAP Data Cubes. EDBT 1998 : 168-182 Nimrod Megiddo, Ramakrishnan Srikant : Discovering Predictive Association Rules. KDD 1998 : 274-278 Nimrod Megiddo, Shinji Mizuno , Takashi Tsuchiya : A modified layered-step interior-point algorithm for linear programming. Math. Program. 82 : 339-355 (1998) Peter A. Beling , Nimrod Megiddo: Using Fast Matrix Multiplication to Find Basic Solutions. Theor. Comput. Sci. 205 (1-2): 307-316 (1998) Ching-Tien Ho , Rakesh Agrawal , Nimrod Megiddo, Ramakrishnan Srikant : Range Queries in OLAP Data Cubes. SIGMOD Conference 1997 : 73-88 Nimrod Megiddo, Vivek Sarkar : Optimal Weighted Loop Fusion for Parallel Programs. SPAA 1997 : 282-291 Tibor Hegedüs , Nimrod Megiddo: on the Geometric Separability of Boolean Functions. Discrete Applied Mathematics 66 (3): 205-218 (1996) Shinji Mizuno , Nimrod Megiddo, Takashi Tsuchiya : A Linear Programming Instance with Many Crossover Events. J. Complexity 12 (4): 474-479 (1996) 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) Miklós Ajtai , Nimrod Megiddo, Orli Waarts : Improved Algorithms and Analysis for Secretary Problems and Generalizations. FOCS 1995 : 473-482 Tomás Feder , Nimrod Megiddo, Serge A. Plotkin : A Sublinear Parallel Algorithm for Stable Matching. SODA 1994 : 632-637 Daphne Koller , Nimrod Megiddo, Bernhard von Stengel : Fast algorithms for finding randomized strategies in game trees. STOC 1994 : 750-759 Edith Cohen , Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11 (3): 320-340 (1994) Noga Alon , Nimrod Megiddo: Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. J. ACM 41 (2): 422-434 (1994) Edith Cohen , Nimrod Megiddo: New algorithms for generalized network flows. Math. Program. 64 : 325-336 (1994) Edith Cohen , Nimrod Megiddo: Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23 (6): 1313-1347 (1994) Daphne Koller , Nimrod Megiddo: Constructing Small Sample Spaces Satisfying Given Constants. SIAM J. Discrete Math. 7 (2): 260-274 (1994) Nimrod Megiddo, Moni Naor , David P. Anderson : The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993 : 43-48 Daphne Koller , Nimrod Megiddo: Constructing small sample spaces satisfying given constraints. STOC 1993 : 268-277 Edith Cohen , Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40 (4): 791-830 (1993) 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) Masakazu Kojima , Nimrod Megiddo, Shinji Mizuno : A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61 : 263-280 (1993) 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) Edith Cohen , Nimrod Megiddo: New Algorithms for Generalized Network Flows. ISTCS 1992 : 103-114 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 Nimrod Megiddo: A Note on Approximate Linear Programming. Inf. Process. Lett. 42 (1): 53 (1992) Masakazu Kojima , Nimrod Megiddo, Yinyu Ye : An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54 : 267-279 (1992) Masakazu Kojima , Nimrod Megiddo, Toshihito Noma , Akiko Yoshise : A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Springer 1991 Edith Cohen , Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991 : 120-130 Edith Cohen , Nimrod Megiddo: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) STOC 1991 : 145-155 Nimrod Megiddo, Christos H. Papadimitriou : On Total Functions, Existence Theorems and Computational Complexity. Theor. Comput. Sci. 81 (2): 317-324 (1991) Noga Alon , Nimrod Megiddo: Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time FOCS 1990 : 574-582 Ronald Fagin , Joseph Y. Halpern , Nimrod Megiddo: A Logic for Reasoning about Probabilities Inf. Comput. 87 (1/2): 78-128 (1990) Nimrod Megiddo: On the Complexity of Some Geometric Problems in Unbounded Dimension. J. Symb. Comput. 10 (3/4): 327-334 (1990) 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) Edith Cohen , Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) STOC 1989 : 523-534 Nimrod Megiddo: Extending NC and RNC Algorithms. Algorithmica 4 (4): 501-517 (1989) Nimrod Megiddo: On the Ball Spanned by Balls. Discrete & Computational Geometry 4 : 605-610 (1989) Ronald Fagin , Joseph Y. Halpern , Nimrod Megiddo: A Logic for Reasoning about Probabilities LICS 1988 : 410-421 Nimrod Megiddo: On the Complexity of Polyhedral Separability. Discrete & Computational Geometry 3 : 325-337 (1988) 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) Nimrod Megiddo, Uzi Vishkin : On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. 61 : 307-316 (1988) George S. Lueker , Nimrod Megiddo, Vijaya Ramachandran : Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) STOC 1986 : 196-205 Nimrod Megiddo, Avi Wigderson : On Play by Means of Computing Machines. TARK 1986 : 259-274 Nimrod Megiddo: Introduction: New Approaches to Linear Programming. Algorithmica 1 (4): 387-394 (1986) 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) Joseph Y. Halpern , Nimrod Megiddo, Ashfaq A. Munshi : Optimal Precision in the Presence of Uncertainty (Preliminary Version) STOC 1985 : 346-355 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) Refael Hassin , Nimrod Megiddo: An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6 (2): 265-274 (1985) Nimrod Megiddo: Partitioning with Two Lines in the Plane. J. Algorithms 6 (3): 430-433 (1985) Joseph Y. Halpern , Nimrod Megiddo, Ashfaq A. Munshi : Optimal precision in the presence of uncertainty. J. Complexity 1 (2): 170-196 (1985) 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 Nimrod Megiddo: Linear Programming in Linear Time When the Dimension Is Fixed. J. ACM 31 (1): 114-127 (1984) Nimrod Megiddo, Kenneth J. Supowit : On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13 (1): 182-196 (1984) Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms J. ACM 30 (4): 852-865 (1983) Nimrod Megiddo: Towards a Genuinely Polynomial Algorithm for Linear Programming. SIAM J. Comput. 12 (2): 347-353 (1983) Nimrod Megiddo, Arie Tamir : New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12 (4): 751-758 (1983) Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R³ and Related Problems. SIAM J. Comput. 12 (4): 759-776 (1983) Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R^3 and Related Problems FOCS 1982 : 329-338 Nimrod Megiddo: Is Binary Encoding Appropriate for the Problem-Language Relationship? Theor. Comput. Sci. 19 : 337-341 (1982) 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 Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms FOCS 1981 : 399-408 Nimrod Megiddo, Arie Tamir , Eitan Zemel , R. Chandrasekaran : An O(n log² n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. SIAM J. Comput. 10 (2): 328-337 (1981) Zvi Galil , Nimrod Megiddo: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. J. ACM 26 (1): 58-64 (1979) Nimrod Megiddo: Combinatorial Optimization with Rational Objective Functions STOC 1978 : 1-12 Nimrod Megiddo, Arie Tamir : An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7 (2): 154-157 (1978) Zvi Galil , Nimrod Megiddo: Cyclic Ordering is NP-Complete. Theor. Comput. Sci. 5 (2): 179-182 (1977) 1 [ 16 ] [ 20 ] 2 [ 63 ] [ 67 ] 3 [ 43 ] [ 58 ] [ 59 ] [ 69 ] 4 [ 36 ] [ 54 ] 5 [ 50 ] 6 [ 64 ] 7 [ 5 ] 8 [ 32 ] [ 38 ] [ 39 ] [ 44 ] [ 48 ] [ 52 ] [ 53 ] [ 55 ] 9 [ 29 ] [ 35 ] 10 [ 73 ] [ 76 ] 11 [ 57 ] [ 68 ] 12 [ 1 ] [ 4 ] 13 [ 7 ] [ 27 ] 14 [ 72 ] 15 [ 77 ] [ 79 ] 16 [ 7 ] [ 27 ] 17 [ 17 ] [ 21 ] [ 29 ] [ 35 ] 18 [ 19 ] 19 [ 61 ] 20 [ 63 ] [ 72 ] 21 [ 45 ] 22 [ 7 ] [ 27 ] 23 [ 40 ] [ 41 ] [ 46 ] [ 47 ] 24 [ 49 ] [ 51 ] [ 56 ] 25 [ 77 ] [ 79 ] 26 [ 70 ] 27 [ 71 ] 28 [ 25 ] [ 33 ] 29 [ 77 ] [ 79 ] 30 [ 46 ] [ 47 ] [ 60 ] [ 65 ] 31 [ 74 ] [ 75 ] 32 [ 17 ] [ 21 ] 33 [ 45 ] 34 [ 50 ] 35 [ 72 ] 36 [ 40 ] 37 [ 7 ] [ 27 ] [ 37 ] 38 [ 57 ] [ 68 ] 39 [ 25 ] [ 33 ] 40 [ 71 ] 41 [ 67 ] 42 [ 62 ] 43 [ 70 ] 44 [ 63 ] [ 66 ] 45 [ 77 ] 46 [ 56 ] 47 [ 14 ] 48 [ 2 ] [ 5 ] [ 11 ] [ 45 ] 49 [ 72 ] 50 [ 77 ] [ 79 ] 51 [ 60 ] [ 65 ] 52 [ 26 ] 53 [ 58 ] [ 69 ] 54 [ 24 ] 55 [ 78 ] 56 [ 41 ] 57 [ 40 ] 58 [ 5 ] [ 22 ] 59 [ 71 ] 60 [ 78 ]  ©2006 Association for Computing Machinery |
