The following pages link to Mihalis Yannakakis (Q458479):
Displaying 50 items.
- An impossibility theorem for price-adjustment mechanisms (Q3073963) (← links)
- Temporal synthesis for bounded systems and environments (Q3113724) (← links)
- Upper Bounds for Newton’s Method on Monotone Polynomial Systems, and P-Time Model Checking of Probabilistic One-Counter Automata (Q3177734) (← links)
- High-Probability Parallel Transitive-Closure Algorithms (Q3204039) (← links)
- Simple Local Search Problems that are Hard to Solve (Q3204045) (← links)
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3335007) (← links)
- (Q3341921) (← links)
- Permuting Elements Within Columns of a Matrix in Order to Minimize Maximum Row Sum (Q3343749) (← links)
- Adaptive Model Checking (Q3424119) (← links)
- Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations (Q3452195) (← links)
- Recursive Stochastic Games with Positive Rewards (Q3521960) (← links)
- Analysis of Recursive Probabilistic Models (Q3522888) (← links)
- (Q3579439) (← links)
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems (Q3586183) (← links)
- Automata, Probability, and Recursion (Q3602797) (← links)
- Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems (Q3603457) (← links)
- Multi-Objective Model Checking of Markov Decision Processes (Q3623004) (← links)
- Computational Aspects of Equilibria (Q3648838) (← links)
- The Complexity of the Partial Order Dimension Problem (Q3663349) (← links)
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs (Q3675541) (← links)
- On a Class of Totally Unimodular Matrices (Q3680604) (← links)
- (Q3745305) (← links)
- Serializability by Locking (Q3768431) (← links)
- A polynomial algorithm for the min-cut linear arrangement of trees (Q3771641) (← links)
- (Q3793731) (← links)
- The Complexity of Reliable Concurrency Control (Q3801060) (← links)
- Optimal Scheduling of Products with Two Subassemblies on a Single Machine (Q3826355) (← links)
- Scheduling Interval-Ordered Tasks (Q3854618) (← links)
- The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems (Q3854626) (← links)
- Topological characterization of families of graphs generated by certain types of graph grammars (Q3865516) (← links)
- Edge Dominating Sets in Graphs (Q3903038) (← links)
- Equivalences Among Relational Expressions with the Union and Difference Operators (Q3906490) (← links)
- Edge-Deletion Problems (Q3921260) (← links)
- Node-Deletion Problems on Bipartite Graphs (Q3921261) (← links)
- The complexity of restricted spanning tree problems (Q3936213) (← links)
- Freedom from Deadlock of Safe Locking Policies (Q3936234) (← links)
- On the Complexity of Testing Implications of Functional and Join Dependencies (Q3939277) (← links)
- A Theory of Safe Locking Policies in Database Systems (Q3950003) (← links)
- Computing the Minimum Fill-In is NP-Complete (Q3960122) (← links)
- The analysis of local search problems and their heuristics (Q3975934) (← links)
- (Q4037099) (← links)
- (Q4037388) (← links)
- (Q4038703) (← links)
- (Q4190141) (← links)
- (Q4218940) (← links)
- (Q4234083) (← links)
- (Q4252438) (← links)
- (Q4277623) (← links)
- (Q4302455) (← links)
- Modularity of cycles and paths in graphs (Q4302836) (← links)
