| 2024 | UAI | Multi-layer random features and the approximation power of neural networks. | Rustem Takhanov |
| 2024 | SOFSEM | On the Induced Problem for Fixed-Template CSPs. | Rustem Takhanov |
| 2023 | AAAI | Hardness of Learning AES Key (Student Abstract). | Artur Pak, Sultan Nurmukhamedov, Rustem Takhanov, Zhenisbek Assylbekov |
| 2023 | ACML | Intractability of Learning the Discrete Logarithm with Gradient-Based Methods. | Rustem Takhanov, Maxat Tezekbayev, Artur Pak, Arman Bolatov, Zhibek Kadyrsizova, Zhenisbek Assylbekov |
| 2020 | AAAI | Semantics- and Syntax-Related Subvectors in the Skip-Gram Embeddings (Student Abstract). | Maxat Tezekbayev, Zhenisbek Assylbekov, Rustem Takhanov |
| 2020 | IJCAI | Context Vectors Are Reflections of Word Vectors in Half the Dimensions (Extended Abstract). | Zhenisbek Assylbekov, Rustem Takhanov |
| 2019 | CICLING | Initial Explorations on Chaotic Behaviors of Recurrent Neural Networks. | Bagdat Myrzakhmetov, Rustem Takhanov, Zhenisbek Assylbekov |
| 2018 | COLING | Reproducing and Regularizing the SCRN Model. | Olzhas Kabdolov, Zhenisbek Assylbekov, Rustem Takhanov |
| 2018 | NAACL | Reusing Weights in Subword-Aware Neural Language Models. | Zhenisbek Assylbekov, Rustem Takhanov |
| 2017 | EMNLP | Syllable-aware Neural Language Models: A Failure to Beat Character-aware Ones. | Zhenisbek Assylbekov, Rustem Takhanov, Bagdat Myrzakhmetov, Jonathan North Washington |
| 2017 | ICONIP | Patterns Versus Characters in Subword-Aware Neural Language Modeling. | Rustem Takhanov, Zhenisbek Assylbekov |
| 2017 | ISAAC | Hybrid VCSPs with Crisp and Valued Conservative Templates. | Rustem Takhanov |
| 2015 | ISAAC | Effectiveness of Structural Restrictions for Hybrid CSPs. | Vladimir Kolmogorov, Michal Rolnek, Rustem Takhanov |
| 2013 | ICML | Inference algorithms for pattern-based CRFs on sequence data. | Rustem Takhanov, Vladimir Kolmogorov |
| 2010 | COCOON | Extensions of the Minimum Cost Homomorphism Problem. | Rustem Takhanov |
| 2010 | STACS | A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem. | Rustem Takhanov |