| |
 |      |
                                         |
Note: Links lead to the DBLP on the Web. Nimrod Megiddo 65 Nimrod Megiddo, Dharmendra S. Modha : ARC: A Self-Tuning, Low Overhead Replacement Cache. FAST 2003 64 Felix Naumann , Ching-Tien Ho , Xuqing Tian , Laura M. Haas , Nimrod Megiddo: Attribute Classification Using Feature Analysis. ICDE 2002 : 271 63 Jun Rao , Chun Zhang , Nimrod Megiddo, Guy M. Lohman : Automating physical database design in a parallel database. SIGMOD Conference 2002 : 558-569 62 John Langford , Matthias Seeger , Nimrod Megiddo: An Improved Predictive Accuracy Bound for Averaging Classifiers. ICML 2001 : 290-297 61 Miklós Ajtai , Nimrod Megiddo, Orli Waarts : Improved Algorithms and Analysis for Secretary Problems and Generalizations. SIAM Journal on Discrete Mathematics 14 (1): 1-27 (2001) 60 Tomás Feder , Nimrod Megiddo, Serge A. Plotkin : A sublinear parallel algorithm for stable matching. TCS 233 (1-2): 297-308 (2000) 59 Sunita Sarawagi , Rakesh Agrawal , Nimrod Megiddo: Discovery-Driven Exploration of OLAP Data Cubes. EDBT 1998 : 168-182 58 Nimrod Megiddo, Ramakrishnan Srikant : Discovering Predictive Association Rules. KDD 1998 : 274-278 57 Peter A. Beling , Nimrod Megiddo: Using Fast Matrix Multiplication to Find Basic Solutions. TCS 205 (1-2): 307-316 (1998) 56 Ching-Tien Ho , Rakesh Agrawal , Nimrod Megiddo, Ramakrishnan Srikant : Range Queries in OLAP Data Cubes. SIGMOD Conference 1997 : 73-88 55 Nimrod Megiddo, Vivek Sarkar : Optimal Weighted Loop Fusion for Parallel Programs. SPAA 1997 : 282-291 54 Tibor Hegedüs , Nimrod Megiddo: on the Geometric Separability of Boolean Functions. Discrete Applied Mathematics 66 (3): 205-218 (1996) 53 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) 52 Miklós Ajtai , Nimrod Megiddo, Orli Waarts : Improved Algorithms and Analysis for Secretary Problems and Generalizations. FOCS 1995 : 473-482 51 Tomás Feder , Nimrod Megiddo, Serge A. Plotkin : A Sublinear Parallel Algorithm for Stable Matching. SODA 1994 : 632-637 50 Daphne Koller , Nimrod Megiddo, Bernhard von Stengel : Fast algorithms for finding randomized strategies in game trees. STOC 1994 : 750-759 49 Edith Cohen , Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11 (3): 320-340 (1994) 48 Noga Alon , Nimrod Megiddo: Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. JACM 41 (2): 422-434 (1994) 47 Edith Cohen , Nimrod Megiddo: Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23 (6): 1313-1347 (1994) 46 Daphne Koller , Nimrod Megiddo: Constructing Small Sample Spaces Satisfying Given Constants. SIAM Journal on Discrete Mathematics 7 (2): 260-274 (1994) 45 Nimrod Megiddo, Moni Naor , David P. Anderson : The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993 : 43-48 44 Daphne Koller , Nimrod Megiddo: Constructing small sample spaces satisfying given constraints. STOC 1993 : 268-277 43 Edith Cohen , Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. JACM 40 (4): 791-830 (1993) 42 Edith Cohen , Nimrod Megiddo: New Algorithms for Generalized Network Flows. ISTCS 1992 : 103-114 41 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 40 Nimrod Megiddo: A Note on Approximate Linear Programming. Information Processing Letters 42 (1): 53 (1992) 39 Masakazu Kojima , Nimrod Megiddo, T. Noma , A. Yoshise : A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Springer 1991 38 Edith Cohen , Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991 : 120-130 37 Edith Cohen , Nimrod Megiddo: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract). STOC 1991 : 145-155 36 Nimrod Megiddo, Christos H. Papadimitriou : On Total Functions, Existence Theorems and Computational Complexity. TCS 81 (2): 317-324 (1991) 35 Noga Alon , Nimrod Megiddo: Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. FOCS 1990 : 574-582 34 Ronald Fagin , Joseph Y. Halpern , Nimrod Megiddo: A Logic for Reasoning about Probabilities. Information and Computation 87 (1/2): 78-128 (1990) 33 Nimrod Megiddo: On the Complexity of Some Geometric Problems in Unbounded Dimension. JSC 10 (3/4): 327-334 (1990) 32 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) 31 Edith Cohen , Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version). STOC 1989 : 523-534 30 Nimrod Megiddo: Extending NC and RNC Algorithms. Algorithmica 4 (4): 501-517 (1989) 29 Nimrod Megiddo: On the Ball Spanned by Balls. Discrete & Computational Geometry 4 : 605-610 (1989) 28 Ronald Fagin , Joseph Y. Halpern , Nimrod Megiddo: A Logic for Reasoning about Probabilities. LICS 1988 : 410-421 27 Nimrod Megiddo: On the Complexity of Polyhedral Separability. Discrete & Computational Geometry 3 : 325-337 (1988) 26 Nimrod Megiddo, S. Louis Hakimi , M. R. Garey , David S. Johnson , Christos H. Papadimitriou : The complexity of searching a graph. JACM 35 (1): 18-44 (1988) 25 Nimrod Megiddo, Uzi Vishkin : On Finding a Minimum Dominating Set in a Tournament. TCS 61 : 307-316 (1988) 24 George S. Lueker , Nimrod Megiddo, Vijaya Ramachandran : Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version). STOC 1986 : 196-205 23 Nimrod Megiddo, Avi Wigderson : On Play by Means of Computing Machines. TARK 1986 : 259-274 22 Nimrod Megiddo: Introduction: New Approaches to Linear Programming. Algorithmica 1 (4): 387-394 (1986) 21 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) 20 Joseph Y. Halpern , Nimrod Megiddo, Ashfaq A. Munshi : Optimal Precision in the Presence of Uncertainty (Preliminary Version). STOC 1985 : 346-355 19 Refael Hassin , Nimrod Megiddo: An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function. J. Algorithms 6 (2): 265-274 (1985) 18 Nimrod Megiddo: Partitioning with Two Lines in the Plane. J. Algorithms 6 (3): 430-433 (1985) 17 Ilan Adler , Nimrod Megiddo: A Simplex Algorithm Whose Average Number of Steps Is Bounded between Two Quadratic Functions of the Smaller Dimension. JACM 32 (4): 871-895 (1985) 16 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 15 Nimrod Megiddo: Linear Programming in Linear Time When the Dimension Is Fixed. JACM 31 (1): 114-127 (1984) 14 Nimrod Megiddo, Kenneth J. Supowit : On the Complexity of Some Common Geometric Location Problems. SIAM J. Comput. 13 (1): 182-196 (1984) 13 Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. JACM 30 (4): 852-865 (1983) 12 Nimrod Megiddo: Towards a Genuinely Polynomial Algorithm for Linear Programming. SIAM J. Comput. 12 (2): 347-353 (1983) 11 Nimrod Megiddo, Arie Tamir : New Results on the Complexity of p-Center Problems. SIAM J. Comput. 12 (4): 751-758 (1983) 10 Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R³ and Related Problems. SIAM J. Comput. 12 (4): 759-776 (1983) 9 Nimrod Megiddo: Linear-Time Algorithms for Linear Programming in R^3 and Related Problems. FOCS 1982 : 329-338 8 Nimrod Megiddo: Is Binary Encoding Appropriate for the Problem-Language Relationship? TCS 19 : 337-341 (1982) 7 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 6 Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms. FOCS 1981 : 399-408 5 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) 4 Zvi Galil , Nimrod Megiddo: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. JACM 26 (1): 58-64 (1979) 3 Nimrod Megiddo: Combinatorial Optimization with Rational Objective Functions. STOC 1978 : 1-12 2 Nimrod Megiddo, Arie Tamir : An O(N log N) Algorithm for a Class of Matching Problems. SIAM J. Comput. 7 (2): 154-157 (1978) 1 Zvi Galil , Nimrod Megiddo: Cyclic Ordering is NP-Complete. TCS 5 (2): 179-182 (1977)  DiSC'03 © 2003 Association for Computing Machinery |
