Christos A. Kapoutsis

	2009
9		Christos A. Kapoutsis: Size Complexity of Two-Way Finite Automata. Developments in Language Theory 2009: 47-66
	2008
8		Christos A. Kapoutsis, Richard Královic, Tobias Mömke: On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory 2008: 455-466
	2007
7		Christos A. Kapoutsis, Richard Královic, Tobias Mömke: An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA 2007: 130-141
6		Christos A. Kapoutsis: Deterministic Moles Cannot Solve Liveness. Journal of Automata, Languages and Combinatorics 12(1-2): 215-235 (2007)
	2006
5		Christos A. Kapoutsis: Small Sweeping 2NFAs Are Not Closed Under Complement. ICALP (1) 2006: 144-156
	2005
4		Christos A. Kapoutsis: Removing Bidirectionality from Nondeterministic Finite Automata. MFCS 2005: 544-555
3		Christos A. Kapoutsis: Non-recursive trade-offs for two-way machines. Int. J. Found. Comput. Sci. 16(5): 943-956 (2005)
	1999
2		Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas: Morphological iterative closest point algorithm. IEEE Transactions on Image Processing 8(11): 1644-1646 (1999)
	1998
1		Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas: Morphological Techniques in the Iterative Closest Point Algorithm. ICIP (1) 1998: 808-812

Coauthor Index

1	Richard Královic	[7] [8]
2	Tobias Mömke	[7] [8]
3	Ioannis Pitas	[1] [2]
4	C. P. Vavoulidis	[1] [2]

Colors in the list of coauthors