Follow
Abuzer Yakaryilmaz
Abuzer Yakaryilmaz
Verified email at lu.lv - Homepage
Title
Cited by
Cited by
Year
Unbounded-error quantum computation with small space bounds
A Yakaryılmaz, ACC Say
Information and Computation 209 (6), 873-892, 2011
1002011
Succinctness of two-way probabilistic and quantum finite automata
A Yakaryilmaz, ACC Say
Discrete Mathematics & Theoretical Computer Science 12, 2010
802010
Quantum finite automata: A modern introduction
ACC Say, A Yakaryılmaz
Computing with New Resources: Essays Dedicated to Jozef Gruska on the …, 2014
772014
Superiority of exact quantum automata for promise problems
A Ambainis, A Yakaryılmaz
Information Processing Letters 112 (7), 289-291, 2012
722012
Automata and quantum computing
A Ambainis, A Yakaryılmaz
arXiv preprint arXiv:1507.01988, 2015
682015
Languages recognized by nondeterministic quantum finite automata
A Yakaryilmaz, AC Say
arXiv preprint arXiv:0902.2081, 2009
642009
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
462014
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
412016
Quantum computation with write-only memory
A Yakaryılmaz, R Freivalds, ACC Say, R Agadzanyan
Natural Computing 11, 81-94, 2012
33*2012
Languages recognized with unbounded error by quantum finite automata
A Yakaryilmaz, ACC Say
International Computer Science Symposium in Russia, 356-367, 2009
332009
Magic coins are useful for small-space quantum machines
AC Say, A Yakaryilmaz
arXiv preprint arXiv:1411.7647, 2014
232014
Implications of quantum automata for contextuality
J Rashid, A Yakaryılmaz
Implementation and Application of Automata: 19th International Conference …, 2014
232014
Superiority of one-way and realtime quantum machines∗∗∗
A Yakaryılmaz
RAIRO-Theoretical Informatics and Applications 46 (4), 615-641, 2012
232012
Efficient probability amplification in two-way quantum finite automata
A Yakaryılmaz, ACC Say
Theoretical Computer Science 410 (20), 1932-1941, 2009
212009
Affine computation and affine automaton
A Díaz-Caro, A Yakaryılmaz
Computer Science–Theory and Applications: 11th International Computer …, 2016
202016
Public qubits versus private coins
A Yakaryılmaz
The Proceedings of Workshop on Quantum and Classical Complexity, 45-60, 2013
202013
A new family of nonstochastic languages.
R Freivalds, A Yakaryilmaz, ACC Say
Inf. Process. Lett. 110 (10), 410-413, 2010
192010
Language recognition power and succinctness of affine automata
M Villagra, A Yakaryılmaz
Natural Computing 17, 283-293, 2018
182018
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
182018
Classical automata on promise problems
V Geffert, A Yakaryılmaz
Descriptional Complexity of Formal Systems: 16th International Workshop …, 2014
182014
The system can't perform the operation now. Try again later.
Articles 1–20