Search the dblp DataBase
Aida Gainutdinova: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Farid M. Ablayev, Aida Gainutdinova
Complexity of Quantum Uniform and Nonuniform Automata. [Citation Graph (0, 0)][DBLP]
Developments in Language Theory, 2005, pp:78-87 [Conf] - Farid M. Ablayev, Aida Gainutdinova
Classical Simulation Complexity of Quantum Machines. [Citation Graph (0, 0)][DBLP]
FCT, 2003, pp:296-302 [Conf] - Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski
On Computational Power of Quantum Branching Programs. [Citation Graph (0, 0)][DBLP]
FCT, 2001, pp:59-70 [Conf] - Farid M. Ablayev, Aida Gainutdinova
On the Lower Bounds for One-Way Quantum Automata. [Citation Graph (0, 0)][DBLP]
MFCS, 2000, pp:132-140 [Conf] - Farid M. Ablayev, Aida Gainutdinova, Marek Karpinski, Cristopher Moore, Christopher Pollett
On the computational power of probabilistic and quantum branching program. [Citation Graph (0, 0)][DBLP]
Inf. Comput., 2005, v:203, n:2, pp:145-162 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002