The SCEAS System
| |||||||

## Search the dblp DataBase
Sasha Rubin:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Doron Bustan, Sasha Rubin, Moshe Y. Vardi
**Verifying omega-Regular Properties of Markov Chains.**[Citation Graph (0, 0)][DBLP] CAV, 2004, pp:189-201 [Conf] - Bakhadyr Khoussainov, Sasha Rubin
**Decidability of Term Algebras Extending Partial Algebras.**[Citation Graph (0, 0)][DBLP] CSL, 2005, pp:292-308 [Conf] - Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin
**Some Results on Automatic Structures.**[Citation Graph (0, 0)][DBLP] LICS, 2002, pp:235-0 [Conf] - Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
**Automatic Structures: Richness and Limitations.**[Citation Graph (0, 0)][DBLP] LICS, 2004, pp:44-53 [Conf] - Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
**On Automatic Partial Orders.**[Citation Graph (0, 0)][DBLP] LICS, 2003, pp:168-177 [Conf] - Sasha Rubin
**Finite Automata and Well Ordered Sets.**[Citation Graph (0, 0)][DBLP] New Zealand Computer Science Research Students' Conference, 1999, pp:86-93 [Conf] - Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
**Definability and Regularity in Automatic Structures.**[Citation Graph (0, 0)][DBLP] STACS, 2004, pp:440-451 [Conf] - Bakhadyr Khoussainov, Sasha Rubin
**Graphs with Automatic Presentations over a Unary Alphabet.**[Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:467-480 [Journal] - Bakhadyr Khoussainov, Sasha Rubin
**Automatic Structures: Overview and Future Directions.**[Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2003, v:8, n:2, pp:287-301 [Journal] - Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
**Automatic linear orders and trees.**[Citation Graph (0, 0)][DBLP] ACM Trans. Comput. Log., 2005, v:6, n:4, pp:675-700 [Journal] - Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
**Automatic Structures: Richness and Limitations**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Tobias Ganzow, Sasha Rubin
**Order-Invariant MSO is Stronger than Counting MSO in the Finite**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Cardinality and counting quantifiers on omega-automatic structures.**[Citation Graph (, )][DBLP]**Order-Invariant MSO is Stronger than Counting MSO in the Finite.**[Citation Graph (, )][DBLP]**Automata Presenting Structures: A Survey of the Finite String Case.**[Citation Graph (, )][DBLP]**Cardinality and counting quantifiers on omega-automatic structures**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |