A Discrete Subexponential Algorithm for Parity Games
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Memoryless determinacy of parity and mean payoff games: a simple proof
Theoretical Computer Science
Combinatorial structure and randomized subexponential algorithms for infinite games
Theoretical Computer Science
How to solve large scale deterministic games with mean payoff by policy iteration
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
Discrete Applied Mathematics
The NP-completeness column: Finding needles in haystacks
ACM Transactions on Algorithms (TALG)
Cyclic games and linear programming
Discrete Applied Mathematics
Scientific contributions of Leo Khachiyan (a short overview)
Discrete Applied Mathematics
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Games through Nested Fixpoints
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
The Complexity of Solving Stochastic Games on Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Discounted deterministic Markov decision processes and discounted all-pairs shortest paths
ACM Transactions on Algorithms (TALG)
Linear complementarity and p-matrices for stochastic games
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
On the equilibria of alternating move games
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Faster algorithms for mean-payoff games
Formal Methods in System Design
Nash-solvable two-person symmetric cycle game forms
Discrete Applied Mathematics
Stochastic mean payoff games: smoothed analysis and approximation schemes
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On memoryless quantitative objectives
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Extending Dijkstra's algorithm to maximize the shortest path by node-wise limited arc interdiction
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Linear programming polytope and algorithm for mean payoff games
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
A subexponential lower bound for the random facet algorithm for parity games
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Tropical linear-fractional programming and parametric mean payoff games
Journal of Symbolic Computation
Polynomial-Time algorithms for energy games with special weight structures
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of infinitely repeated alternating move games
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Hyperplane separation technique for multidimensional mean-payoff games
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
A note on the approximation of mean-payoff games
Information Processing Letters
| Hi-index | 0.00 |