| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 40 |       | Marcin Jurdzinski, Ranko Lazic: Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12(3): 19 (2011) |
| 39 | | Michal Rutkowski, Ranko Lazic, Marcin Jurdzinski: Average-price-per-reward games on hybrid automata with strong resets. STTT 13(6): 553-569 (2011) |
| 36 | | Stéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192 |
| 34 | | Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI 2009: 167-181 |
| 27 | | Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets. FORMATS 2008: 63-77 |
| 25 | | Marcin Jurdzinski, Ranko Lazic: Alternating Automata on Data Trees and XPath Satisfiability CoRR abs/0805.0330: (2008) |
| 19 | | Marcin Jurdzinski, Ranko Lazic: Alternation-free modal mu-calculus for data trees. LICS 2007: 131-140 |
Selection of 7 from 41 records - Marcin Jurdzinski has 34 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page