- CSB - MetaPress - Google - Bing - Yahoo
 | 1997 | |
|---|---|---|
| c5 |      | Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude: Tally Languages Accepted by Alternating Multitape Finite Automata. COCOON 1997: 422-430 |
| c4 | | Janis Kaneps, Dainis Geidmanis, Rusins Freivalds: Tally Languages Accepted by Monte Carlo Pushdown Automata. RANDOM 1997: 187-195 |
| 1991 | ||
| c3 | | Janis Kaneps: Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. FCT 1991: 287-296 |
| c2 | | Janis Kaneps, Rusins Freivalds: Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. ICALP 1991: 174-185 |
| 1990 | ||
| c1 | | Janis Kaneps, Rusins Freivalds: Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. MFCS 1990: 355-361 |
| 1 | Kalvis Apsitis | |
| 2 | Elena Calude | |
| 3 | Rusins Freivalds | |
| 4 | Dainis Geidmanis | |
| 5 | Daina Taimina |
Data released under the ODC-BY 1.0 license — See also our legal information page