default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBakhadyr Khoussainov
Bakh Khoussainov
Person information
- affiliation: University of Auckland, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j63]Ziliang Xiong
, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Finding small feedback arc sets on large graphs. Comput. Oper. Res. 169: 106724 (2024)- [j62]Zijian Zhang, Xuyang Liu, Meng Li, Hao Yin, Liehuang Zhu, Bakh Khoussainov, Keke Gai:
HCA: Hashchain-Based Consensus Acceleration Via Re-Voting. IEEE Trans. Dependable Secur. Comput. 21(2): 775-788 (2024) - [j61]Zijian Zhang, Xin Lu, Meng Li, Jincheng An, Yang Yu, Hao Yin, Liehuang Zhu, Yong Liu, Jiamou Liu, Bakh Khoussainov:
A Blockchain-Based Privacy-Preserving Scheme for Sealed-Bid Auction. IEEE Trans. Dependable Secur. Comput. 21(5): 4668-4683 (2024) - [c72]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Meta-Mechanisms for Combinatorial Auctions over Social Networks. ECAI 2024: 3244-3251 - [c71]Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Balancing Efficiency with Equality: Auction Design with Group Fairness Concerns. ECAI 2024: 3252-3259 - [c70]Nadim Kasymov, Nadira Karimova, Bakh Khoussainov:
Defining algorithmically presented structures in first order logic. LICS 2024: 47:1-47:13 - [i26]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Deciding regular games: a playground for exponential time algorithms. CoRR abs/2405.07188 (2024) - [i25]Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Balancing Efficiency with Equality: Auction Design with Group Fairness Concerns. CoRR abs/2408.04545 (2024) - [i24]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Meta-mechanisms for Combinatorial Auctions over Social Networks. CoRR abs/2408.04555 (2024) - 2023
- [j60]Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
String compression in FA-presentable structures. Theor. Comput. Sci. 947: 113705 (2023) - [j59]Jialing He, Zijian Zhang, Liran Ma, Zhouyu Zhang, Meng Li, Bakh Khoussainov, Jiamou Liu, Liehuang Zhu:
InFocus: Amplifying Critical Feature Influence on Non-Intrusive Load Monitoring Through Self-Attention Mechanisms. IEEE Trans. Smart Grid 14(5): 3828-3840 (2023) - [c69]Jialing He, Jiamou Liu, Zijian Zhang, Yang Chen, Yiwei Liu, Bakh Khoussainov, Liehuang Zhu:
MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load Monitoring Based on a Dual-CNN Model. AAAI 2023: 5078-5086 - [c68]Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov:
Facility Location Games with Entrance Fees. AAAI 2023: 5797-5804 - [c67]Yiping Liu, Jiamou Liu, Bakh Khoussainov, Miao Qiao, Bo Yan, Mengxiao Zhang:
Centralization Problem for Opinion Convergence in Decentralized Networks. ASONAM 2023: 658-665 - [c66]Libo Zhang, Yang Chen, Toru Takisaka, Bakh Khoussainov, Michael Witbrock, Jiamou Liu:
Learning Density-Based Correlated Equilibria for Markov Games. AAMAS 2023: 652-660 - [c65]Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Differentially Private Diffusion Auction: The Single-unit Case. AAMAS 2023: 2724-2726 - [c64]Zihui Liang, Bakh Khoussainov, Haidong Yang:
Topological Network-Control Games. COCOON (2) 2023: 144-156 - [c63]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao:
Multi-Unit Auction over a Social Network. ECAI 2023: 676-683 - [c62]Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song:
Characterizations of Network Auctions and Generalizations of VCG. ECAI 2023: 2736-2743 - [c61]Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the Presence of an Opponent. ESA 2023: 79:1-79:14 - [c60]Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Incentivising Diffusion while Preserving Differential Privacy. UAI 2023: 963-972 - [i23]Dmitry Berdinsky, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
String Compression in FA-Presentable Structures. CoRR abs/2302.01009 (2023) - [i22]Jialing He, Jiamou Liu, Zijian Zhang, Yang Chen, Yiwei Liu, Bakh Khoussainov, Liehuang Zhu:
MSDC: Exploiting Multi-State Power Consumption in Non-intrusive Load Monitoring based on A Dual-CNN Model. CoRR abs/2302.05565 (2023) - [i21]Fengjuan Jia, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov:
Differentially Private Diffusion Auction: The Single-unit Case. CoRR abs/2302.07072 (2023) - [i20]Libo Zhang, Yang Chen, Toru Takisaka, Bakh Khoussainov, Michael Witbrock, Jiamou Liu:
Learning Density-Based Correlated Equilibria for Markov Games. CoRR abs/2302.08001 (2023) - [i19]Yuan Fang, Mengxiao Zhang, Jiamou Liu, Bakh Khoussainov, Mingyu Xiao:
Multi-unit Auction over a Social Network. CoRR abs/2302.08924 (2023) - [i18]Mingyu Xiao, Guixin Lin, Bakh Khoussainov, Yuchao Song:
Characterizations of Network Auctions and Generalizations of VCG. CoRR abs/2302.09237 (2023) - [i17]Zihui Liang, Bakh Khoussainov, Toru Takisaka, Mingyu Xiao:
Connectivity in the presence of an opponent. CoRR abs/2304.08783 (2023) - [i16]Zihui Liang, Bakh Khoussainov, Mingyu Xiao:
Two new algorithms for solving Müller games and their applications. CoRR abs/2311.04655 (2023) - 2022
- [j58]Hao Yin, Zijian Zhang, Jialing He, Liran Ma, Liehuang Zhu, Meng Li, Bakh Khoussainov:
Proof of Continuous Work for Reliable Data Storage Over Permissionless Blockchain. IEEE Internet Things J. 9(10): 7866-7875 (2022) - [j57]Haotian Cao, Hao Yin, Feng Gao, Zijian Zhang, Bakh Khoussainov, Shubin Xu, Liehuang Zhu:
Chain-Based Covert Data Embedding Schemes in Blockchain. IEEE Internet Things J. 9(16): 14699-14707 (2022) - [j56]Bakh Khoussainov, Toru Takisaka:
Infinite Strings and their Large Scale Properties. J. Symb. Log. 87(2): 585-625 (2022) - [j55]Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan:
Deciding Parity Games in Quasi-polynomial Time. SIAM J. Comput. 51(2): 17-152 (2022) - [j54]Jialing He, Zijian Zhang, Jian Mao, Liran Ma, Bakh Khoussainov, Rui Jin, Liehuang Zhu:
Video Aficionado: We Know What You Are Watching. IEEE Trans. Mob. Comput. 21(8): 3041-3052 (2022) - [c59]Mingyu Xiao, Yuchao Song, Bakh Khoussainov:
Multi-Unit Auction in Social Networks with Budgets. AAAI 2022: 5228-5235 - [c58]Binglin Tao, Mingyu Xiao, Bakhadyr Khoussainov, Junqiang Peng:
Optimal Shielding to Guarantee Region-Based Connectivity under Geographical Failures. INFOCOM 2022: 1109-1118 - [c57]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. WWW 2022: 1517-1527 - [i15]Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov:
Listing Maximal k-Plexes in Large Real-World Graphs. CoRR abs/2202.08737 (2022) - [i14]Mengfan Ma, Mingyu Xiao, Tian Bai, Bakh Khoussainov:
Facility Location with Entrance Fees. CoRR abs/2204.11282 (2022) - [i13]Yiping Liu, Jiamou Liu, Bakhadyr Khoussainov, Miao Qiao, Bo Yan:
Centralization Problem for Opinion Convergence in Decentralized Networks. CoRR abs/2210.16041 (2022) - 2021
- [j53]Zhengjia Zhu, Hao Yin, Zijian Zhang, Tielei Li, Jiamou Liu, Bakh Khoussainov, Chang Xu:
Exploring active attacks for three incorrect implementations of the ISO/IEC 9798 in satellite networks. Comput. Commun. 172: 93-101 (2021) - [j52]Hao Yin, Zijian Zhang, Liehuang Zhu, Meng Li, Xiaojiang Du, Mohsen Guizani, Bakh Khoussainov:
A Blockchain-Based Storage System With Financial Incentives for Load-balancing. IEEE Trans. Netw. Sci. Eng. 8(2): 1178-1188 (2021) - [c56]Yiwei Liu, Jiamou Liu, Kaibin Wan, Zhan Qin, Zijian Zhang, Bakhadyr Khoussainov, Liehuang Zhu:
From Local to Global Norm Emergence: Dissolving Self-reinforcing Substructures with Incremental Social Instruments. ICML 2021: 6871-6881 - [c55]Siyu Zhang, Jiamou Liu, Yiwei Liu, Zijian Zhang, Bakhadyr Khoussainov:
Improving Togetherness Using Structural Entropy. MobiCASE 2021: 85-98 - [c54]Kaibin Wan, Jiamou Liu, Yiwei Liu, Zijian Zhang, Bakhadyr Khoussainov:
Attacking Community Detectors: Mislead Detectors via Manipulating the Graph Structure. MobiCASE 2021: 112-128 - [i12]Yang Chen, Jiamou Liu, Bakhadyr Khoussainov:
Maximum Entropy Inverse Reinforcement Learning for Mean Field Games. CoRR abs/2104.14654 (2021) - [i11]Bakhadyr Khoussainov, Khí-Uí Soo:
Quasi-Isometric Graph-Simplifications. CoRR abs/2111.13238 (2021) - 2020
- [j51]Zijian Zhang, Nurilla Avazov, Jiamou Liu, Bakh Khoussainov, Xin Li, Keke Gai, Liehuang Zhu:
WiPOS: A POS Terminal Password Inference System Based on Wireless Signals. IEEE Internet Things J. 7(8): 7506-7516 (2020) - [c53]Shaoyuan Liu, Zhi Fang, Feng Gao, Bakh Khoussainov, Zijian Zhang, Jiamou Liu, Liehuang Zhu:
Whispers on Ethereum: Blockchain-based Covert Data Embedding Schemes. BSCI 2020: 171-179 - [c52]Moses Ganardi, Bakhadyr Khoussainov:
Automatic Equivalence Structures of Polynomial Growth. CSL 2020: 21:1-21:16
2010 – 2019
- 2019
- [j50]Matthew Harrison-Trainor, Bakh Khoussainov, Daniel Turetsky:
Effective aspects of algorithmically random structures. Comput. 8(3-4): 359-375 (2019) - [j49]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
The isomorphism problem for tree-automatic ordinals with addition. Inf. Process. Lett. 149: 19-24 (2019) - [c51]Nurilla Avazov, Jiamou Liu, Bakhadyr Khoussainov:
Periodic Neural Networks for Multivariate Time Series Analysis and Forecasting. IJCNN 2019: 1-8 - [c50]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. MFCS 2019: 25:1-25:14 - [i10]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. CoRR abs/1901.04743 (2019) - [i9]Gafurjan I. Ibragimov, Bakh Khoussainov, Arno Pauly:
Computability Aspects of Differential Games in Euclidian Spaces. CoRR abs/1903.00688 (2019) - [i8]Bakhadyr Khoussainov, Toru Takisaka:
Large Scale Geometries of Infinite Strings. CoRR abs/1908.03800 (2019) - 2018
- [j48]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Finitely generated semiautomatic groups. Comput. 7(2-3): 273-287 (2018) - [c49]Bakh Khoussainov:
A Journey to Computably Enumerable Structures (Tutorial Lectures). CiE 2018: 1-19 - [c48]Bakhadyr Khoussainov:
A Brief Excursion to Parity Games. DLT 2018: 24-35 - [i7]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
The isomorphism problem for tree-automatic ordinals with addition. CoRR abs/1810.13153 (2018) - 2017
- [j47]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou:
Semiautomatic Structures. Theory Comput. Syst. 61(4): 1254-1287 (2017) - [c47]Bakh Khoussainov, Toru Takisaka:
Large scale geometries of infinite strings. LICS 2017: 1-12 - [c46]Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Frank Stephan:
Deciding parity games in quasipolynomial time. STOC 2017: 252-263 - [e3]Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond:
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4 [contents] - 2016
- [j46]Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Algorithms for Multimachine Interval Scheduling Through Analysis of Idle Intervals. Algorithmica 76(4): 1160-1180 (2016) - [j45]Dmitry Berdinsky, Bakhadyr Khoussainov:
Cayley Automatic Representations of Wreath Products. Int. J. Found. Comput. Sci. 27(2): 147-160 (2016) - [j44]Ekaterina B. Fokina, Bakhadyr Khoussainov, Pavel Semukhin, Daniel Turetsky:
Linear Orders Realized by C.E. Equivalence Relations. J. Symb. Log. 81(2): 463-482 (2016) - [j43]Alex Gavryushkin, Bakhadyr Khoussainov, Frank Stephan:
Reducibilities among equivalence relations induced by recursively enumerable structures. Theor. Comput. Sci. 612: 137-152 (2016) - [j42]Sanjay Jain, Bakhadyr Khoussainov, Philipp Schlicht, Frank Stephan:
Tree-automatic scattered linear orders. Theor. Comput. Sci. 626: 83-96 (2016) - [c45]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Finitely Generated Semiautomatic Groups. CiE 2016: 282-291 - [c44]Bakhadyr Khoussainov:
A Quest for Algorithmically Random Infinite Structures, II. LFCS 2016: 159-173 - [c43]Bakh Khoussainov:
Quantifier Free Definability on Infinite Algebras. LICS 2016: 730-738 - [c42]Bakhadyr Khoussainov, Jiamou Liu:
Decision Problems for Finite Automata over Infinite Algebraic Structures. CIAA 2016: 3-11 - 2015
- [j41]Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic algorithms for monotonic interval scheduling problem. Theor. Comput. Sci. 562: 227-242 (2015) - [i6]Dmitry Berdinsky, Bakhadyr Khoussainov:
Cayley automatic representations of wreath products. CoRR abs/1511.01630 (2015) - 2014
- [j40]Alexander Gavruskin, Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan:
Graphs realised by r.e. equivalence relations. Ann. Pure Appl. Log. 165(7-8): 1263-1290 (2014) - [c41]Bakhadyr Khoussainov:
A quest for algorithmically random infinite structures. CSL-LICS 2014: 56:1-56:9 - [c40]Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou:
Semiautomatic Structures. CSR 2014: 204-217 - [c39]Dmitry Berdinsky, Bakhadyr Khoussainov:
On Automatic Transitive Graphs. Developments in Language Theory 2014: 1-12 - [c38]Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Interval Scheduling for Multiple Machines. ISAAC 2014: 235-246 - [i5]Alex Gavryushkin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamic Algorithms for Interval Scheduling on a Single Machine. CoRR abs/1412.8005 (2014) - 2013
- [j39]Xinfeng Ye, Bakh Khoussainov:
Fine-grained access control for cloud computing. Int. J. Grid Util. Comput. 4(2/3): 160-168 (2013) - [c37]Xinfeng Ye, Jupeng Zheng, Bakh Khoussainov:
A Robust Service Recommendation Scheme. IEEE SCC 2013: 73-80 - [c36]Alexander Gavruskin, Bakhadyr Khoussainov:
On Decidable and Computable Models of Theories. CiE 2013: 200-209 - [c35]Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu:
Dynamising Interval Scheduling: The Monotonic Case. IWOCA 2013: 178-191 - [c34]Xinfeng Ye, Jupeng Zheng, Bakh Khoussainov:
A Game Theory-Based Approach to Service Rating. PDCAT 2013: 163-170 - [c33]Yi Chen, Bakh Khoussainov, Xinfeng Ye:
A Game Theoretic Approach to Service Discovery and Selection. SMC 2013: 4072-4079 - 2012
- [b1]Bakhadyr Khoussainov, Nodira Khoussainova:
Lectures on Discrete Mathematics for Computer Science. Algebra and Discrete Mathematics 3, World Scientific 2012, ISBN 978-981-4340-50-2, pp. 1-364 - [j38]Bakhadyr Khoussainov, Tomasz Kowalski:
Computable Isomorphisms of Boolean Algebras with Operators. Stud Logica 100(3): 481-496 (2012) - [c32]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
Solving infinite games on trees with back-edges. CATS 2012: 113-122 - [c31]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
On State Complexity of Finite Word and Tree Languages. Developments in Language Theory 2012: 392-403 - [c30]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
Finite Automata over Structures - (Extended Abstract). TAMC 2012: 373-384 - [e2]Michael J. Dinneen, Bakhadyr Khoussainov, André Nies:
Computation, Physics and Beyond - International Workshop on Theoretical Computer Science, WTCS 2012, Dedicated to Cristian S. Calude on the Occasion of His 60th Birthday, Auckland, New Zealand, February 21-24, 2012, Revised Selected and Invited Papers. Lecture Notes in Computer Science 7160, Springer 2012, ISBN 978-3-642-27653-8 [contents] - 2011
- [j37]Aniruddh Gandhi, Bakhadyr Khoussainov, Jiamou Liu:
Efficient Algorithms for Games Played on Trees with Back-edges. Fundam. Informaticae 111(4): 391-412 (2011) - [c29]Aniruddh Gandhi, Nan Rosemary Ke, Bakhadyr Khoussainov:
Descriptional Complexity of Determinization and Complementation for Finite Automata. CATS 2011: 95-104 - [c28]Imran Khaliq, Bakhadyr Khoussainov, Jiamou Liu:
Extracting Winning Strategies in Update Games. CiE 2011: 142-151 - [c27]Bakhadyr Khoussainov:
Automatic Structures and Groups. LATA 2011: 22-40 - [i4]Olga Kharlampovich, Bakhadyr Khoussainov, Alexei Miasnikov:
From automatic structures to automatic groups. CoRR abs/1107.3645 (2011) - 2010
- [j36]Bakhadyr Khoussainov, Antonio Montalbán:
A computable Alef0-categorical structure whose theory computes true arithmetic. J. Symb. Log. 75(2): 728-740 (2010) - [c26]Bakhadyr Khoussainov, Andrei S. Morozov:
On Index Sets of Some Properties of Computable Algebras. CiE 2010: 219-228
2000 – 2009
- 2009
- [j35]Douglas A. Cenzer, Barbara F. Csima, Bakhadyr Khoussainov:
Linear orders with distinguished function symbol. Arch. Math. Log. 48(1): 63-76 (2009) - [j34]Bakhadyr Khoussainov, Jiamou Liu:
On complexity of Ehrenfeucht-Fraïssé games. Ann. Pure Appl. Log. 161(3): 404-415 (2009) - [j33]Bakhadyr Khoussainov, Mia Minnes:
Model-theoretic complexity of automatic structures. Ann. Pure Appl. Log. 161(3): 416-426 (2009) - [j32]Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes:
Unary automatic graphs: an algorithmic perspective. Math. Struct. Comput. Sci. 19(1): 133-152 (2009) - [c25]Bakhadyr Khoussainov, Jiamou Liu, Imran Khaliq:
A Dynamic Algorithm for Reachability Games Played on Trees. MFCS 2009: 477-488 - 2008
- [j31]Bakhadyr Khoussainov, Frank Stephan, Yue Yang:
Computable categoricity and the Ershov hierarchy. Ann. Pure Appl. Log. 156(1): 86-95 (2008) - [j30]Bakhadyr Khoussainov, Anil Nerode:
Open Questions in the Theory of Automatic Structures. Bull. EATCS 94: 181-204 (2008) - [c24]Michael Brough, Bakhadyr Khoussainov, Peter Nelson:
Sequential Automatic Algebras. CiE 2008: 84-93 - [c23]Barbara F. Csima, Bakhadyr Khoussainov, Jiamou Liu:
Computable Categoricity of Graphs with Finite Components. CiE 2008: 139-148 - [c22]Barbara F. Csima, Bakhadyr Khoussainov:
When Is Reachability Intrinsically Decidable?. Developments in Language Theory 2008: 216-227 - [c21]Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalbán, André Nies:
From Automatic Structures to Borel Structures. LICS 2008: 431-441 - [c20]Bakhadyr Khoussainov, Mia Minnes:
Model Theoretic Complexity of Automatic Structures (Extended Abstract). TAMC 2008: 514-525 - [c19]Bakhadyr Khoussainov, Jiamou Liu, Mia Minnes:
Unary Automatic Graphs: An Algorithmic Perspective. TAMC 2008: 542-553 - [e1]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - 2007
- [j29]Bakhadyr Khoussainov, Pavel Semukhin, Frank Stephan:
Applications of Kolmogorov complexity to computable model theory. J. Symb. Log. 72(3): 1041-1054 (2007) - [j28]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. Log. Methods Comput. Sci. 3(2) (2007) - [c18]Bakhadyr Khoussainov, Jiamou Liu:
On Complexity of Ehrenfeucht-Fraïssé Games. LFCS 2007: 293-309 - [i3]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007 - [i2]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi:
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007 - [i1]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. CoRR abs/cs/0703064 (2007) - 2006
- [j27]Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin:
P01-Presentations of Algebras. Arch. Math. Log. 45(6): 769-781 (2006) - [j26]Bakhadyr Khoussainov, Denis R. Hirschfeldt, Pavel Semukhin:
An Uncountably Categorical Theory Whose Only Computably Presentable Model Is Saturated. Notre Dame J. Formal Log. 47(1): 63-71 (2006) - 2005
- [j25]Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman:
Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. 15(3): 437-454 (2005) - [j24]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
Automatic linear orders and trees. ACM Trans. Comput. Log. 6(4): 675-700 (2005) - [c17]Bakhadyr Khoussainov, Sasha Rubin:
Decidability of Term Algebras Extending Partial Algebras. CSL 2005: 292-308 - [c16]Roopak Sinha, Partha S. Roop, Bakhadyr Khoussainov:
Adaptive Verification using Forced Simulation. FESCA@ETAPS 2005: 171-197 - 2004
- [c15]Bakhadyr Khoussainov, André Nies, Sasha Rubin, Frank Stephan:
Automatic Structures: Richness and Limitations. LICS 2004: 44-53 - [c14]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
Definability and Regularity in Automatic Structures. STACS 2004: 440-451 - 2003
- [j23]Bakhadyr Khoussainov, Sasha Rubin:
Automatic Structures: Overview and Future Directions. J. Autom. Lang. Comb. 8(2): 287-301 (2003) - [j22]Michael J. Dinneen, Bakhadyr Khoussainov:
Update games and update networks. J. Discrete Algorithms 1(1): 53-65 (2003) - [j21]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore:
A computably categorical structure whose expansion by a constant has infinite computable dimension. J. Symb. Log. 68(4): 1199-1241 (2003) - [j20]Bakhadyr Khoussainov:
On algebraic and logical specifications of classes of regular languages. Theor. Comput. Sci. 298(2): 325-346 (2003) - [c13]Bakhadyr Khoussainov:
On Algebraic Specifications of Abstract Data Types. CSL 2003: 299-313 - [c12]Bakhadyr Khoussainov:
Finite State Strategies in One Player McNaughton Games. DMTCS 2003: 203-214 - [c11]Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan:
On Automatic Partial Orders. LICS 2003: 168-177 - 2002
- [j19]Denis R. Hirschfeldt, Bakhadyr Khoussainov, Richard A. Shore, Arkadii M. Slinko:
Degree spectra and computable dimensions in algebraic structures. Ann. Pure Appl. Log. 115(1-3): 71-113 (2002) - [j18]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov:
Relaxed Update and Partition Network Games. Fundam. Informaticae 49(4): 301-312 (2002) - [c10]Hajime Ishihara, Bakhadyr Khoussainov, Sasha Rubin:
Some Results on Automatic Structures. LICS 2002: 235- - [c9]Hajime Ishihara, Bakhadyr Khoussainov:
Complexity of Some Infinite Games Played on Finite Graphs. WG 2002: 270-281 - 2001
- [j17]Bakhadyr Khoussainov, Sasha Rubin:
Graphs with Automatic Presentations over a Unary Alphabet. J. Autom. Lang. Comb. 6(4): 467-480 (2001) - [j16]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively enumerable reals and Chaitin Omega numbers. Theor. Comput. Sci. 255(1-2): 125-149 (2001) - [c8]Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov:
On Game-Theoretic Models of Networks. ISAAC 2001: 550-561 - 2000
- [j15]Bakhadyr Khoussainov:
On Computability Theoretic Properties of Structures and Their Cartesian Products. Math. Log. Q. 46(4): 467-475 (2000) - [j14]Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Finite nondeterministic automata: Simulation and minimality. Theor. Comput. Sci. 242(1-2): 219-235 (2000) - [c7]Michael J. Dinneen, Bakhadyr Khoussainov:
Update Networks and Their Routing Strategies. WG 2000: 127-136 - [c6]Bakhadyr Khoussainov:
Algebraic constraints, automata, and regular languages. CATS 2000: 104-117
1990 – 1999
- 1999
- [j13]Bakhadyr Khoussainov, Richard A. Shore:
Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families". Ann. Pure Appl. Log. 98(1-3): 297-298 (1999) - [j12]Peter Cholak, Sergei S. Goncharov, Bakhadyr Khoussainov, Richard A. Shore:
Computably Categorical Structures and Expansions by Constants. J. Symb. Log. 64(1): 13-37 (1999) - 1998
- [j11]Bakhadyr Khoussainov:
Randomness, Computability, and Algebraic Specifications. Ann. Pure Appl. Log. 91(1): 1-15 (1998) - [j10]Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode:
Decidable Kripke Models of Intuitionistic Theories. Ann. Pure Appl. Log. 93(1-3): 115-123 (1998) - [j9]Bakhadyr Khoussainov, Richard A. Shore:
Computable Isomorphisms, Degree Spectra of Relations, and Scott Families. Ann. Pure Appl. Log. 93(1-3): 153-193 (1998) - [j8]Hajime Ishihara, Bakhadyr Khoussainov, Anil Nerode:
Computable Kripke Models and Intermediate Logics. Inf. Comput. 143(2): 205-230 (1998) - [j7]Bakhadyr Khoussainov, Alexander Yakhnis, Vladimir Yakhnis:
Games with Unknown Past. Math. Log. Q. 44: 185-204 (1998) - [c5]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov, Yongge Wang:
Recursively Enumerable Reals and Chaitin Omega Numbers. STACS 1998: 596-606 - 1997
- [j6]Cristian Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Ann. Pure Appl. Log. 90(1-3): 263-276 (1997) - [j5]Cristian Calude, Peter Hertling, Bakhadyr Khoussainov:
Do the Zeros of Riemann's Zeta-Function Form a Random Sequence? Bull. EATCS 62 (1997) - [j4]Douglas S. Bridges, Cristian Calude, Michael J. Dinneen, Bakhadyr Khoussainov:
Logic in Computer Science. J. Univers. Comput. Sci. 3(11): 1133 (1997) - [j3]Hajime Ishihara, Bakhadyr Khoussainov:
Effectiveness of the Completeness Theorem for an Intermediate Logic. J. Univers. Comput. Sci. 3(11): 1255-1265 (1997) - [j2]Bakhadyr Khoussainov, André Nies, Richard A. Shore:
Computable Models of Theories with Few Models. Notre Dame J. Formal Log. 38(2): 165-178 (1997) - [c4]Cristian S. Calude, Elena Calude, Bakhadyr Khoussainov:
Deterministic Automata: Simulation, Universality and Minimality. Extended Abstract. Developments in Language Theory 1997: 519-537 - 1996
- [c3]Bakhadyr Khoussainov, Richard A. Shore:
Categoricity and Scott Families. DMTCS 1996: 299-307 - 1994
- [j1]Bakhadyr Khoussainov:
Recursive Unary Algebras and Trees. Ann. Pure Appl. Log. 67(1-3): 213-268 (1994) - [c2]Bakhadyr Khoussainov, Anil Nerode:
Automatic Presentations of Structures. LCC 1994: 367-392 - [c1]Bakhadyr Khoussainov, Anil Nerode:
The Notion of Rank and Games. LFCS 1994: 204-217
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
