Aida Gainutdinova

According to our database, Aida Gainutdinova authored at least 10 papers between 2000 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

New results on classical and quantum counter automata.

Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova

Discret. Math. Theor. Comput. Sci., 2019

2018

Unary probabilistic and quantum automata on promise problems.

Aida Gainutdinova, Abuzer Yakaryilmaz

Quantum Inf. Process., 2018

2017

Nondeterministic Unitary OBDDs.

Aida Gainutdinova, Abuzer Yakaryilmaz

Proceedings of the Computer Science - Theory and Applications, 2017

2014

Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.

Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz

Proceedings of the Descriptional Complexity of Formal Systems, 2014

2007

Classical Simulation Complexity of Quantum Branching Programs.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

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

Complexity of Quantum Uniform and Nonuniform Automata.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2003

Classical Simulation Complexity of Quantum Machines.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2001

On Computational Power of Quantum Branching Programs.

Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

2000

On the Lower Bounds for One-Way Quantum Automata.

Farid M. Ablayev, Aida Gainutdinova

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000