Search the dblp DataBase

Publications of Author

1. Christos A. Kapoutsis
   Small Sweeping 2NFAs Are Not Closed Under Complement. [Citation Graph (0, 0)][DBLP]
   ICALP (1), 2006, pp:144-156 [Conf]
   
2. 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:808-812 [Conf]
   
3. Christos A. Kapoutsis
   Removing Bidirectionality from Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
   MFCS, 2005, pp:544-555 [Conf]
   
4. Christos A. Kapoutsis
   Non-recursive trade-offs for two-way machines. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:943-956 [Journal]
   
5. 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:1644-1646 [Journal]
   
6. 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:130-141 [Conf]
   
7. 
   On the Size Complexity of Rotating and Sweeping Automata. [Citation Graph (, )][DBLP]
   
   
8. 
   Size Complexity of Two-Way Finite Automata. [Citation Graph (, )][DBLP]