Sasha Rubin

	2008
17		Tobias Ganzow, Sasha Rubin: Order-Invariant MSO is Stronger than Counting MSO in the Finite. STACS 2008: 313-324
16		Lukasz Kaiser, Sasha Rubin, Vince Bárány: Cardinality and counting quantifiers on omega-automatic structures. STACS 2008: 385-396
15		Sasha Rubin: Automata Presenting Structures: A Survey of the Finite String Case. Bulletin of Symbolic Logic 14(2): 169-209 (2008)
14		Lukasz Kaiser, Sasha Rubin, Vince Bárány: Cardinality and counting quantifiers on omega-automatic structures CoRR abs/0802.2866: (2008)
	2007
13		Tobias Ganzow, Sasha Rubin: Order-Invariant MSO is Stronger than Counting MSO in the Finite CoRR abs/0706.3723: (2007)
12		Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations CoRR abs/cs/0703064: (2007)
11		Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. Logical Methods in Computer Science 3(2): (2007)
	2005
10		Bakhadyr Khoussainov, Sasha Rubin: Decidability of Term Algebras Extending Partial Algebras. CSL 2005: 292-308
9		Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Automatic linear orders and trees. ACM Trans. Comput. Log. 6(4): 675-700 (2005)
	2004
8		Doron Bustan, Sasha Rubin, Moshe Y. Vardi: Verifying omega-Regular Properties of Markov Chains. CAV 2004: 189-201
7		Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. LICS 2004: 44-53
6		Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Definability and Regularity in Automatic Structures. STACS 2004: 440-451
	2003
5		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		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

Coauthor Index

1	Vince Bárány	[14] [16]
2	Doron Bustan	[8]
3	Tobias Ganzow	[13] [17]
4	Hajime Ishihara	[3]
5	Lukasz Kaiser	[14] [16]
6	Bakhadyr Khoussainov	[2] [3] [4] [5] [6] [7] [9] [10] [11] [12]
7	André Nies	[7] [11] [12]
8	Frank Stephan	[5] [6] [7] [9] [11] [12]
9	Moshe Y. Vardi	[8]

Colors in the list of coauthors