The following pages link to Bakhadyr Khoussainov (Q188054):
Displaying 50 items.
- Tree-automatic scattered linear orders (Q264574) (← links)
- Dynamic algorithms for monotonic interval scheduling problem (Q476865) (← links)
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- Model-theoretic complexity of automatic structures (Q636281) (← links)
- Computable isomorphisms of Boolean algebras with operators (Q694494) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- Update games and update networks (Q876693) (← links)
- Reducibilities among equivalence relations induced by recursively enumerable structures (Q896924) (← links)
- Computable categoricity and the Ershov hierarchy (Q958489) (← links)
- Linear orders with distinguished function symbol (Q1005923) (← links)
- On initial segments of computable linear orders (Q1267602) (← links)
- Computable Kripke models and intermediate logics (Q1271561) (← links)
- Decidable Kripke models of intuitionistic theories (Q1295382) (← links)
- Computable isomorphisms, degree spectra of relations, and Scott families (Q1295389) (← links)
- Deterministic automata. Simulation, universality and minimality (Q1377610) (← links)
- Computable models of theories with few models (Q1381432) (← links)
- Randnomness, computability, and algebraic specifications (Q1382180) (← links)
- Finite nondeterministic automata: simulation and minimality (Q1575547) (← links)
- Degree spectra and computable dimensions in algebraic structures (Q1612482) (← links)
- A brief excursion to parity games (Q1622942) (← links)
- Semiautomatic structures (Q1694004) (← links)
- On algebraic and logical specifications of classes of regular languages. (Q1874275) (← links)
- Finitely presented expansions of computably enumerable semigroups (Q1936272) (← links)
- From automatic structures to automatic groups. (Q2016098) (← links)
- The isomorphism problem for tree-automatic ordinals with addition (Q2274485) (← links)
- Graphs realised by r.e. equivalence relations (Q2349100) (← links)
- An uncountably categorical theory whose only computably presentable model is saturated (Q2505131) (← links)
- \(\Pi^0_1\)-presentations of algebras (Q2505502) (← links)
- String compression in FA-presentable structures (Q2682935) (← links)
- (Q2766676) (← links)
- Cayley automatic representations of wreath products (Q2814835) (← links)
- Decision Problems for Finite Automata over Infinite Algebraic Structures (Q2830202) (← links)
- Limitwise monotonic sequences and degree spectra of structures (Q2845476) (← links)
- Dynamising Interval Scheduling: The Monotonic Case (Q2870026) (← links)
- Finite Automata over Structures (Q2898048) (← links)
- On Automatic Transitive Graphs (Q2921970) (← links)
- Dynamic Interval Scheduling for Multiple Machines (Q2942631) (← links)
- Algorithmically Random Universal Algebras (Q2973065) (← links)
- Automatic Structures and Groups (Q3004565) (← links)
- (Q3005890) (← links)
- Three Lectures on Automatic Structures (Q3079695) (← links)
- Extracting Winning Strategies in Update Games (Q3091450) (← links)
- On State Complexity of Finite Word and Tree Languages (Q3167512) (← links)
- A Dynamic Algorithm for Reachability Games Played on Trees (Q3182948) (← links)
- Finitely Generated Semiautomatic Groups (Q3188266) (← links)
- LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (Q3188324) (← links)
- (Q3225708) (← links)
- (Q3396632) (← links)
- Model Theoretic Complexity of Automatic Structures (Extended Abstract) (Q3502675) (← links)
- Unary Automatic Graphs: An Algorithmic Perspective (Q3502677) (← links)
