Complexity bounds on some fundamental computational problems for quantum branching programs. - Airat Khasianov (2005)

On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions. - Farid M. Ablayev; Airat Khasianov; Alexander Vasiliev (Electron. Colloquium Comput. Complex., 2008)

Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem. - Airat Khasianov (Electron. Colloquium Comput. Complex., 2010)

Modified Spline-based Path Planning for Autonomous Ground Vehicle. - Evgeni Magid; Roman Lavrenov; Airat Khasianov (ICINCO (2), 2017)

Combining Voronoi Graph and Spline-Based Approaches for a Mobile Robot Path Planning. - Evgeni Magid; Roman Lavrenov; Mikhail M. Svinin; Airat Khasianov (ICINCO (Selected Papers), 2017)

Применение инструментов интеллектуального анализа текстов в юриспруденции (Text Mining Tools in Legal Documents). - Denis Zuev; Anton A. Marchenko; Airat Khasianov (DAMDID/RCDL, 2017)