Mihalis Yannakakis | Academic Influence

Mihalis Yannakakis's AcademicInfluence.com Rankings

Mihalis Yannakakis

Computer Science

#560

World Rank

#580

Historical Rank

Theoretical Computer Science

#20

World Rank

#20

Historical Rank

Database

#96

World Rank

#99

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Mihalis Yannakakis's Degrees

PhD Computer Science Princeton University
Masters Computer Science Princeton University

Similar Degrees You Can Earn

Why Is Mihalis Yannakakis Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Mihalis Yannakakis is professor of computer science at Columbia University. He is noted for his work in computational complexity, databases, and other related fields. He won the Donald E. Knuth Prize in 2005.

(See a Problem?)

Mihalis Yannakakis's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Optimization, approximation, and complexity classes (1991) (1895)
Principles and methods of testing finite state machines-a survey (1996) (1311)
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (1984) (1153)
On the hardness of approximating minimization problems (1994) (893)
On Generating All Maximal Independent Sets (1988) (833)
On the Desirability of Acyclic Database Schemes (1983) (810)
Computing the Minimum Fill-in is NP^Complete (1981) (764)
How easy is local search? (1985) (726)
The Complexity of Multiterminal Cuts (1994) (653)
The complexity of probabilistic verification (1995) (601)
Memory-efficient algorithms for the verification of temporal properties (1990) (601)
Expressing combinatorial optimization problems by linear programs (1991) (580)
Algorithms for Acyclic Database Schemes (1981) (567)
Shortest Paths Without a Map (1989) (555)
Towards an architecture-independent analysis of parallel algorithms (1990) (519)
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations (2005) (512)
On the approximability of trade-offs and optimal access of Web sources (2000) (496)
The Node-Deletion Problem for Hereditary Properties is NP-Complete (1980) (484)
Node-and edge-deletion NP-complete problems (1978) (483)
On the Complexity of Protein Folding (1998) (481)
Approximate max-flow min-(multi)cut theorems and their applications (1993) (428)
The Traveling Salesman Problem with Distances One and Two (1993) (423)
The Complexity of the Partial Order Dimension Problem (1982) (419)
The complexity of facets (and some facets of complexity) (1982) (389)
Edge Dominating Sets in Graphs (1980) (387)
Equivalences Among Relational Expressions with the Union and Difference Operators (1980) (375)
Primal-dual approximation algorithms for integral flow and multicut in trees (1997) (349)
Inference of message sequence charts (2000) (335)
Black Box Checking (1999) (321)
Testing Finite-State Machines: State Identification and Verification (1994) (314)
Model Checking of Message Sequence Charts (1999) (308)
Simple Local Search Problems That are Hard to Solve (1991) (296)
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract) (2007) (293)
On the hardness of approximating minimization problems (1993) (266)
Analysis of recursive state machines (2001) (265)
Node-Deletion Problems on Bipartite Graphs (1981) (259)
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (1999) (255)
On nested depth first search (1996) (235)
The complexity of multiway cuts (extended abstract) (1992) (233)
Scheduling Interval-Ordered Tasks (1979) (233)
On notions of information transfer in VLSI circuits (1983) (220)
On the approximation of maximum satisfiability (1992) (220)
On limited nondeterminism and the complexity of the V-C dimension (1993) (219)
On the Complexity of Database Queries (1999) (213)
Edge-Deletion Problems (1981) (204)
Graph-theoretic methods in database theory (1990) (198)
Multi-Objective Model Checking of Markov Decision Processes (2007) (194)
Adaptive Model Checking (2002) (193)
Minimum and maximum delay problems in real-time systems (1991) (193)
Model checking of hierarchical state machines (1998) (191)
The Approximation of Maximum Subgraph Problems (1993) (190)
Realizability and verification of MSC graphs (2005) (184)
A Note on Succinct Representations of Graphs (1986) (182)
The Maximum k-Colorable Subgraph Problem for Chordal Graphs (1987) (161)
The complexity of restricted spanning tree problems (1982) (160)
Batch sizing and job sequencing on a single machine (1991) (159)
Linear approximation of shortest superstrings (1991) (155)
Distinguishing tests for nondeterministic and probabilistic machines (1995) (150)
Online minimization of transition systems (extended abstract) (1992) (150)
Embedding Planar Graphs in Four Pages (1989) (148)
Verifying temporal properties of finite-state probabilistic programs (1988) (147)
A polynomial algorithm for the MIN CUT linear arrangement of trees (1983) (140)
Properties of acyclic database schemes (1981) (138)
Multiway Cuts in Directed and Node Weighted Graphs (1994) (134)
High-probability parallel transitive closure algorithms (1990) (129)
Recursive Markov Decision Processes and Recursive Stochastic Games (2005) (128)
Communicating Hierarchical State Machines (1999) (122)
Multiobjective query optimization (2001) (120)
Multiway cuts in node weighted graphs (2004) (119)
Linear programming without the matrix (1993) (113)
Market equilibrium under separable, piecewise-linear, concave utilities (2011) (112)
Timing Verification by Successive Approximation (1992) (110)
On complexity as bounded rationality (extended abstract) (1994) (105)
Searching a Fixed Graph (1996) (104)
An Efficient Algorithm for Minimizing Real-Time Transition Systems (1997) (104)
Four pages are necessary and sufficient for planar graphs (1986) (103)
High-Probability Parallel Transitive-Closure Algorithms (1991) (102)
On the complexity of local search (1990) (102)
The input/output complexity of transitive closure (1990) (98)
Markov Decision Processes and Regular Events (Extended Abstract) (1990) (98)
Markov decision processes and regular events (1998) (95)
Testing Finite State Machines: Fault Detection (1995) (93)
Equivalence among Relational Expressions with the Union and Difference Operation (1978) (91)
The Complexity of Testing Whether a Graph is a Superconcentrator (1981) (90)
Linear approximation of shortest superstrings (1994) (89)
Efficiently computing succinct trade-off curves (2005) (89)
Optimal Scheduling of Products with Two Subassemblies on a Single Machine (1989) (85)
Scheduling Opposing Forests (1983) (84)
Recursive Concurrent Stochastic Games (2006) (79)
Locking policies: Safety and freedom from deadlock (1979) (78)
On Datalog vs. Polynomial Time (1995) (77)
A Theory of Safe Locking Policies in Database Systems (1982) (77)
Pfaffian Orientations, 0/1 Permanents, and Even Cycles in Directed Graphs (1988) (76)
Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems (2007) (74)
Testing finite state machines (1991) (74)
The Analysis of Local Search Problems and Their Heuristics (1990) (73)
On the Complexity of Testing Implications of Functional and Join Dependencies (1981) (72)
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems (2009) (67)
Suboptimal Cuts: Their Enumeration, Weight and Number (Extended Abstract) (1992) (67)
Algorithmic Verification of Recursive Probabilistic State Machines (2005) (67)
Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees, with Applications to Matching and Set Cover (1993) (66)
The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (1979) (65)
Serializability by Locking (1984) (64)
The Clique Problem for Planar Graphs (1981) (64)
The complexity of non-monotone markets (2012) (64)
Testing the Universal Instance Assumption (1980) (62)
Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (1989) (61)
Algebraic Dependencies (Extended Abstract) (1980) (60)
Independent database schemas (1982) (60)
Algebraic dependencies (1980) (59)
On the complexity of database queries (extended abstract) (1997) (57)
Power Grid State Estimation Following a Joint Cyber and Physical Attack (2018) (55)
On a class of totally unimodular matrices (1980) (54)
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems (2008) (53)
On monotone formulae with restricted depth (1984) (52)
On the complexity of protein folding (extended abstract) (1998) (52)
On the value of information in distributed decision-making (extended abstract) (1991) (51)
The Complexity of Optimal Multidimensional Pricing (2013) (48)
Perspectives on database theory (1995) (48)
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (1985) (48)
Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings (2000) (47)
Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study (1991) (43)
Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games (2006) (43)
How good is the Chord algorithm? (2010) (42)
Model checking of hierarchical state machines (2001) (42)
Memory-Ecient Algorithms for the Verication of Temporal Properties (1992) (42)
On the Complexity of Optimal Lottery Pricing and Randomized Mechanisms (2015) (42)
Recursive Stochastic Games with Positive Rewards (2008) (38)
Approximate Max--ow Min-(multi)cut Theorems and Their Applications (1993) (38)
Hierarchical State Machines (2000) (36)
Joint Cyber and Physical Attacks on Power Grids: Graph Theoretical Approaches for Information Recovery (2015) (36)
Bounds on the size and transmission rate of communications protocols (1982) (34)
Succinct approximate convex pareto curves (2008) (34)
Cutting and Partitioning a Graph aifter a Fixed Pattern (Extended Abstract) (1983) (33)
Modularity of cycles and paths in graphs (1991) (33)
Testing, optimization, and games (2004) (32)
Checking LTL properties of recursive Markov chains (2005) (32)
Tie-breaking semantics and structural totality (1992) (31)
Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum (1984) (31)
REACT to Cyber Attacks on Power Grids (2017) (31)
On recognizing integer polyhedra (1990) (30)
Optimization, Approximation, and Complexity Classes (Extended Abstract) (1988) (30)
Equilibria, Fixed Points, and Complexity Classes (2008) (30)
Optimization problems from feature testing of communication protocols (1996) (29)
Approximation of Multiobjective Optimization Problems (2001) (29)
On the complexity of protein folding (abstract) (1998) (29)
Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing (2002) (28)
Expressing Combinatorial Optimization Problems by Linear Programs (Extended Abstract) (1988) (28)
Modeling communications protocols by automata (1979) (28)
Polynomial Time Algorithms for Multi-Type Branching Processes and Stochastic Context-Free Grammars (2012) (28)
Temporal Synthesis for Bounded Systems and Environments (2011) (27)
On Datalog vs. polynomial time (extended abstract) (1991) (26)
Freedom from Deadlock of Safe Locking Policies (1982) (24)
Testing, Optimizaton, and Games (2004) (24)
Model Checking of Recursive Probabilistic Systems (2012) (24)
Tools for Template Dependencies (1983) (24)
Planar Graphs that Need Four Pages (2020) (23)
Issues of correctness in database concurrency control by locking (1981) (22)
Alembic: Automated Model Inference for Stateful Network Functions (2019) (22)
Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (2012) (22)
Polynomial time algorithms for multi-type branching processesand stochastic context-free grammars (2012) (22)
Linear and Book Embeddings of Graphs (1986) (21)
AMC: An Adaptive Model Checker (2002) (19)
Some Open Problems in Approximation (1994) (18)
Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (2013) (18)
A convex relaxation for the asymmetric TSP (1999) (18)
Analysis of Boolean Programs (2013) (15)
On the Complexity of Simple and Optimal Deterministic Mechanisms for an Additive Buyer (2017) (14)
Deleting completed transactions (1985) (14)
Protocol Feature Interactions (1998) (14)
The Complexity of Non-Monotone Markets (2017) (14)
Computational Complexity of the Hylland-Zeckhauser Scheme for One-Sided Matching Markets (2020) (13)
An impossibility theorem for price-adjustment mechanisms (2010) (13)
Doubly Balanced Connected Graph Partitioning (2016) (13)
Testing for Finite State Systems (1998) (12)
Homa: An Efficient Topology and Route Management Approach in SD-WAN Overlays (2020) (12)
Greatest Fixed Points of Probabilistic Min/Max Polynomial Equations, and Reachability for Branching Markov Decision Processes (2015) (11)
Closed Partition Lattice and Machine Decomposition (2002) (11)
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria (2019) (11)
How Easy Is Local Search? (Extended Abstract) (1985) (10)
The complexity of optimal multidimensional pricing for a unit-demand buyer (2018) (10)
The Complexity of Restricted Minimum Spanning Tree Problems (Extended Abstract) (1979) (9)
Querying weak instances (1984) (9)
Smoothed complexity of local max-cut and binary max-CSP (2019) (9)
Compression of Partially Ordered Strings (2003) (9)
Worst-case ration for planar graphs and the method of induction on faces (1981) (9)
On Monotone Formulae with Restricted Depth (Preliminary Version) (1984) (8)
ON THE COMPLEXITY OF LOCAL SEARCH (Extended Abstract) (1990) (8)
Deadlock-freedom (and saftey) of transactions in a distributed database (1985) (7)
Computational Hardness of the Hylland-Zeckhauser Scheme (2021) (7)
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (2013) (6)
The complexity of reliable concurrency control (1985) (6)
ON-LINE MINIMIZATION OF TRANSITION SYSTEMS ( Extended Abstract ) (2003) (6)
On Complexity as Bounded Rationality1 (2016) (6)
2. Computational complexity (2003) (6)
Computing the Throughput of a Network with Dedicated Lines (1993) (6)
Stochastic Context-Free Grammars, Regular Languages, and Newton's Method (2013) (5)
Deadlock-Freedom (and Safety) of Transactions in a Distributed Database (1986) (5)
A note on broadcast encryption key management with applications to large scale emergency alert systems (2006) (5)
Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis (2018) (4)
From Rule-based to Automata-based Testing (2000) (4)
A Polynomial Time Algorithm for Computing Extinction Probabilities of Multitype Branching Processes (2017) (4)
Worst-Case Ratios for Planar Graphs and the Method of Induction on Faces (Extended Abstract) (1981) (4)
Testing hierarchical systems (2005) (4)
On Minimal Eulerian Graphs (1981) (3)
REACT to Cyber-Physical Attacks on Power grids (Extended Abstract) (2019) (3)
Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (2018) (3)
On the Complexity of Bundle-Pricing and Simple Mechanisms (2017) (3)
Proceedings of the nineteenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA '08) (2008) (3)
Recent Developments on the Approximability of Combinatorial Problems (1993) (3)
Computational Aspects of Equilibria (2009) (3)
Existence of Reduction Hierarchies (1997) (3)
Finite S (2009) (2)
Reachability for Branching Concurrent Stochastic Games (2018) (2)
Realizability and Veriication of Msc Graphs (2001) (2)
Epinoia: Intent Checker for Stateful Networks (2021) (2)
Joint Cyber and Physical Attacks on Power Grids (2015) (2)
Topological Characterization of Families of Graphs Generated by Certain Types of Graph Grammars (1979) (2)
Testing Finite State Machines (Extended Abstract) (1991) (2)
The Platform Design Problem (2020) (1)
Principl Finite S (1996) (1)
Protocol System Integration, Interface and Interoperability (2004) (1)
The Complexity of Finding S-factors in Regular Graphs (2019) (1)
Testing and Checking of Finite State Systems (2002) (1)
Technical Perspective: Structure and Complexity of Bag Consistency (2022) (1)
Computing with Continuous-Time Liapunov Systems (2007) (0)
Explorer Checking LTL Properties of Recursive Markov Chains (2016) (0)
Analysis of Recursive Probabilistic Models (2006) (0)
An Analyzer for Message Sequence Charts 15 Acknowledgements: We Thank 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (1996) (0)
Technical Perspective (2022) (0)
Explorer Stochastic Context-Free Grammars , Regular Languages , and Newton ' s Method (2013) (0)
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 21-23, 1988, Austin, Texas, USA (1988) (0)
Succinct Approximation of Trade-Off Curves (2006) (0)
Appendix to : Model Checking of Recursive Probabilistic Systems (2012) (0)
Explorer Recursive Concurrent Stochastic Games (2006) (0)
The Proof That N (1992) (0)
Computation of Least Fixed Points (2012) (0)
Buy-at-bulk-related problems in network design (2009) (0)
Recursion and Probability (2006) (0)
Probability and Recursion (2005) (0)
Survey Equilibria , fixed points , and complexity classes (2009) (0)
Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP (2022) (0)
Fixed Point Computation Problems and Facets of Complexity (Invited Talk) (2019) (0)
Computation of Equilibria and Stable Solutions (2010) (0)
l\tlodeling COlnlnunications Protocols by Autolnata (1979) (0)
Explorer Multi-Objective Model Checking of Markov Decision Processes (2007) (0)
Reminiscences on Influential Papers (2001) (0)
Guest Editors' foreword (2004) (0)
An Analyzer for Message Sequence Charts 15 Lemma 4.1 the Timed M S C M Is Timing Inconsistent I the Graph G M 5 an Msc Analysis Tool 4 Mscs with Timing Constraints (0)
Automata, Probability, and Recursion (2008) (0)
Succinct Approximate Convex Pareto Curves ( Extended Abstract ) (0)
Testing and Checking of Finite State Systems Invited Talk (2002) (0)
The Smoothed Complexity of Policy Iteration for Markov Decision Processes (2022) (0)
Center-Embedding and Constituency in the Brain and a New Characterization of Context-Free Languages (2022) (0)
Explorer Greatest Fixed Points of Probabilistic Min / Max Polynomial Equations , and Reachability for Branching Markov Decision Processes ? (2016) (0)
Invaluable Feedback from a Superb Team of Requirements Engineers (1996) (0)
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 22-25, 1995, San Jose, California, USA (1995) (0)

This paper list is powered by the following services:

Other Resources About Mihalis Yannakakis

en.wikipedia.org

What Schools Are Affiliated With Mihalis Yannakakis?

Mihalis Yannakakis is affiliated with the following schools:

Image Attributions

Image Source for Mihalis Yannakakis