The following pages link to Mihalis Yannakakis (Q458479):
Displaying 50 items.
- Equilibria, fixed points, and complexity classes (Q458480) (← links)
- Deadlock-freedom (and safety) of transactions in a distributed database (Q579973) (← links)
- Tie-breaking semantics and structural totality (Q676419) (← links)
- Primal-dual approximation algorithms for integral flow and multicut in trees (Q679443) (← links)
- Minimum and maximum delay problems in real-time systems (Q685111) (← links)
- (Q749436) (redirect page) (← links)
- Batch sizing and job sequencing on a single machine (Q749439) (← links)
- Shortest paths without a map (Q809612) (← links)
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs (Q911300) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- Independent database schemas (Q1082831) (← links)
- The maximum k-colorable subgraph problem for chordal graphs (Q1108038) (← links)
- On generating all maximal independent sets (Q1108809) (← links)
- How easy is local search? (Q1109573) (← links)
- Embedding planar graphs in four pages (Q1120582) (← links)
- Deleting completed transactions (Q1123021) (← links)
- Testing the universal instance assumption (Q1133903) (← links)
- The node-deletion problem for hereditary properties is NP-complete (Q1140988) (← links)
- On minimal Eulerian graphs (Q1162523) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Bounds on the size and transmission rate of communications protocols (Q1163522) (← links)
- Algebraic dependencies (Q1168760) (← links)
- Optimization, approximation, and complexity classes (Q1186548) (← links)
- Expressing combinatorial optimization problems by linear programs (Q1186549) (← links)
- On the complexity of database queries (Q1307689) (← links)
- The input/output complexity of transitive closure (Q1360681) (← links)
- Greatest fixed points of probabilistic min/max polynomial equations, and reachability for branching Markov decision processes (Q1641009) (← links)
- The complexity of optimal multidimensional pricing for a unit-demand buyer (Q1651230) (← links)
- Realizability and verification of MSC graphs (Q1770427) (← links)
- Computing the throughput of a network with dedicated lines (Q1803679) (← links)
- On limited nondeterminism and the complexity of the V-C dimension (Q1816725) (← links)
- Timing verification by successive approximation (Q1891141) (← links)
- On datalog vs polynomial time (Q1900923) (← links)
- The platform design problem (Q2152125) (← links)
- Planar graphs that need four pages (Q2200923) (← links)
- Recursive stochastic games with positive rewards (Q2422034) (← links)
- Efficiently computing succinct trade-off curves (Q2581275) (← links)
- On recognizing integer polyhedra (Q2639642) (← links)
- Recursive Markov Decision Processes and Recursive Stochastic Games (Q2796398) (← links)
- How Good is the Chord Algorithm? (Q2816293) (← links)
- On complexity as bounded rationality (extended abstract) (Q2817667) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q2843258) (← links)
- (Q2921785) (← links)
- A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
- Model Checking of Recursive Probabilistic Systems (Q2946660) (← links)
- Market equilibrium under separable, piecewise-linear, concave utilities (Q3016257) (← links)
- On the Desirability of Acyclic Database Schemes (Q3026382) (← links)
- Towards an Architecture-Independent Analysis of Parallel Algorithms (Q3034819) (← links)
- (Q3044311) (← links)
- On the Complexity of Nash Equilibria and Other Fixed Points (Q3068643) (← links)
