Bakhadyr Khoussainov | Academic Influence

Bakhadyr Khoussainov's AcademicInfluence.com Rankings

Bakhadyr Khoussainov

Computer Science

#2292

World Rank

#2389

Historical Rank

Recursion Theory

#3

World Rank

#3

Historical Rank

Theoretical Computer Science

#56

World Rank

#56

Historical Rank

computer-science Degrees

Bakhadyr Khoussainov

Mathematics

#3546

World Rank

#5212

Historical Rank

Complexity Theory

#13

World Rank

#13

Historical Rank

Measure Theory

#3463

World Rank

#4087

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Bakhadyr Khoussainov's Degrees

PhD Computer Science University of Auckland
Masters Mathematics Moscow State University
Bachelors Mathematics Moscow State University

Similar Degrees You Can Earn

Why Is Bakhadyr Khoussainov Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Bakhadyr M. Khoussainov is a computer scientist and mathematician, who was born and educated in the Soviet Union, works in the fields of mathematical logic, computability theory, computable model theory and theoretical computer science. With Anil Nerode, he is the co-founder of the theory of automatic structures, which is an extension of the theory of automatic groups.

(See a Problem?)

Bakhadyr Khoussainov's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Automatic Presentations of Structures (1994) (302)
Deciding parity games in quasipolynomial time (2017) (198)
Degree spectra and computable dimensions in algebraic structures (2002) (185)
Automata theory and its applications (2001) (126)
Automatic structures: richness and limitations (2004) (107)
Series Recursively Enumerable Reals and Chaitin Numbers (1997) (77)
Computable Models of Theories with Few Models (1997) (76)
Automatic linear orders and trees (2005) (67)
Recursively enumerable reals and Chaitin Omega numbers (1998) (51)
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families (1998) (49)
Computably categorical structures and expansions by constants (1999) (48)
From automatic structures to automatic groups (2011) (47)
Recursively enumerable reals and Chaitin &Ω numbers (2001) (46)
Logic in Computer Science (1997) (42)
Definability and Regularity in Automatic Structures (2004) (40)
Open Questions in the Theory of Automatic Structures (2008) (37)
On automatic partial orders (2003) (37)
Complexity of Categorical Theories with Computable Models (2004) (35)
Automatic Structures: Overview and Future Directions (2003) (34)
Limitwise monotonic sequences and degree spectra of structures (2013) (33)
From Automatic Structures to Borel Structures (2008) (33)
Graphs with Automatic Presentations over a Unary Alphabet (2001) (29)
Models and Computability: Effective Model Theory: The Number of Models and Their Complexity (1999) (28)
Logic Colloquium 2007: Three lectures on automatic structures (2008) (27)
Finite nondeterministic automata: Simulation and minimality (2000) (25)
LINEAR ORDERS REALIZED BY C.E. EQUIVALENCE RELATIONS (2016) (25)
Model-theoretic complexity of automatic structures (2008) (24)
Reducibilities among equivalence relations induced by recursively enumerable structures (2016) (22)
Graphs realised by r.e. equivalence relations (2014) (22)
On Initial Segments of Computable Linear Orders (1997) (22)
Degree-Theoretic Aspects of Computably Enumerable Reals (1998) (21)
Randomness, Computability, and Algebraic Specifications (1998) (20)
Open Problems in the Theory of Constructive Algebraic Systems (2000) (19)
Deterministic Automata: Simulation, Universality and Minimality (1997) (19)
Fine-grained access control for cloud computing (2013) (18)
Uniformity in Computable Structure Theory (2001) (18)
Unary automatic graphs: an algorithmic perspective (2008) (17)
Computation, Physics and Beyond (2012) (16)
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated (2006) (15)
Some results on automatic structures (2002) (15)
Finitely presented expansions of groups, semigroups, and algebras (2013) (14)
Computable categoricity and the Ershov hierarchy (2008) (14)
On Automatic Transitive Graphs (2014) (14)
Complexity of Some Infinite Games Played on Finite Graphs (2002) (13)
Semiautomatic Structures (2017) (13)
A computably categorical structure whose expansion by a constant has infinite computable dimension (2003) (13)
Dynamic algorithms for monotonic interval scheduling problem (2015) (13)
A quest for algorithmically random infinite structures (2014) (12)
Update games and update networks (2003) (11)
A Dynamic Algorithm for Reachability Games Played on Trees (2009) (11)
Chain-Based Covert Data Embedding Schemes in Blockchain (2022) (11)
Update Networks and Their Routing Strategies (2000) (10)
On the computability-theoretic complexity of trivial, strongly minimal models (2007) (10)
On Game-Theoretic Models of Networks (2001) (10)
Computable Isomorphisms of Boolean Algebras with Operators (2012) (9)
Decidable Kripke Models of Intuitionistic Theories (1998) (9)
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday (2017) (9)
Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families" (1999) (8)
Cayley Automatic Representations of Wreath Products (2015) (8)
Computable Categoricity of Graphs with Finite Components (2008) (8)
Model Theoretic Complexity of Automatic Structures (Extended Abstract) (2008) (8)
$$\Pi^0_1$$-Presentations of Algebras (2006) (7)
Computably Enumerable Algebras, Their Expansions, and Isomorphisms (2005) (7)
A computable ℵ0-categorical structure whose theory computes true arithmetic (2010) (7)
Lectures on Discrete Mathematics for Computer Science (2012) (7)
Applications of Kolmogorov complexity to computable model theory (2007) (6)
Agent-Level Maximum Entropy Inverse Reinforcement Learning for Mean Field Games (2021) (6)
A Journey to Computably Enumerable Structures (Tutorial Lectures) (2018) (6)
Finite Automata over Structures - (Extended Abstract) (2012) (5)
DEGREE SPECTRA OF UNARY RELATIONS ON 〈ω,≤〉 (2008) (5)
Finitely Generated Semiautomatic Groups (2016) (5)
From Local to Global Norm Emergence: Dissolving Self-reinforcing Substructures with Incremental Social Instruments (2021) (5)
Relaxed Update and Partition Network Games (2002) (5)
Periodic Neural Networks for Multivariate Time Series Analysis and Forecasting (2019) (5)
Effective aspects of algorithmically random structures (2019) (5)
Sequential Automatic Algebras (2008) (5)
On Algebraic Specifications of Abstract Data Types (2003) (5)
A Blockchain-Based Storage System With Financial Incentives for Load-balancing (2021) (4)
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? (1997) (4)
Recursive Models of Theories with Few Models (1998) (4)
Computable Kripke Models and Intermediate Logics (1998) (4)
Games Played on Finite Graphs (2001) (4)
Tree-automatic scattered linear orders (2016) (4)
Dynamising Interval Scheduling: The Monotonic Case (2013) (4)
Listing Maximal k-Plexes in Large Real-World Graphs (2022) (4)
Π 01-presentations of algebras ∗ (2005) (4)
Algorithmic Stability of Models (1993) (4)
Solutions of the Goncharov-Millar and Degree Spectra Problems in The Theory of Computable Models (2000) (3)
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals (2016) (3)
A Quest for Algorithmically Random Infinite Structures, II (2016) (3)
On Isomorphism Invariants of Some Automatic Structures (2002) (3)
Recursive Unary Algebras and Trees (1994) (3)
A Game Theoretic Approach to Service Discovery and Selection (2013) (3)
Efficient Algorithms for Games Played on Trees with Back-edges (2011) (3)
Some Thoughts On Automatic Structures (2002) (3)
Decision Problems for Finite Automata over Infinite Algebraic Structures (2016) (3)
Finitely presented expansions of computably enumerable semigroups (2012) (3)
A Brief Excursion to Parity Games (2018) (2)
Automata with Equational Constraints (1999) (2)
Adaptive Verification using Forced Simulation (2005) (2)
Dynamic Interval Scheduling for Multiple Machines (2014) (2)
Effective Properties of Finitely Generated R.E. Algebras (1995) (2)
On Decidable and Computable Models of Theories (2013) (2)
Algorithmically Random Universal Algebras (2017) (2)
A Robust Service Recommendation Scheme (2013) (2)
Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract (1997) (2)
Finite State Strategies in One Player McNaughton Games (2003) (2)
WiPOS: A POS Terminal Password Inference System Based on Wireless Signals (2020) (2)
Large scale geometries of infinite strings (2017) (2)
Multi-Unit Auction in Social Networks with Budgets (2022) (2)
On complexity of Ehrenfeucht-Fraïssé games (2007) (2)
Categoricity and Scott Families (1996) (2)
Deterministic finite automata (2012) (1)
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures (2022) (1)
A computable [image] structure whose theory computes true arithmetic (2010) (1)
Automatic linear orders and trees (Revised) (2003) (1)
Quantifier Free Definability on Infinite Algebras (2016) (1)
When Is Reachability Intrinsically Decidable? (2008) (1)
A Game Theory-Based Approach to Service Rating (2013) (1)
Maximum Entropy Inverse Reinforcement Learning for Mean Field Games (2021) (1)
Video Aficionado: We Know What You Are Watching (2020) (1)
Semiautomatic Structures (2017) (1)
Proof of Continuous Work for Reliable Data Storage Over Permissionless Blockchain (2022) (1)
Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond (2012) (1)
Automatic Equivalence Structures of Polynomial Growth (2020) (1)
Series On Game-Theoretic Models of Networks (2001) (1)
On State Complexity of Finite Word and Tree Languages (2012) (1)
Linear orders with distinguished function symbol (2009) (1)
AUTOMATIC STRUCTURES AND THEIR COMPLEXITY (2007) (1)
On Complexity of Ehrenfeucht-Fraı̈ssé Games (2007) (1)
Series Scott Families and Computably Categorical Structures (1996) (0)
Regular expressions and finite automata (2012) (0)
InFocus: Amplifying Critical Feature Influence on Non-Intrusive Load Monitoring through Self-Attention Mechanisms (2023) (0)
Descriptional Complexity of Determinization and Complementation for Finite Automata (2011) (0)
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals (2016) (0)
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007 (2008) (0)
Normal forms and the SAT problem (2012) (0)
Quasi-Isometric Graph Simplifications (2021) (0)
Clusters of Two Player Games and Restricted Determinacy Theorem (1997) (0)
Computability Aspects of Differential Games in Euclidian Spaces (2019) (0)
On computably enumerable structures (2014) (0)
Differentially Private Diffusion Auction: The Single-unit Case (2023) (0)
Who Controls the Network? (2022) (0)
Cdmtcs Research Report Series on Initial Segments of Computable Linear Orders on Initial Segments of Computable Linear Orders (1997) (0)
Decidability of Term Algebras Extending Partial Algebras (2005) (0)
On computably enumerable structures (2014) (0)
Eeectiveness of the Completeness Theorem for an Intermediate Logic 1 (1998) (0)
Semantics of propositional logic (2012) (0)
On Computability Theoretic Properties of Structures and Their Cartesian Products (2000) (0)
Series Degree-Theoretic Aspects of Computably Enumerable Reals (1998) (0)
Differential privacy diffusion auction of homogeneous items (2023) (0)
Cdmtcs Research Report Series Games with Unknown past Games with Unknown Past (1997) (0)
Circuit problems in graphs (2012) (0)
P 0 1 \pi^01 -presentations of algebras (2006) (0)
The path problem and undirected graphs (2012) (0)
Permutations and combinations (2012) (0)
Exploring active attacks for three incorrect implementations of the ISO/IEC 9798 in satellite networks (2021) (0)
Multi-unit Auction over a Social Network (2023) (0)
Abstracts of the Workshop on Automata, Structures and Logic (2004) (0)
Nondeterministic finite automata (2012) (0)
Computably Presentable Models of Theories with Few Models (1996) (0)
Designing finite automata (2012) (0)
Call for Papers Eighth International Conference on DEVELOPMENTS IN LANGUAGE THEORY (DLT'04) (2004) (0)
Decomposability and Computability (2022) (0)
The subset construction (2012) (0)
Types of functions (2012) (0)
Program correctness through loop invariants (2012) (0)
Euclidean algorithm and congruence relations (2012) (0)
JSL volume 85 issue 2 Cover and Front matter (2020) (0)
Computable Isomorphisms of Boolean Algebras with Operators (2012) (0)
Algebraic constraints, automata, and regular languages (2000) (0)
Degree Spe tra and Computable Dimensions inAlgebrai (2007) (0)
Games with Unknown Past (1998) (0)
String Compression in FA-Presentable Structures (2023) (0)
Finite Automata and Isomorphism Types (2000) (0)
Games on Graphs: Automata, Structure, and Complexity (2003) (0)
Complexity of Computable Models (2002) (0)
On Complexity of Computatable $\aleph_1$--Categorical Models (2002) (0)
Downey, R., f, iiForte, G. and Nies, A., Addendum to (1999) (0)
Solving infinite games on trees with back-edges (2012) (0)
Algebraic Constraints, Automata, and Regular Languages (Revised) (2001) (0)
Uniformity in Computable Stru ture (2000) (0)
The Notion of Rank and Games (1994) (0)
Definitions, theorems, and proofs (2012) (0)
Andersson, A., On second-order generalized quanti" ers and" finite structures (2002) (0)
InlineEquation ID=" IEq4"> EquationSource Format=" TEX"> ImageObject Color=" BlackWhite" FileRef=" 153200613ArticleIEq4. gif" Format=" GIF" Rendition=" HTML" Type=" Linedraw"/>-Presentations of Algebras (2006) (0)
Integers and divisibility (2012) (0)
Basics of directed graphs (2012) (0)
CDMTCS Research Report Series Randomness , Computability , and Algebraic Specifications (1996) (0)
JSL volume 85 issue 1 Cover and Front matter (2020) (0)
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures (2007) (0)
Extracting Winning Strategies in Update Games (2011) (0)
Sets and operations on sets (2012) (0)
Secret message passing (2012) (0)
Equivalence relations and partial orders (2012) (0)
INFINITE STRINGS AND THEIR LARGE SCALE PROPERTIES (2020) (0)
Connectivity in the presence of an opponent (2023) (0)
1995–1996 annual meeting of the association for symbolic logic (1996) (0)
Automatic Structures and Groups (2011) (0)
Scott Families and Computably Categorical Structures (1996) (0)
Applications of Rabin Automata (2001) (0)
Databases and relational structures (2012) (0)
Algorithms for finite automata (2012) (0)
Series Automata with Equational Constraints (1999) (0)
Dedicated to G. J. Chaitin for his 50th Birthday Recursively Enumerable Reals and Chaitin Numbers? (1998) (0)
Centralization Problem for Opinion Convergence in Decentralized Networks (2022) (0)
Finitely presented expansions of computably enumerable semigroups (2012) (0)
Downey, R., Fiiredi, Z., Jockusch Jr., CG and Ruhel, LA (1998) (0)
Random Subgroups of Rationals (2019) (0)
Shortest paths in directed weighted graphs (2012) (0)
Syntax of propositional logic (2012) (0)
Induction and recursion (2012) (0)
Definability and Regularity in Automatic Presentations of Subsystems of Arithmetic (2003) (0)
Characterizations of Network Auctions and Generalizations of VCG (2023) (0)
Effectiveness of the Completeness Theorem for an Intermediate Logic (1997) (0)
Games Played on Finite Graphs and Temporal Logic (2002) (0)
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures (2007) (0)
Series On Computable Theoretic Properties of Structures and Their Cartesian Products (2000) (0)
On algebraic and logical specifications of classes of regular languages (2003) (0)
The isomorphism problem for tree-automatic ordinals with addition (2018) (0)
Dynamic Algorithms for Interval Scheduling on a Single Machine (2014) (0)
On Index Sets of Some Properties of Computable Algebras (2010) (0)
Basics of probability (2012) (0)
MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load Monitoring based on A Dual-CNN Model (2023) (0)
Facility Location with Entrance Fees (2022) (0)
Dedicated to G . J . Chaitin for his 50 th Birthday Recurs ive ly Enumerable Reals and Chait in Y 2 Numbers * (2005) (0)
Nonassociative Computable Rings and Their Isomorphisms. (1997) (1997) (0)
Learning Density-Based Correlated Equilibria for Markov Games (2023) (0)
Computable rings, groups and their isomorphisms (1998) (0)
HCA: Hashchain-based Consensus Acceleration via Re-voting (2023) (0)
Relations on sets (2012) (0)
Algorithmic-Logical Theory of In nite Structures Dagstuhl Seminar (2008) (0)
Recursivelyenumerable reals and Chaitinnumbers (2001) (0)

This paper list is powered by the following services:

Other Resources About Bakhadyr Khoussainov

en.wikipedia.org

What Schools Are Affiliated With Bakhadyr Khoussainov?

Bakhadyr Khoussainov is affiliated with the following schools: