Abuzer Yakaryilmaz
Abuzer Yakaryilmaz
Подтвержден адрес электронной почты в домене lu.lv - Главная страница
НазваниеПроцитированоГод
Unbounded-error quantum computation with small space bounds
A Yakaryılmaz, ACC Say
Information and Computation 209 (6), 873-892, 2011
862011
Succinctness of two-way probabilistic and quantum finite automata
A Yakaryilmaz, AC Say
arXiv preprint arXiv:0903.0050, 2009
622009
Superiority of exact quantum automata for promise problems
A Ambainis, A Yakaryılmaz
Information Processing Letters 112 (7), 289-291, 2012
502012
Languages recognized by nondeterministic quantum finite automata
A Yakaryilmaz, AC Say
arXiv preprint arXiv:0902.2081, 2009
482009
Quantum finite automata: A modern introduction
ACC Say, A Yakaryılmaz
Computing with New Resources, 208-222, 2014
392014
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
332014
Languages recognized with unbounded error by quantum finite automata
A Yakaryilmaz, ACC Say
International Computer Science Symposium in Russia, 356-367, 2009
292009
Quantum computation with write-only memory
A Yakaryılmaz, R Freivalds, ACC Say, R Agadzanyan
Natural Computing 11 (1), 81-94, 2012
28*2012
Automata and quantum computing
A Ambainis, A Yakaryılmaz
arXiv preprint arXiv:1507.01988, 2015
272015
Implications of quantum automata for contextuality
J Rashid, A Yakaryılmaz
International Conference on Implementation and Application of Automata, 318-331, 2014
232014
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
222016
Superiority of one-way and realtime quantum machines∗∗∗
A Yakaryılmaz
RAIRO-Theoretical Informatics and Applications 46 (4), 615-641, 2012
222012
One-counter verifiers for decidable languages
A Yakaryılmaz
International Computer Science Symposium in Russia, 366-377, 2013
192013
Efficient probability amplification in two-way quantum finite automata
A Yakaryılmaz, ACC Say
Theoretical Computer Science 410 (20), 1932-1941, 2009
192009
Classical automata on promise problems
V Geffert, A Yakaryılmaz
International Workshop on Descriptional Complexity of Formal Systems, 126-137, 2014
172014
A new family of nonstochastic languages
R nš Freivaldsa, A Yakaryılmazb, ACC Sayb
Information Processing Letters 110, 410-413, 2010
172010
Public qubits versus private coins
A Yakaryılmaz
The Proceedings of Workshop on Quantum and Classical Complexity, 45-60, 2012
142012
Affine computation and affine automaton
A Díaz-Caro, A Yakaryılmaz
International Computer Science Symposium in Russia, 146-160, 2016
132016
Unary probabilistic and quantum automata on promise problems
A Gainutdinova, A Yakaryılmaz
International Conference on Developments in Language Theory, 252-263, 2015
132015
Proving the power of postselection
A Yakaryılmaz, AC Say
Fundamenta Informaticae 123 (1), 107-134, 2013
132013
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20