Morphological Techniques in the Iterative Closest Point Algorithm. - Christos A. Kapoutsis; C. P. Vavoulidis; Ioannis Pitas (ICIP (1), 1998)

Morphological iterative closest point algorithm. - Christos A. Kapoutsis; C. P. Vavoulidis; Ioannis Pitas (IEEE Trans. Image Process., 1999)

From k + 1 to k heads the descriptive trade-off is non-recursive. - Christos A. Kapoutsis (DCFS, 2004)

Removing Bidirectionality from Nondeterministic Finite Automata. - Christos A. Kapoutsis (MFCS, 2005)

Non-recursive trade-offs for two-way machines. - Christos A. Kapoutsis (Int. J. Found. Comput. Sci., 2005)

Small Sweeping 2NFAs Are Not Closed Under Complement. - Christos A. Kapoutsis (ICALP (1), 2006)

Algorithms and lower bounds in finite automata size complexity. - Christos A. Kapoutsis (2006)

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. - Christos A. Kapoutsis; Richard Královic; Tobias Mömke (SAGA, 2007)

Deterministic Moles Cannot Solve Liveness. - Christos A. Kapoutsis (J. Autom. Lang. Comb., 2007)

Size Complexity of Two-Way Finite Automata. - Christos A. Kapoutsis (Developments in Language Theory, 2009)

Nondeterminism Is Essential in Small 2FAs with Few Reversals. - Christos A. Kapoutsis (ICALP (2), 2011)

Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata. - Christos A. Kapoutsis; Nans Lefebvre (Developments in Language Theory, 2012)

Reversal Hierarchies for Small 2DFAs. - Christos A. Kapoutsis; Giovanni Pighizzini (MFCS, 2012)

Minicomplexity. - Christos A. Kapoutsis (J. Autom. Lang. Comb., 2012)

Size complexity of rotating and sweeping automata. - Christos A. Kapoutsis; Richard Královic; Tobias Mömke (J. Comput. Syst. Sci., 2012)

Nondeterminism is essential in small two-way finite automata with few reversals. - Christos A. Kapoutsis (Inf. Comput., 2013)

Predicate Characterizations in the Polynomial-Size Hierarchy. - Christos A. Kapoutsis (CiE, 2014)

Two-Way Automata Versus Logarithmic Space. - Christos A. Kapoutsis (Theory Comput. Syst., 2014)

Two-Way Automata Characterizations of L/poly Versus NL. - Christos A. Kapoutsis; Giovanni Pighizzini (Theory Comput. Syst., 2015)

A Logical Characterization of Small 2NFAs. - Christos A. Kapoutsis; Lamana Mulaffer (Int. J. Found. Comput. Sci., 2017)

Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols. - Christos A. Kapoutsis (Adventures Between Lower Bounds and Higher Altitudes, 2018)

An Oracle Hierarchy for Small One-Way Finite Automata. - Malek Anabtawi; Sabit Hassan; Christos A. Kapoutsis; Mohammad Zakzok (LATA, 2019)

Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract). - Christos A. Kapoutsis (SOFSEM, 2019)

Complement for two-way alternating automata. - Viliam Geffert; Christos A. Kapoutsis; Mohammad Zakzok (Acta Informatica, 2021)

Alternation in two-way finite automata. - Christos A. Kapoutsis; Mohammad Zakzok (Theor. Comput. Sci., 2021)

Improved complement for two-way alternating automata. - Viliam Geffert; Christos A. Kapoutsis; Mohammad Zakzok (Acta Informatica, 2022)