| 2008 |
|---|
| 4 | EE | Aleksandrs Belovs,
Juris Smotrovs:
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases.
MMICS 2008: 50-69 |
| 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 |
