Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Bakhadyr Khoussainov
2010 – today
- 2013
[c32]Alexander Gavruskin, Bakhadyr Khoussainov: On Decidable and Computable Models of Theories. CiE 2013: 200-209- 2012
- [j40]Bakhadyr Khoussainov, Tomasz Kowalski: Computable Isomorphisms of Boolean Algebras with Operators. Studia Logica 100(3): 481-496 (2012)
- [c31]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu: Solving infinite games on trees with back-edges. CATS 2012: 113-122
- [c30]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu: On State Complexity of Finite Word and Tree Languages. Developments in Language Theory 2012: 392-403
- [c29]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu: Finite Automata over Structures - (Extended Abstract). TAMC 2012: 373-384
- [e2]Michael J. Dinneen, Bakhadyr Khoussainov, André Nies (Eds.): Computation, Physics and Beyond - International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers. Lecture Notes in Computer Science 7160, Springer 2012, ISBN 978-3-642-27653-8
- 2011
- [j39]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu: Efficient Algorithms for Games Played on Trees with Back-edges. Fundam. Inform. 111(4): 391-412 (2011)
- [c28]Aniruddh Gandhi, Nan Rosemary Ke, Bakhadyr Khoussainov: Descriptional Complexity of Determinization and Complementation for Finite Automata. CATS 2011: 95-104
- [c27]Imran Khaliq, Bakhadyr Khoussainov, Jiamou Liu: Extracting Winning Strategies in Update Games. CiE 2011: 142-151
- [c26]
- [i2]Olga Kharlampovich, Bakhadyr Khoussainov, Alexei Miasnikov: From automatic structures to automatic groups. CoRR abs/1107.3645 (2011)
- 2010
- [j38]Bakhadyr Khoussainov, Antonio Montalbán: A computable Alef0-categorical structure whose theory computes true arithmetic. J. Symb. Log. 75(2): 728-740 (2010)
- [c25]Bakhadyr Khoussainov, Andrey Morozov: On Index Sets of Some Properties of Computable Algebras. CiE 2010: 219-228
2000 – 2009
- 2009
- [j37]Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov: Linear orders with distinguished function symbol. Arch. Math. Log. 48(1): 63-76 (2009)
- [j36]Bakhadyr Khoussainov, Jiamou Liu: On complexity of Ehrenfeucht-Fraïssé games. Ann. Pure Appl. Logic 161(3): 404-415 (2009)
- [j35]Bakhadyr Khoussainov, Mia Minnes: Model-theoretic complexity of automatic structures. Ann. Pure Appl. Logic 161(3): 416-426 (2009)
- [j34]Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes: Unary automatic graphs: an algorithmic perspective. Mathematical Structures in Computer Science 19(1): 133-152 (2009)
- [c24]Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq: A Dynamic Algorithm for Reachability Games Played on Trees. MFCS 2009: 477-488
- 2008
- [j33]Bakhadyr Khoussainov, Frank Stephan, Yue Yang: Computable categoricity and the Ershov hierarchy. Ann. Pure Appl. Logic 156(1): 86-95 (2008)
- [j32]Bakhadyr Khoussainov, Anil Nerode: Open Questions in the Theory of Automatic Structures. Bulletin of the EATCS 94: 181-204 (2008)
- [c23]
- [c22]Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu: Computable Categoricity of Graphs with Finite Components. CiE 2008: 139-148
- [c21]Barbara F. Csima, Bakhadyr Khoussainov: When Is Reachability Intrinsically Decidable?. Developments in Language Theory 2008: 216-227
- [c20]Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies: From Automatic Structures to Borel Structures. LICS 2008: 431-441
- [c19]Bakhadyr Khoussainov, Mia Minnes: Model Theoretic Complexity of Automatic Structures (Extended Abstract). TAMC 2008: 514-525
- [c18]Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes: Unary Automatic Graphs: An Algorithmic Perspective. TAMC 2008: 542-553
- [e1]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi (Eds.): Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- 2007
- [j31]Bakhadyr Khoussainov, Pavel Semukhin, Frank Stephan: Applications of Kolmogorov complexity to computable model theory. J. Symb. Log. 72(3): 1041-1054 (2007)
- [j30]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. Logical Methods in Computer Science 3(2) (2007)
- [c17]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
- [c16]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
- [c15]
- [i1]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007)
- 2006
- [j29]Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin: P01-Presentations of Algebras. Arch. Math. Log. 45(6): 769-781 (2006)
- [j28]Bakhadyr Khoussainov, Denis R. Hirschfeldt, Pavel Semukhin: An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated. Notre Dame Journal of Formal Logic 47(1): 63-71 (2006)
- 2005
- [j27]Roopak Sinha, Partha S. Roop, Bakhadyr Khoussainov: Adaptive Verification using Forced Simulation. Electr. Notes Theor. Comput. Sci. 141(3): 171-197 (2005)
- [j26]Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman: Computably Enumerable Algebras, Their Expansions, and Isomorphisms. IJAC 15(3): 437-454 (2005)
- [j25]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Automatic linear orders and trees. ACM Trans. Comput. Log. 6(4): 675-700 (2005)
- [c14]Bakhadyr Khoussainov, Sasha Rubin: Decidability of Term Algebras Extending Partial Algebras. CSL 2005: 292-308
- 2004
- [c13]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. LICS 2004: 44-53
- [c12]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Definability and Regularity in Automatic Structures. STACS 2004: 440-451
- 2003
- [j24]Bakhadyr Khoussainov, Sasha Rubin: Automatic Structures: Overview and Future Directions. Journal of Automata, Languages and Combinatorics 8(2): 287-301 (2003)
- [j23]Michael J. Dinneen, Bakhadyr Khoussainov: Update games and update networks. J. Discrete Algorithms 1(1): 53-65 (2003)
- [j22]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore: A computably categorical structure whose expansion by a constant has infinite computable dimension. J. Symb. Log. 68(4): 1199-1241 (2003)
- [j21]Bakhadyr Khoussainov: On algebraic and logical specifications of classes of regular languages. Theor. Comput. Sci. 2(298): 325-346 (2003)
- [c11]
- [c10]
- [c9]
- 2002
- [j20]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko: Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Logic 115(1-3): 71-113 (2002)
- [j19]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: Relaxed Update and Partition Network Games. Fundam. Inform. 49(4): 301-312 (2002)
- [c8]Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin: Some Results on Automatic Structures. LICS 2002: 235-
- [c7]Hajime Ishihara, Bakhadyr Khoussainov: Complexity of Some Infinite Games Played on Finite Graphs. WG 2002: 270-281
- 2001
- [j18]Bakhadyr Khoussainov, Sasha Rubin: Graphs with Automatic Presentations over a Unary Alphabet. Journal of Automata, Languages and Combinatorics 6(4): 467-480 (2001)
- [j17]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001)
- [c6]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: On Game-Theoretic Models of Networks. ISAAC 2001: 550-561
- 2000
- [j16]Bakhadyr Khoussainov: On Computability Theoretic Properties of Structures and Their Cartesian Products. Math. Log. Q. 46(4): 467-475 (2000)
- [j15]Bakhadyr Khoussainov: Algebraic constraints, automata, and regular languages. Electr. Notes Theor. Comput. Sci. 31: 104-117 (2000)
- [j14]Cristian Calude, Elena Calude, Bakhadyr Khoussainov: Finite nondeterministic automata: Simulation and minimality. Theor. Comput. Sci. 242(1-2): 219-235 (2000)
- [c5]Michael J. Dinneen, Bakhadyr Khoussainov: Update Networks and Their Routing Strategies. WG 2000: 127-136
1990 – 1999
- 1999
- [j13]Bakhadyr Khoussainov, Richard A. Shore: Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". Ann. Pure Appl. Logic 98(1-3): 297-298 (1999)
- [j12]Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore: Computably Categorical Structures and Expansions by Constants. J. Symb. Log. 64(1): 13-37 (1999)
- 1998
- [j11]Bakhadyr Khoussainov: Randomness, Computability, and Algebraic Specifications. Ann. Pure Appl. Logic 91(1): 1-15 (1998)
- [j10]Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode: Decidable Kripke Models of Intuitionistic Theories. Ann. Pure Appl. Logic 93(1-3): 115-123 (1998)
- [j9]Bakhadyr Khoussainov, Richard A. Shore: Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. Ann. Pure Appl. Logic 93(1-3): 153-193 (1998)
- [j8]Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode: Computable Kripke Models and Intermediate Logics. Inf. Comput. 143(2): 205-230 (1998)
- [j7]Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis: Games with Unknown Past. Math. Log. Q. 44: 185-204 (1998)
- [c4]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606
- 1997
- [j6]Cristian Calude, Elena Calude, Bakhadyr Khoussainov: Deterministic Automata: Simulation, Universality and Minimality. Ann. Pure Appl. Logic 90(1-3): 263-276 (1997)
- [j5]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov: Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bulletin of the EATCS 62 (1997)
- [j4]Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov: Logic in Computer Science. J. UCS 3(11): 1133 (1997)
- [j3]Hajime Ishihara, Bakhadyr Khoussainov: Effectiveness of the Completeness Theorem for an Intermediate Logic. J. UCS 3(11): 1255-1265 (1997)
- [j2]Bakhadyr Khoussainov, André Nies, Richard A. Shore: Computable Models of Theories with Few Models. Notre Dame Journal of Formal Logic 38(2): 165-178 (1997)
- [c3]Cristian S. Calude, Elena Calude, Bakhadyr Khoussainov: Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. Developments in Language Theory 1997: 519-537
- 1994
- [j1]Bakhadyr Khoussainov: Recursive Unary Algebras and Trees. Ann. Pure Appl. Logic 67(1-3): 213-268 (1994)
- [c2]
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:04 CEST by the dblp team