dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Marcin Jurdzinski (Selection)

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Jurdzinski, Ranko Lazic: Alternating automata on data trees and XPath satisfiability. ACM Trans. Comput. Log. 12(3): 19 (2011)
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichal Rutkowski, Ranko Lazic, Marcin Jurdzinski: Average-price-per-reward games on hybrid automata with strong resets. STTT 13(6): 553-569 (2011)
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLStéphane Demri, Marcin Jurdzinski, Oded Lachish, Ranko Lazic: The Covering and Boundedness Problems for Branching Vector Addition Systems. FSTTCS 2009: 181-192
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Jurdzinski, Ranko Lazic, Michal Rutkowski: Average-Price-per-Reward Games on Hybrid Automata with Strong Resets. VMCAI 2009: 167-181
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPatricia 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin Jurdzinski, Ranko Lazic: Alternating Automata on Data Trees and XPath Satisfiability CoRR abs/0805.0330: (2008)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarcin 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 TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page