![]() | 2009 | |
---|---|---|
59 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq: A Dynamic Algorithm for Reachability Games Played on Trees. MFCS 2009: 477-488 |
58 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Jiamou Liu: On complexity of Ehrenfeucht-Fraïssé games. Ann. Pure Appl. Logic 161(3): 404-415 (2009) |
57 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Mia Minnes: Model-theoretic complexity of automatic structures. Ann. Pure Appl. Logic 161(3): 416-426 (2009) |
56 | ![]() ![]() ![]() ![]() ![]() ![]() | Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov: Linear orders with distinguished function symbol. Arch. Math. Log. 48(1): 63-76 (2009) |
55 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes: Unary automatic graphs: an algorithmic perspective. Mathematical Structures in Computer Science 19(1): 133-152 (2009) |
2008 | ||
54 | ![]() ![]() ![]() ![]() ![]() ![]() | Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 |
53 | ![]() ![]() ![]() ![]() ![]() ![]() | Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu: Computable Categoricity of Graphs with Finite Components. CiE 2008: 139-148 |
52 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael Brough, Bakhadyr Khoussainov, Peter Nelson: Sequential Automatic Algebras. CiE 2008: 84-93 |
51 | ![]() ![]() ![]() ![]() ![]() ![]() | Barbara F. Csima, Bakhadyr Khoussainov: When Is Reachability Intrinsically Decidable?. Developments in Language Theory 2008: 216-227 |
50 | ![]() ![]() ![]() ![]() ![]() ![]() | Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies: From Automatic Structures to Borel Structures. LICS 2008: 431-441 |
49 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Mia Minnes: Model Theoretic Complexity of Automatic Structures (Extended Abstract). TAMC 2008: 514-525 |
48 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes: Unary Automatic Graphs: An Algorithmic Perspective. TAMC 2008: 542-553 |
47 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Frank Stephan, Yue Yang: Computable categoricity and the Ershov hierarchy. Ann. Pure Appl. Logic 156(1): 86-95 (2008) |
2007 | ||
46 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
45 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 |
44 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Jiamou Liu: On Complexity of Ehrenfeucht-Fraïssé Games. LFCS 2007: 293-309 |
43 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations CoRR abs/cs/0703064: (2007) |
42 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. Logical Methods in Computer Science 3(2): (2007) |
2006 | ||
41 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin: P01-Presentations of Algebras. Arch. Math. Log. 45(6): 769-781 (2006) |
2005 | ||
40 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Sasha Rubin: Decidability of Term Algebras Extending Partial Algebras. CSL 2005: 292-308 |
39 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Automatic linear orders and trees. ACM Trans. Comput. Log. 6(4): 675-700 (2005) |
38 | ![]() ![]() ![]() ![]() ![]() ![]() | Roopak Sinha, Partha S. Roop, Bakhadyr Khoussainov: Adaptive Verification using Forced Simulation. Electr. Notes Theor. Comput. Sci. 141(3): 171-197 (2005) |
37 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman: Computably Enumerable Algebras, Their Expansions, and Isomorphisms. IJAC 15(3): 437-454 (2005) |
2004 | ||
36 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan: Automatic Structures: Richness and Limitations. LICS 2004: 44-53 |
35 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: Definability and Regularity in Automatic Structures. STACS 2004: 440-451 |
2003 | ||
34 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: On Algebraic Specifications of Abstract Data Types. CSL 2003: 299-313 |
33 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: Finite State Strategies in One Player McNaughton Games. DMTCS 2003: 203-214 |
32 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan: On Automatic Partial Orders. LICS 2003: 168-177 |
31 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael J. Dinneen, Bakhadyr Khoussainov: Update games and update networks. J. Discrete Algorithms 1(1): 53-65 (2003) |
30 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Sasha Rubin: Automatic Structures: Overview and Future Directions. Journal of Automata, Languages and Combinatorics 8(2): 287-301 (2003) |
29 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: On algebraic and logical specifications of classes of regular languages. Theor. Comput. Sci. 2(298): 325-346 (2003) |
2002 | ||
28 | ![]() ![]() ![]() ![]() ![]() ![]() | Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin: Some Results on Automatic Structures. LICS 2002: 235- |
27 | ![]() ![]() ![]() ![]() ![]() ![]() | Hajime Ishihara, Bakhadyr Khoussainov: Complexity of Some Infinite Games Played on Finite Graphs. WG 2002: 270-281 |
26 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
25 | ![]() ![]() ![]() ![]() ![]() ![]() | Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: Relaxed Update and Partition Network Games. Fundam. Inform. 49(4): 301-312 (2002) |
2001 | ||
24 | ![]() ![]() ![]() ![]() ![]() ![]() | Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: On Game-Theoretic Models of Networks. ISAAC 2001: 550-561 |
23 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Sasha Rubin: Graphs with Automatic Presentations over a Unary Alphabet. Journal of Automata, Languages and Combinatorics 6(4): 467-480 (2001) |
22 | ![]() ![]() ![]() ![]() ![]() ![]() | Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001) |
2000 | ||
21 | ![]() ![]() ![]() ![]() ![]() ![]() | Michael J. Dinneen, Bakhadyr Khoussainov: Update Networks and Their Routing Strategies. WG 2000: 127-136 |
20 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: Algebraic constraints, automata, and regular languages. Electr. Notes Theor. Comput. Sci. 31: (2000) |
19 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: On Computability Theoretic Properties of Structures and Their Cartesian Products. Math. Log. Q. 46(4): 467-475 (2000) |
18 | ![]() ![]() ![]() ![]() ![]() ![]() | Cristian Calude, Elena Calude, Bakhadyr Khoussainov: Finite nondeterministic automata: Simulation and minimality. Theor. Comput. Sci. 242(1-2): 219-235 (2000) |
1999 | ||
17 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
16 | ![]() ![]() ![]() ![]() ![]() ![]() | 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 | ||
15 | ![]() ![]() ![]() ![]() ![]() ![]() | Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang: Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606 |
14 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: Randomness, Computability, and Algebraic Specifications. Ann. Pure Appl. Logic 91(1): 1-15 (1998) |
13 | ![]() ![]() ![]() ![]() ![]() ![]() | Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode: Decidable Kripke Models of Intuitionistic Theories. Ann. Pure Appl. Logic 93(1-3): 115-123 (1998) |
12 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Richard A. Shore: Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. Ann. Pure Appl. Logic 93(1-3): 153-193 (1998) |
11 | ![]() ![]() ![]() ![]() ![]() ![]() | Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode: Computable Kripke Models and Intermediate Logics. Inf. Comput. 143(2): 205-230 (1998) |
10 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis: Games with Unknown Past. Math. Log. Q. 44: 185-204 (1998) |
1997 | ||
9 | ![]() ![]() ![]() ![]() ![]() ![]() | Cristian S. Calude, Elena Calude, Bakhadyr Khoussainov: Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. Developments in Language Theory 1997: 519-537 |
8 | ![]() ![]() ![]() ![]() ![]() ![]() | Cristian Calude, Elena Calude, Bakhadyr Khoussainov: Deterministic Automata: Simulation, Universality and Minimality. Ann. Pure Appl. Logic 90(1-3): 263-276 (1997) |
7 | ![]() ![]() ![]() ![]() ![]() ![]() | Cristian Calude, Peter Hertling, Bakhadyr Khoussainov: Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bulletin of the EATCS 62: (1997) |
6 | ![]() ![]() ![]() ![]() ![]() ![]() | Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov: Logic in Computer Science. J. UCS 3(11): 1133 (1997) |
5 | ![]() ![]() ![]() ![]() ![]() ![]() | Hajime Ishihara, Bakhadyr Khoussainov: Effectiveness of the Completeness Theorem for an Intermediate Logic. J. UCS 3(11): 1255-1265 (1997) |
4 | ![]() ![]() ![]() ![]() ![]() ![]() | 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) |
1994 | ||
3 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Anil Nerode: Automatic Presentations of Structures. LCC 1994: 367-392 |
2 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov, Anil Nerode: The Notion of Rank and Games. LFCS 1994: 204-217 |
1 | ![]() ![]() ![]() ![]() ![]() ![]() | Bakhadyr Khoussainov: Recursive Unary Algebras and Trees. Ann. Pure Appl. Logic 67(1-3): 213-268 (1994) |