The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Janis Kaneps: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Dainis Geidmanis, Janis Kaneps, Kalvis Apsitis, Daina Taimina, Elena Calude
    Tally Languages Accepted by Alternating Multitape Finite Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 1997, pp:422-430 [Conf]
  2. Janis Kaneps
    Regularity of One-Letter Languages Acceptable by 2-Way Finite Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:287-296 [Conf]
  3. Janis Kaneps, Rusins Freivalds
    Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:174-185 [Conf]
  4. Janis Kaneps, Rusins Freivalds
    Minimal Nontrivial Space Complexity of Probabilistic One-Way Turing Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:355-361 [Conf]
  5. Janis Kaneps, Dainis Geidmanis, Rusins Freivalds
    Tally Languages Accepted by Monte Carlo Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1997, pp:187-195 [Conf]

Search in 0.001secs, Finished in 0.001secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002