On the Lower Bounds for One-Way Quantum Automata. - Farid M. Ablayev; Aida Gainutdinova (MFCS, 2000)

On Computational Power of Quantum Branching Programs. - Farid M. Ablayev; Aida Gainutdinova; Marek Karpinski (FCT, 2001)

Classical Simulation Complexity of Quantum Machines. - Farid M. Ablayev; Aida Gainutdinova (FCT, 2003)

Complexity of Quantum Uniform and Nonuniform Automata. - Farid M. Ablayev; Aida Gainutdinova (Developments in Language Theory, 2005)

On the computational power of probabilistic and quantum branching program. - Farid M. Ablayev; Aida Gainutdinova; Marek Karpinski; Cristopher Moore; Chris Pollett (Inf. Comput., 2005)

Classical Simulation Complexity of Quantum Branching Programs. - Farid M. Ablayev; Aida Gainutdinova (LATA, 2007)

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs. - Farid M. Ablayev; Aida Gainutdinova; Kamil Khadiev; Abuzer Yakaryilmaz (DCFS, 2014)

Nondeterministic Unitary OBDDs. - Aida Gainutdinova; Abuzer Yakaryilmaz (CSR, 2017)

Unary probabilistic and quantum automata on promise problems. - Aida Gainutdinova; Abuzer Yakaryilmaz (Quantum Inf. Process., 2018)

New results on classical and quantum counter automata. - Masaki Nakanishi; Abuzer Yakaryilmaz; Aida Gainutdinova (Discret. Math. Theor. Comput. Sci., 2019)