Bakhadyr Khoussainov

Orcid: 0000-0002-7522-1241

Affiliations:
  • University of Auckland, New Zealand


According to our database1, Bakhadyr Khoussainov authored at least 135 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
HCA: Hashchain-Based Consensus Acceleration Via Re-Voting.
IEEE Trans. Dependable Secur. Comput., 2024

2023
InFocus: Amplifying Critical Feature Influence on Non-Intrusive Load Monitoring Through Self-Attention Mechanisms.
IEEE Trans. Smart Grid, September, 2023

String compression in FA-presentable structures.
Theor. Comput. Sci., February, 2023

Two new algorithms for solving Müller games and their applications.
CoRR, 2023

Incentivising Diffusion while Preserving Differential Privacy.
Proceedings of the Uncertainty in Artificial Intelligence, 2023

Connectivity in the Presence of an Opponent.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Characterizations of Network Auctions and Generalizations of VCG.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Multi-Unit Auction over a Social Network.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Topological Network-Control Games.
Proceedings of the Computing and Combinatorics - 29th International Conference, 2023

Learning Density-Based Correlated Equilibria for Markov Games.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Differentially Private Diffusion Auction: The Single-unit Case.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Centralization Problem for Opinion Convergence in Decentralized Networks.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2023

Facility Location Games with Entrance Fees.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load Monitoring Based on a Dual-CNN Model.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Video Aficionado: We Know What You Are Watching.
IEEE Trans. Mob. Comput., 2022

Deciding Parity Games in Quasi-polynomial Time.
SIAM J. Comput., 2022

Infinite Strings and their Large Scale Properties.
J. Symb. Log., 2022

Proof of Continuous Work for Reliable Data Storage Over Permissionless Blockchain.
IEEE Internet Things J., 2022

Chain-Based Covert Data Embedding Schemes in Blockchain.
IEEE Internet Things J., 2022

Centralization Problem for Opinion Convergence in Decentralized Networks.
CoRR, 2022

Facility Location with Entrance Fees.
CoRR, 2022

Listing Maximal k-Plexes in Large Real-World Graphs.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures.
Proceedings of the IEEE INFOCOM 2022, 2022

Multi-Unit Auction in Social Networks with Budgets.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
A Blockchain-Based Storage System With Financial Incentives for Load-balancing.
IEEE Trans. Netw. Sci. Eng., 2021

Quasi-Isometric Graph-Simplifications.
CoRR, 2021

Maximum Entropy Inverse Reinforcement Learning for Mean Field Games.
CoRR, 2021

Exploring active attacks for three incorrect implementations of the ISO/IEC 9798 in satellite networks.
Comput. Commun., 2021

Improving Togetherness Using Structural Entropy.
Proceedings of the Mobile Computing, Applications, and Services, 2021

Attacking Community Detectors: Mislead Detectors via Manipulating the Graph Structure.
Proceedings of the Mobile Computing, Applications, and Services, 2021

From Local to Global Norm Emergence: Dissolving Self-reinforcing Substructures with Incremental Social Instruments.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
WiPOS: A POS Terminal Password Inference System Based on Wireless Signals.
IEEE Internet Things J., 2020

Automatic Equivalence Structures of Polynomial Growth.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

Whispers on Ethereum: Blockchain-based Covert Data Embedding Schemes.
Proceedings of the BSCI '20: Proceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure, 2020

2019
The isomorphism problem for tree-automatic ordinals with addition.
Inf. Process. Lett., 2019

Computability Aspects of Differential Games in Euclidian Spaces.
CoRR, 2019

Effective aspects of algorithmically random structures.
Comput., 2019

Random Subgroups of Rationals.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Periodic Neural Networks for Multivariate Time Series Analysis and Forecasting.
Proceedings of the International Joint Conference on Neural Networks, 2019

2018
Finitely generated semiautomatic groups.
Comput., 2018

A Brief Excursion to Parity Games.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

A Journey to Computably Enumerable Structures (Tutorial Lectures).
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
Semiautomatic Structures.
Theory Comput. Syst., 2017

Deciding parity games in quasipolynomial time.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Large scale geometries of infinite strings.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Tree-automatic scattered linear orders.
Theor. Comput. Sci., 2016

Reducibilities among equivalence relations induced by recursively enumerable structures.
Theor. Comput. Sci., 2016

Linear Orders Realized by C.E. Equivalence Relations.
J. Symb. Log., 2016

Cayley Automatic Representations of Wreath Products.
Int. J. Found. Comput. Sci., 2016

Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals.
Algorithmica, 2016

Decision Problems for Finite Automata over Infinite Algebraic Structures.
Proceedings of the Implementation and Application of Automata, 2016

Quantifier Free Definability on Infinite Algebras.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

A Quest for Algorithmically Random Infinite Structures, II.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015
Dynamic algorithms for monotonic interval scheduling problem.
Theor. Comput. Sci., 2015

2014
Dynamic Algorithms for Interval Scheduling on a Single Machine.
CoRR, 2014

Graphs realised by r.e. equivalence relations.
Ann. Pure Appl. Log., 2014

Dynamic Interval Scheduling for Multiple Machines.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

On Automatic Transitive Graphs.
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

A quest for algorithmically random infinite structures.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Fine-grained access control for cloud computing.
Int. J. Grid Util. Comput., 2013

A Game Theoretic Approach to Service Discovery and Selection.
Proceedings of the IEEE International Conference on Systems, 2013

A Game Theory-Based Approach to Service Rating.
Proceedings of the International Conference on Parallel and Distributed Computing, 2013

Dynamising Interval Scheduling: The Monotonic Case.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

On Decidable and Computable Models of Theories.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

A Robust Service Recommendation Scheme.
Proceedings of the 2013 IEEE International Conference on Services Computing, Santa Clara, CA, USA, June 28, 2013

2012
Computable Isomorphisms of Boolean Algebras with Operators.
Stud Logica, 2012

Finite Automata over Structures - (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2012

On State Complexity of Finite Word and Tree Languages.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Solving infinite games on trees with back-edges.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

Lectures on Discrete Mathematics for Computer Science
Algebra and Discrete Mathematics 3, World Scientific, ISBN: 978-981-4340-50-2, 2012

2011
Efficient Algorithms for Games Played on Trees with Back-edges.
Fundam. Informaticae, 2011

From automatic structures to automatic groups
CoRR, 2011

Automatic Structures and Groups.
Proceedings of the Language and Automata Theory and Applications, 2011

Extracting Winning Strategies in Update Games.
Proceedings of the Models of Computation in Context, 2011

Descriptional Complexity of Determinization and Complementation for Finite Automata.
Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010
A computable Alef<sub>0</sub>-categorical structure whose theory computes true arithmetic.
J. Symb. Log., 2010

On Index Sets of Some Properties of Computable Algebras.
Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

2009
Unary automatic graphs: an algorithmic perspective.
Math. Struct. Comput. Sci., 2009

Model-theoretic complexity of automatic structures.
Ann. Pure Appl. Log., 2009

On complexity of Ehrenfeucht-Fraïssé games.
Ann. Pure Appl. Log., 2009

Linear orders with distinguished function symbol.
Arch. Math. Log., 2009

A Dynamic Algorithm for Reachability Games Played on Trees.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2008
Open Questions in the Theory of Automatic Structures.
Bull. EATCS, 2008

Computable categoricity and the Ershov hierarchy.
Ann. Pure Appl. Log., 2008

Model Theoretic Complexity of Automatic Structures (Extended Abstract).
Proceedings of the Theory and Applications of Models of Computation, 2008

From Automatic Structures to Borel Structures.
Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

When Is Reachability Intrinsically Decidable?.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Computable Categoricity of Graphs with Finite Components.
Proceedings of the Logic and Theory of Algorithms, 2008

Sequential Automatic Algebras.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Automatic Structures: Richness and Limitations.
Log. Methods Comput. Sci., 2007

Applications of Kolmogorov complexity to computable model theory.
J. Symb. Log., 2007

07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

07441 Summary -- Algorithmic-Logical Theory of Infinite Structures.
Proceedings of the Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007, 2007

2006
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated.
Notre Dame J. Formal Log., 2006

P<sup>0</sup><sub>1</sub>-Presentations of Algebras.
Arch. Math. Log., 2006

2005
Automatic linear orders and trees.
ACM Trans. Comput. Log., 2005

Computably Enumerable Algebras, Their Expansions, and Isomorphisms.
Int. J. Algebra Comput., 2005

Adaptive Verification using Forced Simulation.
Proceedings of the Second International Workshop on Formal Foundations of Embedded Software and Component-based Software Architectures, 2005

Decidability of Term Algebras Extending Partial Algebras.
Proceedings of the Computer Science Logic, 19th International Workshop, 2005

2004
Definability and Regularity in Automatic Structures.
Proceedings of the STACS 2004, 2004

2003
On algebraic and logical specifications of classes of regular languages.
Theor. Comput. Sci., 2003

A computably categorical structure whose expansion by a constant has infinite computable dimension.
J. Symb. Log., 2003

Update games and update networks.
J. Discrete Algorithms, 2003

Automatic Structures: Overview and Future Directions.
J. Autom. Lang. Comb., 2003

On Automatic Partial Orders.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Finite State Strategies in One Player McNaughton Games.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

On Algebraic Specifications of Abstract Data Types.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002
Relaxed Update and Partition Network Games.
Fundam. Informaticae, 2002

Degree spectra and computable dimensions in algebraic structures.
Ann. Pure Appl. Log., 2002

Complexity of Some Infinite Games Played on Finite Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Some Results on Automatic Structures.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
Recursively enumerable reals and Chaitin Omega numbers.
Theor. Comput. Sci., 2001

Graphs with Automatic Presentations over a Unary Alphabet.
J. Autom. Lang. Comb., 2001

On Game-Theoretic Models of Networks.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

2000
Algebraic constraints, automata, and regular languages.
Proceedings of the Computing: the Australasian Theory Symposium, 2000

Finite nondeterministic automata: Simulation and minimality.
Theor. Comput. Sci., 2000

On Computability Theoretic Properties of Structures and Their Cartesian Products.
Math. Log. Q., 2000

Update Networks and Their Routing Strategies.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999
Computably Categorical Structures and Expansions by Constants.
J. Symb. Log., 1999

Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families".
Ann. Pure Appl. Log., 1999

1998
Games with Unknown Past.
Math. Log. Q., 1998

Computable Kripke Models and Intermediate Logics.
Inf. Comput., 1998

Computable Isomorphisms, Degree Spectra of Relations, and Scott Families.
Ann. Pure Appl. Log., 1998

Randomness, Computability, and Algebraic Specifications.
Ann. Pure Appl. Log., 1998

Decidable Kripke Models of Intuitionistic Theories.
Ann. Pure Appl. Log., 1998

1997
Computable Models of Theories with Few Models.
Notre Dame J. Formal Log., 1997

Effectiveness of the Completeness Theorem for an Intermediate Logic.
J. Univers. Comput. Sci., 1997

Logic in Computer Science.
J. Univers. Comput. Sci., 1997

Do the Zeros of Riemann's Zeta-Function Form a Random Sequence?
Bull. EATCS, 1997

Deterministic Automata: Simulation, Universality and Minimality.
Ann. Pure Appl. Log., 1997

Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
Categoricity and Scott Families.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1994
Recursive Unary Algebras and Trees.
Ann. Pure Appl. Log., 1994

The Notion of Rank and Games.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

Automatic Presentations of Structures.
Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994


  Loading...