![]() |
| 2007 | ||
|---|---|---|
| 3 | EE | Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs: Multi-letter Reversible and Quantum Finite Automata. Developments in Language Theory 2007: 60-71 |
| 2006 | ||
| 2 | EE | Aleksandrs Belovs: Non-intersecting Complexity. SOFSEM 2006: 158-165 |
| 2003 | ||
| 1 | Andris Ambainis, Uldis Barbans, Agnese Belousova, Aleksandrs Belovs, Ilze Dzelme, Girts Folkmanis, Rusins Freivalds, Peteris Ledins, Rihards Opmanis, Agnis Skuskovniks: Size of Quantum Versus Deterministic Finite Automata. VLSI 2003: 303-308 | |
| 1 | Andris Ambainis | [1] |
| 2 | Uldis Barbans | [1] |
| 3 | Agnese Belousova | [1] |
| 4 | Ilze Dzelme | [1] |
| 5 | Girts Folkmanis | [1] |
| 6 | Rusins Freivalds | [1] |
| 7 | Peteris Ledins | [1] |
| 8 | Rihards Opmanis | [1] |
| 9 | Ansis Rosmanis | [3] |
| 10 | Agnis Skuskovniks | [1] |
| 11 | Juris Smotrovs | [3] |