2008 |
16 | EE | Tobias Ganzow,
Sasha Rubin:
Order-Invariant MSO is Stronger than Counting MSO in the Finite.
STACS 2008: 313-324 |
15 | EE | Lukasz Kaiser,
Sasha Rubin,
Vince Bárány:
Cardinality and counting quantifiers on omega-automatic structures.
STACS 2008: 385-396 |
14 | EE | Lukasz Kaiser,
Sasha Rubin,
Vince Bárány:
Cardinality and counting quantifiers on omega-automatic structures
CoRR abs/0802.2866: (2008) |
2007 |
13 | EE | Tobias Ganzow,
Sasha Rubin:
Order-Invariant MSO is Stronger than Counting MSO in the Finite
CoRR abs/0706.3723: (2007) |
12 | EE | Bakhadyr Khoussainov,
André Nies,
Sasha Rubin,
Frank Stephan:
Automatic Structures: Richness and Limitations
CoRR abs/cs/0703064: (2007) |
11 | EE | Bakhadyr Khoussainov,
André Nies,
Sasha Rubin,
Frank Stephan:
Automatic Structures: Richness and Limitations.
Logical Methods in Computer Science 3(2): (2007) |
2005 |
10 | EE | Bakhadyr Khoussainov,
Sasha Rubin:
Decidability of Term Algebras Extending Partial Algebras.
CSL 2005: 292-308 |
9 | EE | Bakhadyr Khoussainov,
Sasha Rubin,
Frank Stephan:
Automatic linear orders and trees.
ACM Trans. Comput. Log. 6(4): 675-700 (2005) |
2004 |
8 | EE | Doron Bustan,
Sasha Rubin,
Moshe Y. Vardi:
Verifying omega-Regular Properties of Markov Chains.
CAV 2004: 189-201 |
7 | EE | Bakhadyr Khoussainov,
André Nies,
Sasha Rubin,
Frank Stephan:
Automatic Structures: Richness and Limitations.
LICS 2004: 44-53 |
6 | EE | Bakhadyr Khoussainov,
Sasha Rubin,
Frank Stephan:
Definability and Regularity in Automatic Structures.
STACS 2004: 440-451 |
2003 |
5 | EE | Bakhadyr Khoussainov,
Sasha Rubin,
Frank Stephan:
On Automatic Partial Orders.
LICS 2003: 168-177 |
4 | | Bakhadyr Khoussainov,
Sasha Rubin:
Automatic Structures: Overview and Future Directions.
Journal of Automata, Languages and Combinatorics 8(2): 287-301 (2003) |
2002 |
3 | EE | Hajime Ishihara,
Bakhadyr Khoussainov,
Sasha Rubin:
Some Results on Automatic Structures.
LICS 2002: 235- |
2001 |
2 | | Bakhadyr Khoussainov,
Sasha Rubin:
Graphs with Automatic Presentations over a Unary Alphabet.
Journal of Automata, Languages and Combinatorics 6(4): 467-480 (2001) |
1999 |
1 | | Sasha Rubin:
Finite Automata and Well Ordered Sets.
New Zealand Computer Science Research Students' Conference 1999: 86-93 |