The following pages link to Mihalis Yannakakis (Q458479):
Displaying 18 items.
- Automata, Languages and Programming (Q5466506) (← links)
- Automata, Languages and Programming (Q5466550) (← links)
- The complexity of non-monotone markets (Q5495788) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703763) (← links)
- STACS 2005 (Q5710687) (← links)
- Automata, Languages and Programming (Q5716837) (← links)
- Multi-objective Model Checking of Markov Decision Processes (Q5758101) (← links)
- (Q5875655) (← links)
- (Q5875712) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5890864) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900557) (← links)
- Recursive Concurrent Stochastic Games (Q5901225) (← links)
- Recursive Concurrent Stochastic Games (Q5901535) (← links)
- Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems (Q5917535) (← links)
- Computational hardness of the Hylland-Zeckhauser scheme (Q6575164) (← links)
- Extremal combinatorics, iterated pigeonhole arguments and generalizations of PPP (Q6610361) (← links)
- Reducing Tarski to unique Tarski (In the Black-Box model) (Q6640358) (← links)
- Smoothed complexity of SWAP in local graph partitioning (Q6645554) (← links)