Bakhadyr Khoussainov

University of Electronic Science and Technology of China — China

Computer Science · Physical Sciences

23h-index2.0kcitations140works2.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

semigroups and automata theory(73), Computability, Logic, AI Algorithms(63), Advanced Algebra and Logic(27), Logic, programming, and type systems(24), Logic, Reasoning, and Knowledge(22)

Publications140 total

Finding small feedback arc sets on large graphs
Computers & Operations Research·2024· 2 cited
String compression in FA–presentable structures
Theoretical Computer Science·2023Open Access
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures
IEEE INFOCOM 2022 - IEEE Conference on Computer Communications·2022· 4 cited
Listing Maximal k-Plexes in Large Real-World Graphs
Proceedings of the ACM Web Conference 2022·2022· 21 citedOpen Access
Improving Togetherness Using Structural Entropy
Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering·2022· 3 cited
Attacking Community Detectors: Mislead Detectors via Manipulating the Graph Structure
Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering·2022· 4 cited
Quasi-Isometric Graph Simplifications
arXiv (Cornell University)·2021Open Access
Quasi-Isometric Graph-Simplifications
arXiv (Cornell University)·2021Open Access
From Local to Global Norm Emergence: Dissolving Self-reinforcing Substructures with Incremental Social Instruments
International Conference on Machine Learning·2021· 6 cited
Agent-Level Maximum Entropy Inverse Reinforcement Learning for Mean Field Games
arXiv (Cornell University)·2021· 3 citedOpen Access
Maximum Entropy Inverse Reinforcement Learning for Mean Field Games.
arXiv (Cornell University)·2021· 3 citedOpen Access
JSL volume 85 issue 2 Cover and Front matter
Journal of Symbolic Logic·2020Open Access
Effectiveness of the Completeness Theorem for an Intermediate Logic
Zenodo (CERN European Organization for Nuclear Research)·2020Open Access
JSL volume 85 issue 1 Cover and Front matter
Journal of Symbolic Logic·2020Open Access
Deciding Parity Games in Quasi-polynomial Time
SIAM Journal on Computing·2020· 21 cited
Automatic Equivalence Structures of Polynomial Growth
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2020· 1 citedOpen Access
Periodic Neural Networks for Multivariate Time Series Analysis and Forecasting
2019· 6 cited
The isomorphism problem for tree-automatic ordinals with addition
Information Processing Letters·2019Open Access
Computable rings, groups and their isomorphisms
2019
Random Subgroups of Rationals
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019Open Access
page 1 of 7Next →

Frequent Co-authors

Frank Stephan(8), Cristian S. Calude(7), Richard A. Shore(7), Anil Nerode(4), Sasha Rubin(4), Mia Minnes(4), Pavel Semukhin(4), Jiamou Liu(4), Sanjay Jain(3), Denis R. Hirschfeldt(3), Peter Hertling(3), Wei Li(2), Yongge Wang(2), André Nies(2), С. С. Гончаров(2), Michael J. Dinneen(2), Elena Calude(2), Alexander Gavruskin(2), Richard J. Coles(2), Alexei Miasnikov(2)