Sasha Rubin

Chatterjee Group

6 Publications

Mark all

[6]
2014 | Published | Conference Paper | IST-REx-ID: 10884 | OA
Parameterized model checking of token-passing systems
B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2014 | Published | Conference Paper | IST-REx-ID: 475 | OA
First cycle games
B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2014 | Published | Journal Article | IST-REx-ID: 2246 | OA
Alternating traps in Muller and parity games
A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[3]
2013 | Published | Conference Paper | IST-REx-ID: 10902
How to travel between languages
Chatterjee, Krishnendu, How to travel between languages. 7th International Conference on Language and Automata Theory and Applications 7810. 2013
View | DOI
 
[2]
2012 | Published | Conference Paper | IST-REx-ID: 495 | OA
A Myhill Nerode theorem for automata with advice
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
[Published Version] View | Files available | DOI
 
[1]
2012 | Published | Conference Paper | IST-REx-ID: 496 | OA
Interpretations in trees with countably many branches
Rabinovich, Alexander, Interpretations in trees with countably many branches. 2012
[Preprint] View | DOI | Download Preprint (ext.)
 
Marked Publication(s)

Search

Filter Publications

  • 5 OA Fulltext(s)

Display / Sort

Export / Embed

Grants


6 Publications

Mark all

[6]
2014 | Published | Conference Paper | IST-REx-ID: 10884 | OA
Parameterized model checking of token-passing systems
B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[5]
2014 | Published | Conference Paper | IST-REx-ID: 475 | OA
First cycle games
B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
[Published Version] View | Files available | DOI | arXiv
 
[4]
2014 | Published | Journal Article | IST-REx-ID: 2246 | OA
Alternating traps in Muller and parity games
A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer Science 521 (2014) 73–91.
[Submitted Version] View | DOI | Download Submitted Version (ext.) | arXiv
 
[3]
2013 | Published | Conference Paper | IST-REx-ID: 10902
How to travel between languages
Chatterjee, Krishnendu, How to travel between languages. 7th International Conference on Language and Automata Theory and Applications 7810. 2013
View | DOI
 
[2]
2012 | Published | Conference Paper | IST-REx-ID: 495 | OA
A Myhill Nerode theorem for automata with advice
A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012, Open Publishing Association, 2012, pp. 238–246.
[Published Version] View | Files available | DOI
 
[1]
2012 | Published | Conference Paper | IST-REx-ID: 496 | OA
Interpretations in trees with countably many branches
Rabinovich, Alexander, Interpretations in trees with countably many branches. 2012
[Preprint] View | DOI | Download Preprint (ext.)
 
Marked Publication(s)

Search

Filter Publications

  • 5 OA Fulltext(s)

Display / Sort

Export / Embed