|
Search the dblp DataBase
Wit Forys:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
Pseudo-Random Walks On Graphs And Cryptography. [Citation Graph (, )][DBLP]
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|