Currently I am working on quantum walks, and their applications in pathfinding.

Previous studies and trainings

Since Jan 2010 : PhD in Computer Science, University of Waterloo, David R. Cheriton School of Computer Science. Supervised by John Watrous.

Jan 2008 - Dec 2009 : MMath in Computer Science, University of Waterloo, David R. Cheriton School of Computer Science. Supervised by John Watrous.

Jul, Aug 2007 : Undergraduate Research Assistant, University of Waterloo, Department of Combiantorics and Optimization. Supervised by Ashwin Nayak and Rahul Jain.

Sep 2003 - Jun 2007 : BSc in Computer Science, University of Latvia. Supervised by Rusins Freivalds. 2010.

Publications and preprints

A.Rosmanis.
"Quantum Snake Walk on Graphs."
Available at arXiv:1004.4054v1.
(As shown in the following note, is not necessary to assume Hypothesis 6 of the paper anymore for sufficiently large values of n ).

A.Belovs, A.Rosmanis, J.Smotrovs.
"Multi-letter Reversible and Quantum Finite Automata."
Proceedings of DLT '07, pages 60-71. 2007.

M.Ozlos, L.Mančinska, I.Dzelme-Bērziņa, R.Agadžanjans, A.Rosmanis.
"Principles of optimal probabilistic decision tree construction."
Proceedings of FCS '06, pages 116-122. 2006.

A.Rosmanis.
"Nondeterministic finite-state automata with a unary alphabet."
Program of the 1012th AMS Meeting, page 62. 2005.

Last modified: Apr 29, 2010