ABUZER YAKARYILMAZ University of Latvia Faculty of Computing Raina bulv. 19, Riga, LV-1586, Latvia abuzer at lu.lv +371 67034353

Research Interest

Publications

• Classical and quantum computation with small space bounds (Advisor: A. C. Cem Say)
  Bogazici University (Istanbul), 2011 (Defened in November 2010). [arXiv:1102.0378]
  

• Automata and quantum computing, A. Ambainis, A. Yakaryilmaz.
  Automata: from Mathematics to Applications, 2012 (in preparation).

1. Turing-equivalent automata using a fixed-size quantum memory, A. Yakaryilmaz, 2012 (submitted).
   A preliminary report on some contents of this paper is [arXiv:1101.5227].
2. Finite state verifiers with constant randomness, A. C. C. Say, A. Yakaryilmaz. [arXiv:1102.2719]
   Accepted to CiE2012.
3. Probabilistic and quantum finite automata with postselection, A. Yakaryilmaz, A. C. C. Say. [arXiv:1102.0666]
   A preliminary version of this paper appeared in the Proceedings of Randomized and Quantum Computation (satellite workshop of MFCS and CSL 2010), pages 14-24, 2010.
4. Tight bounds for the space complexity of nonregular language recognition by real-time machines , A. Yakaryilmaz, A. C. C. Say. [arXiv:1108.2613]

1. Superiority of exact quantum automata for promise problems, A. Ambainis, A. Yakaryilmaz.
   Information Processing Letters, Vol 112, No. 7, pp. 289-291, 2012. [doi:10.1016/j.ipl.2012.01.001] [arXiv:1101.3837]
2. Quantum computation with write-only memory, A. Yakaryilmaz, R. Freivalds, A. C. C. Say, R. Agadzanyan.
   Natural Computing, Vol 11, No. 1, pp. 81-94, 2012. [doi:10.1007/s11047-011-9270-0] [arXiv:1011.1201]
3. Quantum Counter Automata, A. C. C. Say, A. Yakaryilmaz.
   International Journal of Foundations of Computer Science (Accepted). [arXiv:1105.0165]
   A preliminary version of this paper appeared in the Proceedings of Randomized and Quantum Computation (satellite workshop of MFCS and CSL 2010), pages 25-34, 2010.
4. Unbounded-error quantum computation with small space bounds, A. Yakaryilmaz, A. C. C. Say.
   Information and Computation, Vol 209, No. 6, pp. 873-892, 2011. [doi:10.1016/j.ic.2011.01.008] [arXiv:1007.3624]
5. Succinctness of two-way probabilistic and quantum finite automata, A. Yakaryilmaz, A. C. C. Say.
   Discrete Mathematics & Theoretical Computer Science, Vol. 12, No. 4, pp. 19-40, 2010. [Web] [arXiv:0903.0050]
   A preliminary version of this paper was presented at AutoMathA2009 (Liege, Belgium, 2009).
6. Languages recognized by nondeterministic quantum finite automata, A. Yakaryilmaz, A. C. C. Say.
   Quantum Information and Computation, Vol. 10, No. 9-10, pp.747-770, 2010. [Web] [arXiv:0902.2081]
7. A new family of nonstochastic languages, R. Freivalds, A. Yakaryilmaz, A. C. C. Say
   Information Processing Letters, Vol. 110, No. 10, pp. 410-413, 2010. [doi:10.1016/j.ipl.2010.03.011]
8. Efficient probability amplification in two-way quantum finite automata, A. Yakaryilmaz, A. C. C. Say.
   Theoretical Computer Science, Vol. 410, No. 20, pp. 1932-1941, 2009. [doi:10.1016/j.tcs.2009.01.029] (Presented at SATA 2008)
   M.S. Thesis, Efficient Two-Way Quantum Finite State Automata, Bogazici University, Turkey, 2007.

1. Superiority of one-way and realtime quantum machines and new directions , A. Yakaryilmaz.
   NCMA2011: pp. 209-224, 2011 (Proceedings of the Third Workshop on Non-Classical Models of Automata and Applications). [arXiv:1102.3093]
   
2. Computation with narrow CTCs, A. C. C. Say, A. Yakaryilmaz.
   UC2011: LNCS Vol. 6714, pp. 201-211, 2011 (Proceedings of the 10th International Conference on Unconventional Computation). [arXiv:1102.1199]
3. Quantum computation with devices whose contents are never read, A. Yakaryilmaz, R. Freivalds, A. C. C. Say, R. Agadzanyan.
   UC2010: LNCS Vol. 6079, pp. 164-174, 2010 (Proceedings of the 9th International Conference on Unconventional Computation). [doi:10.1007/978-3-642-13523-1_18]
4. Languages recognized with unbounded error by quantum finite automata, A. Yakaryilmaz, A. C. C. Say.
   CSR2009: LNCS Vol. 5675, pp. 356-367, 2009 (Proceedings of the Fourth International Computer Science Symposium in Russia). [doi:10.1007/978-3-642-03351-3_33] [arXiv:0809.0073]

1. Quantum function computation using sublogarithmic space (poster), A. C. C. Say, A. Yakaryilmaz.
   QIP2010 (13th Workshop on Quantum Information Processing), Zurich, Switzerland, 2010. [arXiv:1009.3124]
2. Language recognition by generalized quantum finite automata with unbounded error (poster), A. Yakaryilmaz, A. C. C. Say.
   TQC2009 (4th Workshop on Theory of Quantum Computation, Communication, and Cryptography), Waterloo, Canada, 2009. [arXiv:0901.2703]

Professional Experience

Education

Scholarships