The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sasha Rubin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Bakhadyr Khoussainov, Sasha Rubin
    Decidability of Term Algebras Extending Partial Algebras. [Citation Graph (0, 0)][DBLP]
    CSL, 2005, pp:292-308 [Conf]
  3. Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin
    Some Results on Automatic Structures. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:235-0 [Conf]
  4. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:44-53 [Conf]
  5. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    On Automatic Partial Orders. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:168-177 [Conf]
  6. 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]
  7. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    Definability and Regularity in Automatic Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:440-451 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]

  13. Cardinality and counting quantifiers on omega-automatic structures. [Citation Graph (, )][DBLP]


  14. Order-Invariant MSO is Stronger than Counting MSO in the Finite. [Citation Graph (, )][DBLP]


  15. Automata Presenting Structures: A Survey of the Finite String Case. [Citation Graph (, )][DBLP]


  16. Cardinality and counting quantifiers on omega-automatic structures [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002