| 2008 |
|---|
| 9 | EE | Aleksandrs Belovs,
Juris Smotrovs:
A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases.
MMICS 2008: 50-69 |
| 2007 |
|---|
| 8 | EE | Aleksandrs Belovs,
Ansis Rosmanis,
Juris Smotrovs:
Multi-letter Reversible and Quantum Finite Automata.
Developments in Language Theory 2007: 60-71 |
| 2001 |
|---|
| 7 | EE | Kalvis Apsitis,
Rusins Freivalds,
Raimonds Simanovskis,
Juris Smotrovs:
Closedness properties in ex-identification.
Theor. Comput. Sci. 268(2): 367-393 (2001) |
| 1998 |
|---|
| 6 | EE | Kalvis Apsitis,
Rusins Freivalds,
Raimonds Simanovskis,
Juris Smotrovs:
Closedness Properties in EX-Identification of Recursive Functions.
ALT 1998: 46-60 |
| 1997 |
|---|
| 5 | | Andris Ambainis,
Kalvis Apsitis,
Cristian Calude,
Rusins Freivalds,
Marek Karpinski,
Tomas Larfeldt,
Iveta Sala,
Juris Smotrovs:
Effects of Kolmogorov Complexity Present in Inductive Inference as Well.
ALT 1997: 244-259 |
| 4 | | Juris Smotrovs:
Closedness Properties in Team Learning of Recursive Functions.
EuroCOLT 1997: 79-93 |
| 1996 |
|---|
| 3 | | Kalvis Apsitis,
Rusins Freivalds,
Raimonds Simanovskis,
Juris Smotrovs:
Unions of identifiable families of languages.
ICGI 1996: 48-58 |
| 1994 |
|---|
| 2 | | Andris Ambainis,
Juris Smotrovs:
Enumerable Classes of Total Recursive Functions: Complexity of Inductive Inference.
AII/ALT 1994: 10-25 |
| 1992 |
|---|
| 1 | | Kalvis Apsitis,
Rusins Freivalds,
Martins Krikis,
Raimonds Simanovskis,
Juris Smotrovs:
Unions of Identifiable Classes of Total Recursive Functions.
AII 1992: 99-107 |
