The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Wit Forys: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Wit Forys
    Some Characterization of Recursively Enumerable Sets. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:2, pp:157-163 [Journal]
  2. Wit Forys
    Retractions and retracts of free topological monoids. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2006, v:83, n:1, pp:21-26 [Journal]
  3. Wit Forys, Tomasz Krawczyk, James A. Anderson
    Semiretracts--a counterexample and some results. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:307, n:1, pp:117-127 [Journal]
  4. Wit Forys, Tomasz Krawczyk
    An algorithmic approach to the problem of a semiretract base. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:314-322 [Journal]

  5. Pseudo-Random Walks On Graphs And Cryptography. [Citation Graph (, )][DBLP]


  6. Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. [Citation Graph (, )][DBLP]


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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002