 | 2012 |
| 8 |  | Aleksandrs Belovs:
Span programs for functions with constant-sized 1-certificates: extended abstract.
STOC 2012: 77-84 |
| 7 |  | Aleksandrs Belovs:
Adversary Lower Bound for Element Distinctness
CoRR abs/1204.5074: (2012) |
| 2011 |
| 6 |  | Aleksandrs Belovs:
Span-program-based quantum algorithm for the rank problem
CoRR abs/1103.0842: (2011) |
| 2008 |
| 5 |  | Aleksandrs Belovs,
Juris Smotrovs:
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases.
MMICS 2008: 50-69 |
| 4 |  | Aleksandrs Belovs:
Some Algebraic Properties of Machine Poset of Infinite Words.
ITA 42(3): 451-466 (2008) |
| 2007 |
| 3 |  | Aleksandrs Belovs,
Ansis Rosmanis,
Juris Smotrovs:
Multi-letter Reversible and Quantum Finite Automata.
Developments in Language Theory 2007: 60-71 |
| 2006 |
| 2 |  | 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 |