| |
| 2005 | ||
|---|---|---|
| 2 | Laura Mancinska, Maris Ozols, Renate Praude, Agnese Zalcmane: Limitations of Non-Deterministic Finite Automata Imposed by One Letter Input Alphabet. FCS 2005: 161-168 | |
| 1 | Rusins Freivalds, Renate Praude, Lelde Lace: Some Graph Problems with Equivalent Lower Bounds for Query Complexity. FCS 2005: 80-86 | |
| 1 | Rusins Freivalds | [1] |
| 2 | Lelde Lace | [1] |
| 3 | Laura Mancinska | [2] |
| 4 | Maris Ozols | [2] |
| 5 | Agnese Zalcmane | [2] |