
Search the dblp DataBase
Christos A. Kapoutsis:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Christos A. Kapoutsis
Small Sweeping 2NFAs Are Not Closed Under Complement. [Citation Graph (0, 0)][DBLP] ICALP (1), 2006, pp:144156 [Conf]
 Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas
Morphological Techniques in the Iterative Closest Point Algorithm. [Citation Graph (0, 0)][DBLP] ICIP (1), 1998, pp:808812 [Conf]
 Christos A. Kapoutsis
Removing Bidirectionality from Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP] MFCS, 2005, pp:544555 [Conf]
 Christos A. Kapoutsis
Nonrecursive tradeoffs for twoway machines. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:943956 [Journal]
 Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas
Morphological iterative closest point algorithm. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Image Processing, 1999, v:8, n:11, pp:16441646 [Journal]
 Christos A. Kapoutsis, Richard Královic, Tobias Mömke
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. [Citation Graph (0, 0)][DBLP] SAGA, 2007, pp:130141 [Conf]
On the Size Complexity of Rotating and Sweeping Automata. [Citation Graph (, )][DBLP]
Size Complexity of TwoWay Finite Automata. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
