| Unbounded-error quantum computation with small space bounds A Yakaryılmaz, ACC Say Information and Computation 209 (6), 873-892, 2011 | 101 | 2011 |
| Succinctness of two-way probabilistic and quantum finite automata A Yakaryilmaz, ACC Say Discrete Mathematics & Theoretical Computer Science 12, 2010 | 81 | 2010 |
| Quantum finite automata: A modern introduction ACC Say, A Yakaryılmaz Computing with New Resources: Essays Dedicated to Jozef Gruska on the …, 2014 | 79 | 2014 |
| Superiority of exact quantum automata for promise problems A Ambainis, A Yakaryılmaz Information Processing Letters 112 (7), 289-291, 2012 | 72 | 2012 |
| Languages recognized by nondeterministic quantum finite automata A Yakaryilmaz, AC Say arXiv preprint arXiv:0902.2081, 2009 | 64 | 2009 |
| Automata and quantum computing A Ambainis, A Yakaryılmaz arXiv preprint arXiv:1507.01988, 2015 | 58 | 2015 |
| Very narrow quantum OBDDs and width hierarchies for classical OBDDs F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz Descriptional Complexity of Formal Systems: 16th International Workshop …, 2014 | 46 | 2014 |
| Very narrow quantum OBDDs and width hierarchies for classical OBDDs F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz Lobachevskii Journal of Mathematics 37, 670-682, 2016 | 42 | 2016 |
| Languages recognized with unbounded error by quantum finite automata A Yakaryilmaz, ACC Say International Computer Science Symposium in Russia, 356-367, 2009 | 34 | 2009 |
| Quantum computation with write-only memory A Yakaryılmaz, R Freivalds, ACC Say, R Agadzanyan Natural Computing 11, 81-94, 2012 | 33* | 2012 |
| Magic coins are useful for small-space quantum machines AC Say, A Yakaryilmaz arXiv preprint arXiv:1411.7647, 2014 | 23 | 2014 |
| Implications of quantum automata for contextuality J Rashid, A Yakaryılmaz Implementation and Application of Automata: 19th International Conference …, 2014 | 23 | 2014 |
| Superiority of one-way and realtime quantum machines∗∗∗ A Yakaryılmaz RAIRO-Theoretical Informatics and Applications 46 (4), 615-641, 2012 | 23 | 2012 |
| Efficient probability amplification in two-way quantum finite automata A Yakaryılmaz, ACC Say Theoretical Computer Science 410 (20), 1932-1941, 2009 | 22 | 2009 |
| Public qubits versus private coins A Yakaryılmaz The Proceedings of Workshop on Quantum and Classical Complexity, 45-60, 2013 | 21 | 2013 |
| Affine computation and affine automaton A Díaz-Caro, A Yakaryılmaz Computer Science–Theory and Applications: 11th International Computer …, 2016 | 20 | 2016 |
| A new family of nonstochastic languages. R Freivalds, A Yakaryilmaz, ACC Say Inf. Process. Lett. 110 (10), 410-413, 2010 | 19 | 2010 |
| Automata and quantum computing A Ambainis, A Yakaryılmaz | 18 | 2021 |
| Language recognition power and succinctness of affine automata M Villagra, A Yakaryılmaz Natural Computing 17, 283-293, 2018 | 18 | 2018 |
| Error-free affine, unitary, and probabilistic OBDDs R Ibrahimov, K Khadiev, K Prūsis, A Yakaryılmaz Descriptional Complexity of Formal Systems: 20th IFIP WG 1.02 International …, 2018 | 18 | 2018 |
Cem SayBoğaziçi ÜniversitesiEmail verificata su boun.edu.tr
