U. Zwick and M.S. Paterson. The complexity of mean payo games on graphs. Theoretical Computer Science, 158:343-359, 1996. 21  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On Nash Equilibria in Stochastic Games - Chatterjee, Jurdzinski, Majumdar (2003) (Correct)
No context found.
U. Zwick and M.S. Paterson. The complexity of mean payo games on graphs. Theoretical Computer Science, 158:343-359, 1996. 21
Quantitative Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2003) (Correct)
No context found.
U. Zwick and M. Paterson. The complexity of mean payo games on graphs. Theoretical Computer Science, 158:343-359, 1996. 20
Two-player Nonzero-sum ω-regular Games - Chatterjee (2004) (Correct)
No context found.
U. Zwick and M.S. Paterson. The complexity of mean payo games on graphs. Theoretical Computer Science, 158:343-359, 1996. 48
Stochastic Limit-Average Games are in EXPTIME - Chatterjee, Majumdar, Henzinger (2005) (Correct)
No context found.
U. Zwick and M.S. Paterson. The complexity of mean payo games on graphs. Theoretical Computer Science, 158:343-359, 1996. 11
Model Checking Discounted Temporal Properties - de Alfaro, Faella, Henzinger, .. (2003) (2 citations) (Correct)
No context found.
U. Zwick and M.S. Paterson. The complexity of mean-payo games on graphs. Theoretical Computer Science, 158:343-359, 1996.
Staying Alive As Cheaply As Possible - Bouyer, Brinksma, Larsen (2004) (Correct)
No context found.
Uri Zwick and Mike Paterson. The complexity of mean payo# games on graphs. Theoretical Computer Science (TCS), 158(1--2):343--359, 1996.
Simple Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2003) (Correct)
No context found.
U. Zwick and M. Paterson. The complexity of mean-payo# games on graphs. Theoretical Computer Science, 158:343--359, 1996.
Model Checking Discounted Temporal Properties - de Alfaro, Faella, Henzinger, .. (2003) (2 citations) (Correct)
No context found.
U. Zwick and M.S. Paterson. The complexity of mean-payo games on graphs. Theoretical Computer Science, 158:343-359, 1996.
Simple Stochastic Parity Games - Chatterjee, Jurdzinski, Henzinger (2003) (Correct)
No context found.
U. Zwick and M. Paterson. The complexity of mean payo games on graphs. Theoretical Computer Science, 158:343-359, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC