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

Search the dblp DataBase

Title:
Author:
Mihalis Yannakakis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis
    On the Desirability of Acyclic Database Schemes [Citation Graph (63, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:479-513 [Journal]
  2. Yehoshua Sagiv, Mihalis Yannakakis
    Equivalences Among Relational Expressions with the Union and Difference Operators. [Citation Graph (56, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:633-655 [Journal]
  3. Mihalis Yannakakis
    Algorithms for Acyclic Database Schemes [Citation Graph (48, 22)][DBLP]
    VLDB, 1981, pp:82-94 [Conf]
  4. Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis
    Properties of Acyclic Database Schemes [Citation Graph (32, 0)][DBLP]
    STOC, 1981, pp:355-362 [Conf]
  5. Mihalis Yannakakis
    A Theory of Safe Locking Policies in Database Systems. [Citation Graph (22, 0)][DBLP]
    J. ACM, 1982, v:29, n:3, pp:718-740 [Journal]
  6. Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
    Locking Policies: Safety and Freedom from Deadlock [Citation Graph (19, 0)][DBLP]
    FOCS, 1979, pp:286-297 [Conf]
  7. Marc H. Graham, Mihalis Yannakakis
    Independent Database Schemas. [Citation Graph (19, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:1, pp:121-141 [Journal]
  8. Mihalis Yannakakis, Christos H. Papadimitriou
    Algebraic Dependencies. [Citation Graph (18, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:25, n:1, pp:2-41 [Journal]
  9. Peter Honeyman, Richard E. Ladner, Mihalis Yannakakis
    Testing the Universal Instance Assumption. [Citation Graph (16, 0)][DBLP]
    Inf. Process. Lett., 1980, v:10, n:1, pp:14-19 [Journal]
  10. Robert Endre Tarjan, Mihalis Yannakakis
    Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (14, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:3, pp:566-579 [Journal]
  11. Jeffrey D. Ullman, Mihalis Yannakakis
    The Input/Output Complexity of Transitive Closure. [Citation Graph (13, 7)][DBLP]
    SIGMOD Conference, 1990, pp:44-53 [Conf]
  12. David Maier, Yehoshua Sagiv, Mihalis Yannakakis
    On the Complexity of Testing Implications of Functional and Join Dependencies. [Citation Graph (13, 0)][DBLP]
    J. ACM, 1981, v:28, n:4, pp:680-695 [Journal]
  13. Mihalis Yannakakis
    Serializability by Locking. [Citation Graph (13, 0)][DBLP]
    J. ACM, 1984, v:31, n:2, pp:227-244 [Journal]
  14. Mihalis Yannakakis, Christos H. Papadimitriou
    Algebraic Dependencies (Extended Abstract) [Citation Graph (11, 0)][DBLP]
    FOCS, 1980, pp:328-332 [Conf]
  15. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
    On Datalog vs. Polynomial Time. [Citation Graph (8, 13)][DBLP]
    PODS, 1991, pp:13-25 [Conf]
  16. Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis
    Tools for Template Dependencies. [Citation Graph (8, 0)][DBLP]
    SIAM J. Comput., 1983, v:12, n:1, pp:36-59 [Journal]
  17. Marc H. Graham, Mihalis Yannakakis
    Independent Database Schemas. [Citation Graph (7, 11)][DBLP]
    PODS, 1982, pp:199-204 [Conf]
  18. Mihalis Yannakakis
    Issues of Correctness in Database Concurrency Control by Locking [Citation Graph (6, 0)][DBLP]
    STOC, 1981, pp:363-367 [Conf]
  19. Mihalis Yannakakis
    Freedom from Deadlock of Safe Locking Policies. [Citation Graph (6, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:391-408 [Journal]
  20. Christos H. Papadimitriou, Mihalis Yannakakis
    Tie-Breaking Semantics and Structural Totality. [Citation Graph (5, 9)][DBLP]
    PODS, 1992, pp:16-22 [Conf]
  21. Mihalis Yannakakis
    Graph-Theoretic Methods in Database Theory. [Citation Graph (4, 60)][DBLP]
    PODS, 1990, pp:230-242 [Conf]
  22. Yehoshua Sagiv, Mihalis Yannakakis
    Equivalence among Relational Expressions with the Union and Difference Operation. [Citation Graph (4, 16)][DBLP]
    VLDB, 1978, pp:535-548 [Conf]
  23. Ouri Wolfson, Mihalis Yannakakis
    Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. [Citation Graph (3, 17)][DBLP]
    PODS, 1985, pp:105-112 [Conf]
  24. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Facets (and Some Facets of Complexity) [Citation Graph (3, 0)][DBLP]
    STOC, 1982, pp:255-260 [Conf]
  25. Christos H. Papadimitriou, Mihalis Yannakakis
    A Note on Succinct Representations of Graphs [Citation Graph (3, 0)][DBLP]
    Information and Control, 1986, v:71, n:3, pp:181-185 [Journal]
  26. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Facets (and Some Facets of Complexity). [Citation Graph (3, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:28, n:2, pp:244-259 [Journal]
  27. Mihalis Yannakakis
    Perspectives on Database Theory. [Citation Graph (2, 0)][DBLP]
    FOCS, 1995, pp:224-246 [Conf]
  28. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Complexity of Database Queries. [Citation Graph (2, 12)][DBLP]
    PODS, 1997, pp:12-19 [Conf]
  29. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiway Cuts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    STOC, 1992, pp:241-251 [Conf]
  30. Foto N. Afrati, Stavros S. Cosmadakis, Mihalis Yannakakis
    On Datalog vs. Polynomial Time. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:51, n:2, pp:177-196 [Journal]
  31. Christos H. Papadimitriou, Mihalis Yannakakis
    On Limited Nondeterminism and the Complexity of the V-C Dimension. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:161-170 [Journal]
  32. Robert Endre Tarjan, Mihalis Yannakakis
    Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:254-255 [Journal]
  33. Jeffrey D. Ullman, Mihalis Yannakakis
    High-Probability Parallel Transitive-Closure Algorithms. [Citation Graph (2, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:100-125 [Journal]
  34. Thanasis Hadzilacos, Mihalis Yannakakis
    Deleting Completed Transactions. [Citation Graph (1, 9)][DBLP]
    PODS, 1986, pp:43-46 [Conf]
  35. Mihalis Yannakakis
    Querying Weak Instances. [Citation Graph (1, 19)][DBLP]
    PODS, 1984, pp:275-280 [Conf]
  36. Maria M. Klawe, Wolfgang J. Paul, Nicholas Pippenger, Mihalis Yannakakis
    On Monotone Formulae with Restricted Depth (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    STOC, 1984, pp:480-487 [Conf]
  37. Carsten Lund, Mihalis Yannakakis
    On the hardness of approximating minimization problems. [Citation Graph (1, 0)][DBLP]
    STOC, 1993, pp:286-293 [Conf]
  38. Christos H. Papadimitriou, Mihalis Yannakakis
    Optimization, Approximation, and Complexity Classes (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:229-234 [Conf]
  39. Christos H. Papadimitriou, Mihalis Yannakakis
    Towards an Architecture-Independent Analysis of Parallel Algorithms (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:510-513 [Conf]
  40. Christos H. Papadimitriou, Mihalis Yannakakis
    On complexity as bounded rationality (extended abstract). [Citation Graph (1, 0)][DBLP]
    STOC, 1994, pp:726-733 [Conf]
  41. Mihalis Yannakakis
    Node- and Edge-Deletion NP-Complete Problems [Citation Graph (1, 0)][DBLP]
    STOC, 1978, pp:253-264 [Conf]
  42. Mihalis Yannakakis
    Querying Weak Instances. [Citation Graph (1, 0)][DBLP]
    Advances in Computing Research, 1986, v:3, n:, pp:185-211 [Journal]
  43. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    On Generating All Maximal Independent Sets. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:3, pp:119-123 [Journal]
  44. Esther M. Arkin, Christos H. Papadimitriou, Mihalis Yannakakis
    Modularity of Cycles and Paths in Graphs. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1991, v:38, n:2, pp:255-274 [Journal]
  45. Carsten Lund, Mihalis Yannakakis
    On the Hardness of Approximating Minimization Problems. [Citation Graph (1, 0)][DBLP]
    J. ACM, 1994, v:41, n:5, pp:960-981 [Journal]
  46. Thanasis Hadzilacos, Mihalis Yannakakis
    Deleting Completed Transactions. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:2, pp:360-379 [Journal]
  47. Mihalis Yannakakis
    Node-Deletion Problems on Bipartite Graphs. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:310-327 [Journal]
  48. Mihalis Yannakakis
    Analysis of Recursive Probabilistic Models. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:1-5 [Conf]
  49. Mihalis Yannakakis
    Linear and Book Embeddings of Graphs. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:226-235 [Conf]
  50. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Analysis of Recursive State Machines. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:207-220 [Conf]
  51. Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis
    Timing Verification by Successive Approximation. [Citation Graph (0, 0)][DBLP]
    CAV, 1992, pp:137-150 [Conf]
  52. Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis
    Memory Efficient Algorithms for the Verification of Temporal Properties. [Citation Graph (0, 0)][DBLP]
    CAV, 1990, pp:233-242 [Conf]
  53. Alex Groce, Doron Peled, Mihalis Yannakakis
    AMC: An Adaptive Model Checker. [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:521-525 [Conf]
  54. Mihalis Yannakakis, David Lee
    An Efficient Algorithm for Minimizing Real-time Transition Systems. [Citation Graph (0, 0)][DBLP]
    CAV, 1993, pp:210-224 [Conf]
  55. Mihalis Yannakakis
    Some Open Problems in Approximation. [Citation Graph (0, 0)][DBLP]
    CIAC, 1994, pp:33-39 [Conf]
  56. Christos H. Papadimitriou, Mihalis Yannakakis
    On Limited Nondeterminism and the Complexity of the V.C Dimension (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:12-18 [Conf]
  57. Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, Mihalis Yannakakis
    Compression of Partially Ordered Strings. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:42-56 [Conf]
  58. Rajeev Alur, Mihalis Yannakakis
    Model Checking of Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:114-129 [Conf]
  59. Orna Kupferman, Robert P. Kurshan, Mihalis Yannakakis
    Existence of Reduction Hierarchies. [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:327-340 [Conf]
  60. Mihalis Yannakakis, David Lee
    Testing for Finite State Systems. [Citation Graph (0, 0)][DBLP]
    CSL, 1998, pp:29-44 [Conf]
  61. Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
    Modeling Communications Protocols by Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:267-273 [Conf]
  62. Costas Courcoubetis, Mihalis Yannakakis
    Verifying Temporal Properties of Finite-State Probabilistic Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:338-345 [Conf]
  63. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    How Easy Is Local Search? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:39-42 [Conf]
  64. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Approximability of Trade-offs and Optimal Access of Web Sources. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:86-92 [Conf]
  65. Christos H. Papadimitriou, Mihalis Yannakakis
    Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:358-363 [Conf]
  66. Mihalis Yannakakis
    On a Class of Totally Unimodular Matrices [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:10-16 [Conf]
  67. Mihalis Yannakakis
    A Polynomial Algorithm for the Min Cut Linear Arrangement of Trees (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:274-281 [Conf]
  68. Kousha Etessami, Mihalis Yannakakis
    From Rule-based to Automata-based Testing. [Citation Graph (0, 0)][DBLP]
    FORTE, 2000, pp:53-68 [Conf]
  69. Doron Peled, Moshe Y. Vardi, Mihalis Yannakakis
    Black Box Checking. [Citation Graph (0, 0)][DBLP]
    FORTE, 1999, pp:225-240 [Conf]
  70. Thomas F. La Porta, David Lee, Yow-Jian Lin, Mihalis Yannakakis
    Protocol Feature Interactions. [Citation Graph (0, 0)][DBLP]
    FORTE, 1998, pp:59-74 [Conf]
  71. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Realizability and Verification of MSC Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:797-808 [Conf]
  72. Rajeev Alur, Sampath Kannan, Mihalis Yannakakis
    Communicating Hierarchical State Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:169-178 [Conf]
  73. Costas Courcoubetis, Mihalis Yannakakis
    Markov Decision Processes and Regular Events (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:336-349 [Conf]
  74. Kousha Etessami, Mihalis Yannakakis
    Recursive Markov Decision Processes and Recursive Stochastic Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:891-903 [Conf]
  75. Kousha Etessami, Mihalis Yannakakis
    Recursive Concurrent Stochastic Games. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:324-335 [Conf]
  76. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:64-75 [Conf]
  77. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Multiway Cuts in Directed and Node Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:487-498 [Conf]
  78. Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis
    Searching a Fixed Graph. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:280-289 [Conf]
  79. Carsten Lund, Mihalis Yannakakis
    The Approximation of Maximum Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:40-51 [Conf]
  80. Christos H. Papadimitriou, Mihalis Yannakakis
    Shortest Paths Without a Map. [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:610-620 [Conf]
  81. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:460-470 [Conf]
  82. Sergei Vassilvitskii, Mihalis Yannakakis
    Efficiently Computing Succinct Trade-Off Curves. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:1201-1213 [Conf]
  83. Vijay V. Vazirani, Mihalis Yannakakis
    Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:366-377 [Conf]
  84. Vijay V. Vazirani, Mihalis Yannakakis
    Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:667-681 [Conf]
  85. Mihalis Yannakakis
    Testing, Optimizaton, and Games. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:28-45 [Conf]
  86. Mihalis Yannakakis, Paris C. Kanellakis, Stavros S. Cosmadakis, Christos H. Papadimitriou
    Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:712-722 [Conf]
  87. David Lee, Mihalis Yannakakis
    Optimization problems from feature testing of communication protocols. [Citation Graph (0, 0)][DBLP]
    ICNP, 1996, pp:66-75 [Conf]
  88. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Inference of message sequence charts. [Citation Graph (0, 0)][DBLP]
    ICSE, 2000, pp:304-313 [Conf]
  89. Mihalis Yannakakis
    Hierarchical State Machines. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:315-330 [Conf]
  90. Guoqiang Shu, David Lee, Mihalis Yannakakis
    A note on broadcast encryption key management with applications to large scale emergency alert systems. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  91. Kousha Etessami, Mihalis Yannakakis
    Probability and Recursion. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:2-4 [Conf]
  92. Mihalis Yannakakis
    Recent Developments on the Approximability of Combinatorial Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:363-368 [Conf]
  93. Mihalis Yannakakis
    Testing and Checking of Finite State Systems. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:14- [Conf]
  94. Mihalis Yannakakis
    Testing, Optimizaton, and Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:78-88 [Conf]
  95. David Lee, Christine Liu, Mihalis Yannakakis
    Protocol System Integration, Interface and Interoperability. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2004, pp:1-19 [Conf]
  96. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Value of Information in Distributed Decision-Making (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PODC, 1991, pp:61-64 [Conf]
  97. Christos H. Papadimitriou, Mihalis Yannakakis
    Multiobjective Query Optimization. [Citation Graph (0, 0)][DBLP]
    PODS, 2001, pp:- [Conf]
  98. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Reliable Concurrency Control. [Citation Graph (0, 4)][DBLP]
    PODS, 1985, pp:230-234 [Conf]
  99. Mihalis Yannakakis, Kousha Etessami
    Checking LTL Properties of Recursive Markov Chains. [Citation Graph (0, 0)][DBLP]
    QEST, 2005, pp:155-165 [Conf]
  100. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the complexity of protein folding (abstract). [Citation Graph (0, 0)][DBLP]
    RECOMB, 1998, pp:61-62 [Conf]
  101. Rajeev Alur, Mihalis Yannakakis
    Model Checking of Hierarchical State Machines. [Citation Graph (0, 0)][DBLP]
    SIGSOFT FSE, 1998, pp:175-188 [Conf]
  102. Damon Mosk-Aoyama, Mihalis Yannakakis
    Testing hierarchical systems. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:1126-1135 [Conf]
  103. Santosh Vempala, Mihalis Yannakakis
    A Convex Relaxation for the Asymmetric TSP. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:975-976 [Conf]
  104. Mihalis Yannakakis
    On the Approximation of Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:1-9 [Conf]
  105. Jeffrey D. Ullman, Mihalis Yannakakis
    High-Probability Parallel Transitive Closure Algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:200-209 [Conf]
  106. Kousha Etessami, Mihalis Yannakakis
    Recursive Markov Chains, Stochastic Grammars, and Monotone Systems of Nonlinear Equations. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:340-352 [Conf]
  107. Kousha Etessami, Mihalis Yannakakis
    Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:634-645 [Conf]
  108. Mihalis Yannakakis
    The Analysis of Local Search Problems and Their Heuristics. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:298-311 [Conf]
  109. Rajeev Alur, Costas Courcoubetis, Mihalis Yannakakis
    Distinguishing tests for nondeterministic and probabilistic machines. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:363-372 [Conf]
  110. Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
    On Notions of Information Transfer in VLSI Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:133-139 [Conf]
  111. Avrim Blum, Tao Jiang, Ming Li, John Tromp, Mihalis Yannakakis
    Linear Approximation of Shortest Superstrings [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:328-336 [Conf]
  112. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Lyle A. McGeoch, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
    Fundamental Discrepancies between Average-Case Analyses under Discrete and Continuous Distributions: A Bin Packing Case Study [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:230-240 [Conf]
  113. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the Complexity of Protein Folding (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:597-603 [Conf]
  114. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Approximate max-flow min-(multi)cut theorems and their applications. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:698-707 [Conf]
  115. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
    Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:19-28 [Conf]
  116. David Lee, Mihalis Yannakakis
    Online Minimization of Transition Systems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:264-274 [Conf]
  117. Christos H. Papadimitriou, Mihalis Yannakakis
    Linear programming without the matrix. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:121-129 [Conf]
  118. Christos H. Papadimitriou, Alejandro A. Schäffer, Mihalis Yannakakis
    On the Complexity of Local Search (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:438-445 [Conf]
  119. Mihalis Yannakakis
    Four Pages are Necessary and Sufficient for Planar Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:104-108 [Conf]
  120. Mihalis Yannakakis
    Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:223-228 [Conf]
  121. Mihalis Yannakakis, David Lee
    Testing Finite State Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1991, pp:476-485 [Conf]
  122. Kousha Etessami, Mihalis Yannakakis
    Algorithmic Verification of Recursive Probabilistic State Machines. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:253-270 [Conf]
  123. Alex Groce, Doron Peled, Mihalis Yannakakis
    Adaptive Model Checking. [Citation Graph (0, 0)][DBLP]
    TACAS, 2002, pp:357-370 [Conf]
  124. Mihalis Yannakakis
    Approximation of Multiobjective Optimization Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:1- [Conf]
  125. Mihalis Yannakakis
    Succinct Approximation of Trade-Off Curves. [Citation Graph (0, 0)][DBLP]
    WINE, 2006, pp:149- [Conf]
  126. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:18, n:1, pp:3-20 [Journal]
  127. Jeffrey D. Ullman, Mihalis Yannakakis
    The Input/Output Complexity of Transitive Closure. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1991, v:3, n:2-4, pp:331-360 [Journal]
  128. Christos H. Papadimitriou, Mihalis Yannakakis
    On recognizing integer polyhedra. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:1, pp:107-109 [Journal]
  129. Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis
    Computing the Throughput of a Network with Dedicated Lines. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:271-278 [Journal]
  130. Costas Courcoubetis, Moshe Y. Vardi, Pierre Wolper, Mihalis Yannakakis
    Memory-Efficient Algorithms for the Verification of Temporal Properties. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1992, v:1, n:2/3, pp:275-288 [Journal]
  131. Costas Courcoubetis, Mihalis Yannakakis
    Minimum and Maximum Delay Problems in Real-Time Systems. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1992, v:1, n:4, pp:385-415 [Journal]
  132. Mihalis Yannakakis, David Lee
    An Efficient Algorithm for Minimizing Real-Time Transition Systems. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 1997, v:11, n:2, pp:113-136 [Journal]
  133. Rajeev Alur, Alon Itai, Robert P. Kurshan, Mihalis Yannakakis
    Timing Verification by Successive Approximation [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:118, n:1, pp:142-157 [Journal]
  134. Mihalis Yannakakis, Theodosios Pavlidis
    Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:42, n:1, pp:72-86 [Journal]
  135. Alex Groce, Doron Peled, Mihalis Yannakakis
    Adaptive Model Checking. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2006, v:14, n:5, pp:729-744 [Journal]
  136. Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Testing Whether a Graph is a Superconcentrator. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:164-167 [Journal]
  137. Christos H. Papadimitriou, Mihalis Yannakakis
    On Minimal Eulerian Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:12, n:4, pp:203-205 [Journal]
  138. Christos H. Papadimitriou, Mihalis Yannakakis
    The Clique Problem for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1981, v:13, n:4/5, pp:131-133 [Journal]
  139. Mihalis Yannakakis, Fanica Gavril
    The Maximum k-Colorable Subgraph Problem for Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:2, pp:133-137 [Journal]
  140. Avrim Blum, Ming Li, John Tromp, Mihalis Yannakakis
    Linear Approximation of Shortest Superstrings. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1994, v:41, n:4, pp:630-647 [Journal]
  141. Costas Courcoubetis, Mihalis Yannakakis
    The Complexity of Probabilistic Verification. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:4, pp:857-907 [Journal]
  142. Christos H. Papadimitriou, Mihalis Yannakakis
    The complexity of restricted spanning tree problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:285-309 [Journal]
  143. Mihalis Yannakakis
    The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1979, v:26, n:4, pp:618-630 [Journal]
  144. Mihalis Yannakakis
    A Polynomial Algorithm for the Min-Cut Linear Arrangement of Trees [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:950-988 [Journal]
  145. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Multiway cuts in node weighted graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2004, v:50, n:1, pp:49-61 [Journal]
  146. Mihalis Yannakakis
    On the Approximation of Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1994, v:17, n:3, pp:475-502 [Journal]
  147. Doron Peled, Moshe Y. Vardi, Mihalis Yannakakis
    Black Box Checking. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:2, pp:225-246 [Journal]
  148. Pierluigi Crescenzi, Deborah Goldman, Christos H. Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
    On the Complexity of Protein Folding. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1998, v:5, n:3, pp:423-466 [Journal]
  149. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
    Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal]
  150. Sampath Kannan, Mihalis Yannakakis
    Guest Editors' foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:237- [Journal]
  151. David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
    How Easy is Local Search? [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:37, n:1, pp:79-100 [Journal]
  152. John M. Lewis, Mihalis Yannakakis
    The Node-Deletion Problem for Hereditary Properties is NP-Complete. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:2, pp:219-230 [Journal]
  153. Christos H. Papadimitriou, Mihalis Yannakakis
    Optimization, Approximation, and Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:425-440 [Journal]
  154. Christos H. Papadimitriou, Mihalis Yannakakis
    Tie-Breaking Semantics and Structural Totality. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:1, pp:48-60 [Journal]
  155. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Complexity of Database Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:407-427 [Journal]
  156. Ouri Wolfson, Mihalis Yannakakis
    Deadlock-Freedom (and Safety) of Transactions in a Distributed Database. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:2, pp:161-178 [Journal]
  157. Mihalis Yannakakis
    Embedding Planar Graphs in Four Pages. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:36-67 [Journal]
  158. Mihalis Yannakakis
    Expressing Combinatorial Optimization Problems by Linear Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:441-466 [Journal]
  159. Mihalis Yannakakis, David Lee
    Testing Finite State Machines: Fault Detection. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:2, pp:209-227 [Journal]
  160. Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
    The Complexity of Multiterminal Cuts. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:864-894 [Journal]
  161. Naveen Garg, Vijay V. Vazirani, Mihalis Yannakakis
    Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:2, pp:235-251 [Journal]
  162. Christos H. Papadimitriou, Mihalis Yannakakis
    Scheduling Interval-Ordered Tasks. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:405-409 [Journal]
  163. Christos H. Papadimitriou, Mihalis Yannakakis
    The Complexity of Reliable Concurrency Control. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1987, v:16, n:3, pp:538-553 [Journal]
  164. Christos H. Papadimitriou, Mihalis Yannakakis
    Towards an Architecture-Independent Analysis of Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:2, pp:322-328 [Journal]
  165. Alejandro A. Schäffer, Mihalis Yannakakis
    Simple Local Search Problems That are Hard to Solve. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:1, pp:56-87 [Journal]
  166. Mihalis Yannakakis
    Edge-Deletion Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:297-309 [Journal]
  167. Edward G. Coffman Jr., Costas Courcoubetis, M. R. Garey, David S. Johnson, Peter W. Shor, Richard R. Weber, Mihalis Yannakakis
    Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:3, pp:384-402 [Journal]
  168. Kenneth A. Ross, Charu C. Aggarwal, Alfons Kemper, Sunita Sarawagi, S. Sudarshan, Mihalis Yannakakis
    Reminiscences on Influential Papers. [Citation Graph (0, 0)][DBLP]
    SIGMOD Record, 2000, v:29, n:3, pp:52-54 [Journal]
  169. David Lee, Mihalis Yannakakis
    Closed Partition Lattice and Machine Decomposition. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2002, v:51, n:2, pp:216-228 [Journal]
  170. David Lee, Mihalis Yannakakis
    Testing Finite-State Machines: State Identification and Verification. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:3, pp:306-320 [Journal]
  171. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Realizability and verification of MSC graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:331, n:1, pp:97-114 [Journal]
  172. Christos H. Papadimitriou, Mihalis Yannakakis
    Shortest Paths Without a Map. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:84, n:1, pp:127-150 [Journal]
  173. Sergei Vassilvitskii, Mihalis Yannakakis
    Efficiently computing succinct trade-off curves. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:334-356 [Journal]
  174. Rajeev Alur, Michael Benedikt, Kousha Etessami, Patrice Godefroid, Thomas W. Reps, Mihalis Yannakakis
    Analysis of recursive state machines. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2005, v:27, n:4, pp:786-818 [Journal]
  175. Rajeev Alur, Mihalis Yannakakis
    Model checking of hierarchical state machines. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2001, v:23, n:3, pp:273-303 [Journal]
  176. Rajeev Alur, Kousha Etessami, Mihalis Yannakakis
    Inference of Message Sequence Charts. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2003, v:29, n:7, pp:623-633 [Journal]
  177. Ilias Diakonikolas, Mihalis Yannakakis
    Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:74-88 [Conf]
  178. Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, Mihalis Yannakakis
    Multi-objective Model Checking of Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:50-65 [Conf]

  179. On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract). [Citation Graph (, )][DBLP]


  180. Recursive Stochastic Games with Positive Rewards. [Citation Graph (, )][DBLP]


  181. Recursion and Probability. [Citation Graph (, )][DBLP]


  182. Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems. [Citation Graph (, )][DBLP]


  183. Succinct approximate convex pareto curves. [Citation Graph (, )][DBLP]


  184. How Good is the Chord Algorithm?. [Citation Graph (, )][DBLP]


  185. Computation of Equilibria and Stable Solutions. [Citation Graph (, )][DBLP]


  186. Equilibria, Fixed Points, and Complexity Classes. [Citation Graph (, )][DBLP]


  187. Automata, Probability, and Recursion. [Citation Graph (, )][DBLP]


  188. Computational Aspects of Equilibria. [Citation Graph (, )][DBLP]


  189. Market Equilibrium under Separable, Piecewise-Linear, Concave Utilities. [Citation Graph (, )][DBLP]


  190. Equilibria, Fixed Points, and Complexity Classes [Citation Graph (, )][DBLP]


  191. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems [Citation Graph (, )][DBLP]


  192. Recursive Concurrent Stochastic Games [Citation Graph (, )][DBLP]


  193. Multi-Objective Model Checking of Markov Decision Processes [Citation Graph (, )][DBLP]


  194. Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs. [Citation Graph (, )][DBLP]


Search in 0.329secs, Finished in 0.340secs
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