| Unbounded-error quantum computation with small space bounds A Yakaryılmaz, ACC Say Information and Computation 209 (6), 873-892, 2011 | 92 | 2011 |
| Succinctness of two-way probabilistic and quantum finite automata A Yakaryilmaz, AC Say arXiv preprint arXiv:0903.0050, 2009 | 68 | 2009 |
| Superiority of exact quantum automata for promise problems A Ambainis, A Yakaryılmaz Information Processing Letters 112 (7), 289-291, 2012 | 60 | 2012 |
| Languages recognized by nondeterministic quantum finite automata A Yakaryilmaz, AC Say arXiv preprint arXiv:0902.2081, 2009 | 56 | 2009 |
| Quantum finite automata: A modern introduction ACC Say, A Yakaryılmaz Computing with New Resources, 208-222, 2014 | 51 | 2014 |
| Automata and quantum computing A Ambainis, A Yakaryılmaz arXiv preprint arXiv:1507.01988, 2015 | 43 | 2015 |
| Very narrow quantum OBDDs and width hierarchies for classical OBDDs F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz International Workshop on Descriptional Complexity of Formal Systems, 53-64, 2014 | 42 | 2014 |
| Quantum computation with write-only memory A Yakaryılmaz, R Freivalds, ACC Say, R Agadzanyan Natural Computing 11 (1), 81-94, 2012 | 30* | 2012 |
| Languages recognized with unbounded error by quantum finite automata A Yakaryilmaz, ACC Say International Computer Science Symposium in Russia, 356-367, 2009 | 30 | 2009 |
| Very narrow quantum OBDDs and width hierarchies for classical OBDDs F Ablayev, A Gainutdinova, K Khadiev, A Yakaryılmaz Lobachevskii Journal of Mathematics 37 (6), 670-682, 2016 | 29 | 2016 |
| Implications of quantum automata for contextuality J Rashid, A Yakaryılmaz International Conference on Implementation and Application of Automata, 318-331, 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 |
| Magic coins are useful for small-space quantum machines AC Say, A Yakaryilmaz arXiv preprint arXiv:1411.7647, 2014 | 21 | 2014 |
| Efficient probability amplification in two-way quantum finite automata A Yakaryılmaz, ACC Say Theoretical Computer Science 410 (20), 1932-1941, 2009 | 20 | 2009 |
| Classical automata on promise problems V Geffert, A Yakaryılmaz International Workshop on Descriptional Complexity of Formal Systems, 126-137, 2014 | 19 | 2014 |
| One-counter verifiers for decidable languages A Yakaryılmaz International Computer Science Symposium in Russia, 366-377, 2013 | 19 | 2013 |
| A new family of nonstochastic languages R nš Freivaldsa, A Yakaryılmazb, ACC Sayb Information Processing Letters 110, 410-413, 2010 | 19 | 2010 |
| Public qubits versus private coins A Yakaryılmaz The Proceedings of Workshop on Quantum and Classical Complexity, 45-60, 2013 | 17 | 2013 |
| Unary probabilistic and quantum automata on promise problems A Gainutdinova, A Yakaryılmaz International Conference on Developments in Language Theory, 252-263, 2015 | 16 | 2015 |
| New results on the minimum amount of useful space Z Bednárová, V Geffert, K Reinhardt, A Yakaryilmaz International Journal of Foundations of Computer Science 27 (02), 259-281, 2016 | 15 | 2016 |
Cem SayBoğaziçi Üniversitesi確認したメール アドレス: boun.edu.tr
