( en | de | ru )

 

Disambiguation of "Khoussainov, Bakhadyr"

Author of the publication

copydeleteadd this publication to your clipboard
Deciding parity games in quasipolynomial time.

, , , , and . STOC, page 252-263. ACM, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Khoussainov, Bakhadyr
add a person with the name Khoussainov, Bakhadyr
 

Other publications of authors with the same name

P01-Presentations of Algebras., , and . Arch. Math. Log., 45 (6): 769-781 (2006)Cayley automatic representations of wreath products., and . CoRR, (2015)Finite Automata over Structures - (Extended Abstract)., , and . TAMC, volume 7287 of Lecture Notes in Computer Science, page 373-384. Springer, (2012)On Complexity of Ehrenfeucht-Fraïssé Games., and . LFCS, volume 4514 of Lecture Notes in Computer Science, page 293-309. Springer, (2007)Decision Problems for Finite Automata over Infinite Algebraic Structures., and . CIAA, volume 9705 of Lecture Notes in Computer Science, page 3-11. Springer, (2016)Computably Enumerable Algebras, Their Expansions, and Isomorphisms., , and . Int. J. Algebra Comput., 15 (3): 437-454 (2005)Dynamising Interval Scheduling: The Monotonic Case., , , and . IWOCA, volume 8288 of Lecture Notes in Computer Science, page 178-191. Springer, (2013)Applications of Kolmogorov complexity to computable model theory., , and . J. Symb. Log., 72 (3): 1041-1054 (2007)Automatic Structures: Richness and Limitations., , , and . Logical Methods in Computer Science, (2007)On complexity of Ehrenfeucht-Fraïssé games., and . Ann. Pure Appl. Log., 161 (3): 404-415 (2009)