The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Marcin Jurdzinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Arindam Chakrabarti, Luca de Alfaro, Thomas A. Henzinger, Marcin Jurdzinski, Freddy Y. C. Mang
    Interface Compatibility Checking for Software Modules. [Citation Graph (0, 0)][DBLP]
    CAV, 2002, pp:428-441 [Conf]
  2. Jens Vöge, Marcin Jurdzinski
    A Discrete Strategy Improvement Algorithm for Solving Parity Games. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:202-215 [Conf]
  3. Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
    Simple Stochastic Parity Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:100-113 [Conf]
  4. Krishnendu Chatterjee, Rupak Majumdar, Marcin Jurdzinski
    On Nash Equilibria in Stochastic Games. [Citation Graph (0, 0)][DBLP]
    CSL, 2004, pp:26-40 [Conf]
  5. Marcin Jurdzinski, Orna Kupferman, Thomas A. Henzinger
    Trading Probability for Fairness. [Citation Graph (0, 0)][DBLP]
    CSL, 2002, pp:292-305 [Conf]
  6. Marcin Jurdzinski, Doron Peled, Hongyang Qu
    Calculating Probabilities of Real-Time Test Cases. [Citation Graph (0, 0)][DBLP]
    FATES, 2005, pp:134-151 [Conf]
  7. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with Secure Equilibria. [Citation Graph (0, 0)][DBLP]
    FMCO, 2004, pp:141-161 [Conf]
  8. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with Secure Equilibria. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:160-169 [Conf]
  9. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Mean-Payoff Parity Games. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:178-187 [Conf]
  10. Stefan Dziembowski, Marcin Jurdzinski, Igor Walukiewicz
    How Much Memory is Needed to Win Infinite Games? [Citation Graph (0, 0)][DBLP]
    LICS, 1997, pp:99-110 [Conf]
  11. Krishnendu Chatterjee, Marcin Jurdzinski, Thomas A. Henzinger
    Quantitative stochastic parity games. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:121-130 [Conf]
  12. Marcin Jurdzinski, Mike Paterson, Uri Zwick
    A deterministic subexponential algorithm for solving parity games. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:117-123 [Conf]
  13. Marcin Jurdzinski
    Small Progress Measures for Solving Parity Games. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:290-301 [Conf]
  14. Marcin Jurdzinski, Mogens Nielsen
    Hereditary History Preserving Bisimilarity Is Undecidable. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:358-369 [Conf]
  15. Marcin Jurdzinski, Mogens Nielsen, Jirí Srba
    Undecidability of domino games and hhp-bisimilarity. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:184, n:2, pp:343-368 [Journal]
  16. Marcin Jurdzinski
    Deciding the Winner in Parity Games is in UP \cap co-Up. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:3, pp:119-124 [Journal]
  17. Krishnendu Chatterjee, Thomas A. Henzinger, Marcin Jurdzinski
    Games with secure equilibria. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:365, n:1-2, pp:67-82 [Journal]
  18. Marcin Jurdzinski, Ashutosh Trivedi
    Reachability-Time Games on Timed Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:838-849 [Conf]
  19. Marcin Jurdzinski, Ranko Lazic
    Alternation-free modal mu-calculus for data trees. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:131-140 [Conf]
  20. Marcin Jurdzinski, François Laroussinie, Jeremy Sproston
    Model Checking Probabilistic Timed Automata with One or Two Clocks. [Citation Graph (0, 0)][DBLP]
    TACAS, 2007, pp:170-184 [Conf]

  21. A Simple P-Matrix Linear Complementarity Problem for Discounted Games. [Citation Graph (, )][DBLP]


  22. Concavely-Priced Probabilistic Timed Automata. [Citation Graph (, )][DBLP]


  23. 07471 Abstracts Collection - Equilibrium Computation. [Citation Graph (, )][DBLP]


  24. Concavely-Priced Timed Automata. [Citation Graph (, )][DBLP]


  25. Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. [Citation Graph (, )][DBLP]


  26. The Covering and Boundedness Problems for Branching Vector Addition Systems. [Citation Graph (, )][DBLP]


  27. Average-Time Games. [Citation Graph (, )][DBLP]


  28. Algorithms for Solving Infinite Games. [Citation Graph (, )][DBLP]


  29. Linear Complementarity Algorithms for Infinite Games. [Citation Graph (, )][DBLP]


  30. Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. [Citation Graph (, )][DBLP]


  31. Alternating Automata on Data Trees and XPath Satisfiability [Citation Graph (, )][DBLP]


  32. Model Checking Probabilistic Timed Automata with One or Two Clocks [Citation Graph (, )][DBLP]


  33. Reachability-time games on timed automata [Citation Graph (, )][DBLP]


  34. Linear Complementarity Algorithms for Infinite Games [Citation Graph (, )][DBLP]


  35. Average-Time Games on Timed Automata [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002