Aida Gainutdinova

14 papers B 3C 3Misc 1Journal 6Unranked 1
YearRankTypeTitle / Venue / Authors
2019 J jnl
New results on classical and quantum counter automata.
Discret. Math. Theor. Comput. Sci.
Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova
2018 J jnl
Unary probabilistic and quantum automata on promise problems.
Quantum Inf. Process.
Aida Gainutdinova, Abuzer Yakaryilmaz
2017 Misc conf
Nondeterministic Unitary OBDDs.
CSR
Aida Gainutdinova, Abuzer Yakaryilmaz
2016 J jnl
Nondeterministic unitary OBDDs.
CoRR
Aida Gainutdinova, Abuzer Yakaryilmaz
2015 C conf
Unary Probabilistic and Quantum Automata on Promise Problems.
DLT
Aida Gainutdinova, Abuzer Yakaryilmaz
2015 J jnl
Unary probabilistic and quantum automata on promise problems.
CoRR
Aida Gainutdinova, Abuzer Yakaryilmaz
2014 — conf
Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs.
DCFS
Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
2014 J jnl
Very narrow quantum OBDDs and width hierarchies for classical OBDDs.
CoRR
Farid M. Ablayev, Aida Gainutdinova, Kamil Khadiev, Abuzer Yakaryilmaz
2007 C conf
Classical Simulation Complexity of Quantum Branching Programs.
LATA
Farid M. Ablayev, Aida Gainutdinova
2005 C conf
Complexity of Quantum Uniform and Nonuniform Automata.
Developments in Language Theory
Farid M. Ablayev, Aida Gainutdinova
2005 J jnl
On the computational power of probabilistic and quantum branching program.
Inf. Comput.
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Chris Pollett
2003 B conf
Classical Simulation Complexity of Quantum Machines.
FCT
Farid M. Ablayev, Aida Gainutdinova
2001 B conf
On Computational Power of Quantum Branching Programs.
FCT
Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski
2000 B conf
On the Lower Bounds for One-Way Quantum Automata.
MFCS
Farid M. Ablayev, Aida Gainutdinova