Mihalis Yannakakis
Mihalis Yannakakis
Percy K. and Vida L. W. Hudson Professor of Computer Science, Columbia University
Verified email at cs.columbia.edu
Title
Cited by
Cited by
Year
Optimization, approximation, and complexity classes
CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 43 (3), 425-440, 1991
21621991
Principles and methods of testing finite state machines-a survey
D Lee, M Yannakakis
Proceedings of the IEEE 84 (8), 1090-1123, 1996
15351996
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
RE Tarjan, M Yannakakis
SIAM Journal on computing 13 (3), 566-579, 1984
13041984
On the hardness of approximating minimization problems
C Lund, M Yannakakis
Journal of the ACM (JACM) 41 (5), 960-981, 1994
12841994
Computing the minimum fill-in is NP-complete
M Yannakakis
SIAM Journal on Algebraic Discrete Methods 2 (1), 77-79, 1981
10451981
On generating all maximal independent sets
DS Johnson, M Yannakakis, CH Papadimitriou
Information Processing Letters 27 (3), 119-123, 1988
9281988
On the desirability of acyclic database schemes
C Beeri, R Fagin, D Maier, M Yannakakis
Journal of the ACM (JACM) 30 (3), 479-513, 1983
9241983
How easy is local search?
DS Johnson, CH Papadimitriou, M Yannakakis
Journal of computer and system sciences 37 (1), 79-100, 1988
8421988
Memory-efficient algorithms for the verification of temporal properties
C Courcoubetis, M Vardi, P Wolper, M Yannakakis
Formal methods in system design 1 (2-3), 275-288, 1992
8101992
The complexity of multiterminal cuts
E Dahlhaus, DS Johnson, CH Papadimitriou, PD Seymour, M Yannakakis
SIAM Journal on Computing 23 (4), 864-894, 1994
7671994
The complexity of probabilistic verification
C Courcoubetis, M Yannakakis
Journal of the ACM (JACM) 42 (4), 857-907, 1995
6531995
Towards an architecture-independent analysis of parallel algorithms
CH Papadimitriou, M Yannakakis
SIAM journal on computing 19 (2), 322-328, 1990
6311990
Shortest paths without a map
CH Papadimitriou, M Yannakakis
Theoretical Computer Science 84 (1), 127-150, 1991
6101991
Expressing combinatorial optimization problems by linear programs
M Yannakakis
Journal of Computer and System Sciences 43 (3), 441-466, 1991
5721991
Node-and edge-deletion NP-complete problems
M Yannakakis
Proceedings of the tenth annual ACM symposium on Theory of computing, 253-264, 1978
5611978
Algorithms for acyclic database schemes
M Yannakakis
VLDB 81, 82-94, 1981
5571981
On the approximability of trade-offs and optimal access of web sources
CH Papadimitriou, M Yannakakis
Proceedings 41st Annual Symposium on Foundations of Computer Science, 86-92, 2000
5422000
On the complexity of protein folding
P Crescenzi, D Goldman, C Papadimitriou, A Piccolboni, M Yannakakis
Journal of computational biology 5 (3), 423-465, 1998
5331998
The traveling salesman problem with distances one and two
CH Papadimitriou, M Yannakakis
Mathematics of Operations Research 18 (1), 1-11, 1993
5041993
Equivalences among relational expressions with the union and difference operators
Y Sagiv, M Yannakakis
Journal of the ACM (JACM) 27 (4), 633-655, 1980
4671980
The system can't perform the operation now. Try again later.
Articles 1–20