The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bakhadyr Khoussainov: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bakhadyr Khoussainov
    On Algebraic Specifications of Abstract Data Types. [Citation Graph (0, 0)][DBLP]
    CSL, 2003, pp:299-313 [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. Bakhadyr Khoussainov
    Finite State Strategies in One Player McNaughton Games. [Citation Graph (0, 0)][DBLP]
    DMTCS, 2003, pp:203-214 [Conf]
  4. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
    On Game-Theoretic Models of Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:550-561 [Conf]
  5. Bakhadyr Khoussainov, Anil Nerode
    Automatic Presentations of Structures. [Citation Graph (0, 0)][DBLP]
    LCC, 1994, pp:367-392 [Conf]
  6. Bakhadyr Khoussainov, Anil Nerode
    The Notion of Rank and Games. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:204-217 [Conf]
  7. Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin
    Some Results on Automatic Structures. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:235-0 [Conf]
  8. Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan
    Automatic Structures: Richness and Limitations. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:44-53 [Conf]
  9. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    On Automatic Partial Orders. [Citation Graph (0, 0)][DBLP]
    LICS, 2003, pp:168-177 [Conf]
  10. Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
    Recursively Enumerable Reals and Chaitin Omega Numbers. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:596-606 [Conf]
  11. Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
    Definability and Regularity in Automatic Structures. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:440-451 [Conf]
  12. Michael J. Dinneen, Bakhadyr Khoussainov
    Update Networks and Their Routing Strategies. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:127-136 [Conf]
  13. Hajime Ishihara, Bakhadyr Khoussainov
    Complexity of Some Infinite Games Played on Finite Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:270-281 [Conf]
  14. Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin
    P01-Presentations of Algebras. [Citation Graph (0, 0)][DBLP]
    Arch. Math. Log., 2006, v:45, n:6, pp:769-781 [Journal]
  15. Cristian Calude, Elena Calude, Bakhadyr Khoussainov
    Deterministic Automata: Simulation, Universality and Minimality. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1997, v:90, n:1-3, pp:263-276 [Journal]
  16. Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko
    Degree spectra and computable dimensions in algebraic structures. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2002, v:115, n:1-3, pp:71-113 [Journal]
  17. Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode
    Decidable Kripke Models of Intuitionistic Theories. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:115-123 [Journal]
  18. Bakhadyr Khoussainov
    Recursive Unary Algebras and Trees. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1994, v:67, n:1-3, pp:213-268 [Journal]
  19. Bakhadyr Khoussainov
    Randomness, Computability, and Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:91, n:1, pp:1-15 [Journal]
  20. Bakhadyr Khoussainov, Richard A. Shore
    Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:153-193 [Journal]
  21. Bakhadyr Khoussainov, Richard A. Shore
    Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1999, v:98, n:1-3, pp:297-298 [Journal]
  22. Cristian Calude, Peter Hertling, Bakhadyr Khoussainov
    Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal]
  23. Roopak Sinha, Partha S. Roop, Bakhadyr Khoussainov
    Adaptive Verification using Forced Simulation. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:141, n:3, pp:171-197 [Journal]
  24. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
    Relaxed Update and Partition Network Games. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:49, n:4, pp:301-312 [Journal]
  25. Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode
    Computable Kripke Models and Intermediate Logics. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:143, n:2, pp:205-230 [Journal]
  26. Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman
    Computably Enumerable Algebras, Their Expansions, and Isomorphisms. [Citation Graph (0, 0)][DBLP]
    IJAC, 2005, v:15, n:3, pp:437-454 [Journal]
  27. 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]
  28. 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]
  29. Michael J. Dinneen, Bakhadyr Khoussainov
    Update games and update networks. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:53-65 [Journal]
  30. Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore
    Computably Categorical Structures and Expansions by Constants. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1999, v:64, n:1, pp:13-37 [Journal]
  31. Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov
    Logic in Computer Science. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1133- [Journal]
  32. Hajime Ishihara, Bakhadyr Khoussainov
    Effectiveness of the Completeness Theorem for an Intermediate Logic. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:11, pp:1255-1265 [Journal]
  33. Bakhadyr Khoussainov
    On Computability Theoretic Properties of Structures and Their Cartesian Products. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:4, pp:467-475 [Journal]
  34. Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis
    Games with Unknown Past. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:185-204 [Journal]
  35. Bakhadyr Khoussainov, André Nies, Richard A. Shore
    Computable Models of Theories with Few Models. [Citation Graph (0, 0)][DBLP]
    Notre Dame Journal of Formal Logic, 1997, v:38, n:2, pp:165-178 [Journal]
  36. Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang
    Recursively enumerable reals and Chaitin Omega numbers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:255, n:1-2, pp:125-149 [Journal]
  37. Cristian Calude, Elena Calude, Bakhadyr Khoussainov
    Finite nondeterministic automata: Simulation and minimality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:242, n:1-2, pp:219-235 [Journal]
  38. Bakhadyr Khoussainov
    Algebraic constraints, automata, and regular languages. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:31, n:, pp:- [Journal]
  39. Bakhadyr Khoussainov
    On algebraic and logical specifications of classes of regular languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:2, n:298, pp:325-346 [Journal]
  40. 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]
  41. Bakhadyr Khoussainov, Jiamou Liu
    On Complexity of Ehrenfeucht-Fraïssé Games. [Citation Graph (0, 0)][DBLP]
    LFCS, 2007, pp:293-309 [Conf]
  42. 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]

  43. Computable Categoricity of Graphs with Finite Components. [Citation Graph (, )][DBLP]


  44. Sequential Automatic Algebras. [Citation Graph (, )][DBLP]


  45. On Index Sets of Some Properties of Computable Algebras. [Citation Graph (, )][DBLP]


  46. 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. [Citation Graph (, )][DBLP]


  47. 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. [Citation Graph (, )][DBLP]


  48. When Is Reachability Intrinsically Decidable?. [Citation Graph (, )][DBLP]


  49. Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. [Citation Graph (, )][DBLP]


  50. From Automatic Structures to Borel Structures. [Citation Graph (, )][DBLP]


  51. A Dynamic Algorithm for Reachability Games Played on Trees. [Citation Graph (, )][DBLP]


  52. Unary Automatic Graphs: An Algorithmic Perspective. [Citation Graph (, )][DBLP]


  53. Model Theoretic Complexity of Automatic Structures (Extended Abstract). [Citation Graph (, )][DBLP]


  54. Linear orders with distinguished function symbol. [Citation Graph (, )][DBLP]


  55. Computable categoricity and the Ershov hierarchy. [Citation Graph (, )][DBLP]


  56. On complexity of Ehrenfeucht-Fraïssé games. [Citation Graph (, )][DBLP]


  57. Model-theoretic complexity of automatic structures. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.011secs
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