2008 | ||
---|---|---|
89 | EE | Debabrata Dash, Jun Rao, Nimrod Megiddo, Anastasia Ailamaki, Guy M. Lohman: Dynamic faceted search for discovery-driven analysis. CIKM 2008: 3-12 |
88 | EE | Hongxia Jin, Jeffrey B. Lotspiech, Michael Nelson, Nimrod Megiddo: Adaptive traitor tracing for large anonymous attack. Digital Rights Management Workshop 2008: 1-8 |
87 | EE | Hongxia Jin, Jeffery Lotspiech, Nimrod Megiddo: Efficient Coalition Detection in Traitor Tracing. SEC 2008: 365-380 |
2007 | ||
86 | EE | Elad Hazan, Nimrod Megiddo: Online Learning with Prior Knowledge. COLT 2007: 499-513 |
85 | EE | Nimrod Megiddo, Vijay V. Vazirani: Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. WINE 2007: 362-367 |
84 | EE | 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) |
2006 | ||
83 | EE | 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 |
82 | EE | Volker Markl, Marcel Kutsch, Tam Minh Tran, Peter J. Haas, Nimrod Megiddo: MAXENT: consistent cardinality estimation in action. SIGMOD Conference 2006: 775-777 |
81 | EE | Daniela Pucci de Farias, Nimrod Megiddo: Combining expert advice in reactive environments. J. ACM 53(5): 762-799 (2006) |
80 | EE | Nimrod Megiddo, Yinfeng Xu, Binhai Zhu: Preface. Theor. Comput. Sci. 363(3): 247 (2006) |
2005 | ||
79 | Nimrod Megiddo, Yinfeng Xu, Binhai Zhu: Algorithmic Applications in Management, First International Conference, AAIM 2005, Xian, China, June 22-25, 2005, Proceedings Springer 2005 | |
78 | EE | 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 |
2004 | ||
77 | EE | Daniela Pucci de Farias, Nimrod Megiddo: Exploration-Exploitation Tradeoffs for Experts Algorithms in Reactive Environments. NIPS 2004 |
76 | EE | Nimrod Megiddo, Dharmendra S. Modha: Outperforming LRU with an Adaptive Replacement Cache Algorithm. IEEE Computer 37(4): 58-65 (2004) |
2003 | ||
75 | EE | Nimrod Megiddo, Dharmendra S. Modha: ARC: A Self-Tuning, Low Overhead Replacement Cache. FAST 2003 |
74 | EE | Daniela Pucci de Farias, Nimrod Megiddo: How to Combine Expert (and Novice) Advice when Actions Impact the Environment? NIPS 2003 |
2002 | ||
73 | EE | Felix Naumann, Ching-Tien Ho, Xuqing Tian, Laura M. Haas, Nimrod Megiddo: Attribute Classification Using Feature Analysis. ICDE 2002: 271 |
72 | EE | Jun Rao, Chun Zhang, Nimrod Megiddo, Guy M. Lohman: Automating physical database design in a parallel database. SIGMOD Conference 2002: 558-569 |
2001 | ||
71 | John Langford, Matthias Seeger, Nimrod Megiddo: An Improved Predictive Accuracy Bound for Averaging Classifiers. ICML 2001: 290-297 | |
70 | EE | 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) |
2000 | ||
69 | EE | Tomás Feder, Nimrod Megiddo, Serge A. Plotkin: A sublinear parallel algorithm for stable matching. Theor. Comput. Sci. 233(1-2): 297-308 (2000) |
1998 | ||
68 | EE | Sunita Sarawagi, Rakesh Agrawal, Nimrod Megiddo: Discovery-Driven Exploration of OLAP Data Cubes. EDBT 1998: 168-182 |
67 | Nimrod Megiddo, Ramakrishnan Srikant: Discovering Predictive Association Rules. KDD 1998: 274-278 | |
66 | Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya: A modified layered-step interior-point algorithm for linear programming. Math. Program. 82: 339-355 (1998) | |
65 | EE | Peter A. Beling, Nimrod Megiddo: Using Fast Matrix Multiplication to Find Basic Solutions. Theor. Comput. Sci. 205(1-2): 307-316 (1998) |
1997 | ||
64 | EE | Ching-Tien Ho, Rakesh Agrawal, Nimrod Megiddo, Ramakrishnan Srikant: Range Queries in OLAP Data Cubes. SIGMOD Conference 1997: 73-88 |
63 | EE | Nimrod Megiddo, Vivek Sarkar: Optimal Weighted Loop Fusion for Parallel Programs. SPAA 1997: 282-291 |
1996 | ||
62 | EE | Tibor Hegedüs, Nimrod Megiddo: on the Geometric Separability of Boolean Functions. Discrete Applied Mathematics 66(3): 205-218 (1996) |
61 | EE | Shinji Mizuno, Nimrod Megiddo, Takashi Tsuchiya: A Linear Programming Instance with Many Crossover Events. J. Complexity 12(4): 474-479 (1996) |
60 | 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) | |
1995 | ||
59 | Miklós Ajtai, Nimrod Megiddo, Orli Waarts: Improved Algorithms and Analysis for Secretary Problems and Generalizations. FOCS 1995: 473-482 | |
1994 | ||
58 | Tomás Feder, Nimrod Megiddo, Serge A. Plotkin: A Sublinear Parallel Algorithm for Stable Matching. SODA 1994: 632-637 | |
57 | EE | Daphne Koller, Nimrod Megiddo, Bernhard von Stengel: Fast algorithms for finding randomized strategies in game trees. STOC 1994: 750-759 |
56 | Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. Algorithmica 11(3): 320-340 (1994) | |
55 | EE | Noga Alon, Nimrod Megiddo: Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time. J. ACM 41(2): 422-434 (1994) |
54 | Edith Cohen, Nimrod Megiddo: New algorithms for generalized network flows. Math. Program. 64: 325-336 (1994) | |
53 | Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities With Two Variables per Inequality. SIAM J. Comput. 23(6): 1313-1347 (1994) | |
52 | EE | Daphne Koller, Nimrod Megiddo: Constructing Small Sample Spaces Satisfying Given Constants. SIAM J. Discrete Math. 7(2): 260-274 (1994) |
1993 | ||
51 | Nimrod Megiddo, Moni Naor, David P. Anderson: The Minimum Reservation Rate Problem in Digital Audio/Video Systems. ISTCS 1993: 43-48 | |
50 | EE | Daphne Koller, Nimrod Megiddo: Constructing small sample spaces satisfying given constraints. STOC 1993: 268-277 |
49 | EE | Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Periodic Graphs. J. ACM 40(4): 791-830 (1993) |
48 | 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) | |
47 | Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61: 263-280 (1993) | |
46 | 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) | |
1992 | ||
45 | Edith Cohen, Nimrod Megiddo: New Algorithms for Generalized Network Flows. ISTCS 1992: 103-114 | |
44 | 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 | |
43 | Nimrod Megiddo: A Note on Approximate Linear Programming. Inf. Process. Lett. 42(1): 53 (1992) | |
42 | Masakazu Kojima, Nimrod Megiddo, Yinyu Ye: An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54: 267-279 (1992) | |
1991 | ||
41 | Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Springer 1991 | |
40 | Edith Cohen, Nimrod Megiddo: Algorithms and Complexity Analysis for Some Flow Problems. SODA 1991: 120-130 | |
39 | Edith Cohen, Nimrod Megiddo: Improved Algorithms for Linear Inequalities with Two Variables per Inequality (Extended Abstract) STOC 1991: 145-155 | |
38 | EE | Refael Hassin, Nimrod Megiddo: Approximation algorithms for hitting objects with straight lines. Discrete Applied Mathematics 30(1): 29-42 (1991) |
37 | Nimrod Megiddo, Christos H. Papadimitriou: On Total Functions, Existence Theorems and Computational Complexity. Theor. Comput. Sci. 81(2): 317-324 (1991) | |
1990 | ||
36 | Noga Alon, Nimrod Megiddo: Parallel Linear Programming in Fixed Dimension Almost Surely in Constant Time FOCS 1990: 574-582 | |
35 | Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo: A Logic for Reasoning about Probabilities Inf. Comput. 87(1/2): 78-128 (1990) | |
34 | Nimrod Megiddo: On the Complexity of Some Geometric Problems in Unbounded Dimension. J. Symb. Comput. 10(3/4): 327-334 (1990) | |
33 | 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) | |
1989 | ||
32 | Edith Cohen, Nimrod Megiddo: Strongly Polynomial-Time and NC Algorithms for Detecting Cycles in Dynamic Graphs (Preliminary Version) STOC 1989: 523-534 | |
31 | Nimrod Megiddo: Extending NC and RNC Algorithms. Algorithmica 4(4): 501-517 (1989) | |
30 | Nimrod Megiddo: On the Ball Spanned by Balls. Discrete & Computational Geometry 4: 605-610 (1989) | |
1988 | ||
29 | Ronald Fagin, Joseph Y. Halpern, Nimrod Megiddo: A Logic for Reasoning about Probabilities LICS 1988: 410-421 | |
28 | Nimrod Megiddo: On the Complexity of Polyhedral Separability. Discrete & Computational Geometry 3: 325-337 (1988) | |
27 | EE | 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) |
26 | Nimrod Megiddo, Uzi Vishkin: On Finding a Minimum Dominating Set in a Tournament. Theor. Comput. Sci. 61: 307-316 (1988) | |
1986 | ||
25 | George S. Lueker, Nimrod Megiddo, Vijaya Ramachandran: Linear Programming with Two Variables per Inequality in Poly-Log Time (Preliminary Version) STOC 1986: 196-205 | |
24 | Nimrod Megiddo, Avi Wigderson: On Play by Means of Computing Machines. TARK 1986: 259-274 | |
23 | Nimrod Megiddo: Introduction: New Approaches to Linear Programming. Algorithmica 1(4): 387-394 (1986) | |
22 | 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) | |
1985 | ||
21 | Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi: Optimal Precision in the Presence of Uncertainty (Preliminary Version) STOC 1985: 346-355 | |
20 | EE | 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) |
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 | EE | Joseph Y. Halpern, Nimrod Megiddo, Ashfaq A. Munshi: Optimal precision in the presence of uncertainty. J. Complexity 1(2): 170-196 (1985) |
1984 | ||
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 | EE | Nimrod Megiddo: Linear Programming in Linear Time When the Dimension Is Fixed. J. ACM 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) | |
1983 | ||
13 | EE | Nimrod Megiddo: Applying Parallel Computation Algorithms in the Design of Serial Algorithms J. ACM 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) | |
1982 | ||
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? Theor. Comput. Sci. 19: 337-341 (1982) | |
1981 | ||
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) | |
1979 | ||
4 | EE | Zvi Galil, Nimrod Megiddo: A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort. J. ACM 26(1): 58-64 (1979) |
1978 | ||
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) | |
1977 | ||
1 | Zvi Galil, Nimrod Megiddo: Cyclic Ordering is NP-Complete. Theor. Comput. Sci. 5(2): 179-182 (1977) |