The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Nimrod Megiddo: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  83. Dynamic faceted search for discovery-driven analysis. [Citation Graph (, )][DBLP]


  84. Adaptive traitor tracing for large anonymous attack. [Citation Graph (, )][DBLP]


  85. Efficient Coalition Detection in Traitor Tracing. [Citation Graph (, )][DBLP]


  86. Continuity Properties of Equilibrium Prices and Allocations in Linear Fisher Markets. [Citation Graph (, )][DBLP]


  87. Approximation algorithms for hitting objects with straight lines. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.013secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002