Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Jurdziński, Marcin - Department of Computer Science, University of Warwick
Improvement Basic Research in Computer Science
This is a slightly revised version (July 2000) of the following article: # 2000 SpringerVerlag. Marcin Jurdzinski, Small Progress Measures for Solving Parity Games. In Horst Reichel
A DETERMINISTIC SUBEXPONENTIAL ALGORITHM FOR SOLVING PARITY GAMES
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
Simple Stochastic Parity Games ? Krishnendu Chatterjee, Marcin Jurdzi nski, and Thomas A. Henzinger
Alternation-free modal mu-calculus for data trees (Extended abstract)
Undecidability of Domino Games and Hhp-Bisimilarity 1
A Discrete Strategy Improvement Algorithm for Solving Parity Games
Quantitative Stochastic Parity Games Krishnendu Chatterjee
Reachability-Time Games on Timed Automata (Extended Abstract)
# 2000 SpringerVerlag. Marcin Jurdzinski and Mogens Nielsen, Hereditary History Preserving Bisimilarity Is Undecidable. In Horst Reichel and Sophie Tison, editors, STACS 2000, 17th Annual Symposium on Theoretical Aspects of
Games for Verification: Algorithmic Issues Marcin Jurdzi
# 1998 Elsevier Science B.V. Marcin Jurdzinski, Deciding the Winner in Parity Games Is in UP # coUP. Information Processing Letters 68(3): 119--124, November 1998.
Trading Probability for Fairness # (Extended Abstract)
How Much Memory Is Needed to Win In nite Games? 1
