Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. - Janis Kaneps; Rusins Freivalds (MFCS, 1990)

Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. - Janis Kaneps (FCT, 1991)

Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. - Janis Kaneps; Rusins Freivalds (ICALP, 1991)

Tally Languages Accepted by Alternating Multitape Finite Automata. - Dainis Geidmanis; Janis Kaneps; Kalvis Apsitis; Daina Taimina; Elena Calude (COCOON, 1997)

Tally Languages Accepted by Monte Carlo Pushdown Automata. - Janis Kaneps; Dainis Geidmanis; Rusins Freivalds (RANDOM, 1997)