Christos A. Kapoutsis

ORCID

Publication Activity (10 Years)

Years Active: 1998-2022
Publications (10 Years): 9

Top Venues

Theory Comput. Syst.

Acta Informatica

Adventures Between Lower Bounds and Higher Altitudes

Int. J. Found. Comput. Sci.

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
Improved complement for two-way alternating automata. Acta Informatica 59 (5) (2022)
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
Complement for two-way alternating automata. Acta Informatica 58 (5) (2021)
Christos A. Kapoutsis, Mohammad Zakzok
Alternation in two-way finite automata. Theor. Comput. Sci. 870 (2021)
M. Anabtawi, S. Hassan, Christos A. Kapoutsis, Mohammad Zakzok
An Oracle Hierarchy for Small One-Way Finite Automata. LATA (2019)
Christos A. Kapoutsis
Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract). SOFSEM (2019)
Christos A. Kapoutsis
Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols. Adventures Between Lower Bounds and Higher Altitudes (2018)
Christos A. Kapoutsis, Lamana Mulaffer
A Logical Characterization of Small 2NFAs. Int. J. Found. Comput. Sci. 28 (5) (2017)
Christos A. Kapoutsis, Lamana Mulaffer
A Logical Characterization of Small 2NFAs. CIAA (2016)
Christos A. Kapoutsis, Giovanni Pighizzini
Two-Way Automata Characterizations of L/poly Versus NL. Theory Comput. Syst. 56 (4) (2015)
Christos A. Kapoutsis
Two-Way Automata Versus Logarithmic Space. Theory Comput. Syst. 55 (2) (2014)
Christos A. Kapoutsis
Predicate Characterizations in the Polynomial-Size Hierarchy. CiE (2014)
Christos A. Kapoutsis
Nondeterminism is essential in small two-way finite automata with few reversals. Inf. Comput. 222 (2013)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78 (2) (2012)
Christos A. Kapoutsis, Giovanni Pighizzini
Two-Way Automata Characterizations of L/poly versus NL. CSR (2012)
Christos A. Kapoutsis, Giovanni Pighizzini
Reversal Hierarchies for Small 2DFAs. MFCS (2012)
Christos A. Kapoutsis
Minicomplexity. J. Autom. Lang. Comb. 17 (2-4) (2012)
Christos A. Kapoutsis
Minicomplexity. DCFS (2012)
Christos A. Kapoutsis, Nans Lefebvre
Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata. Developments in Language Theory (2012)
Christos A. Kapoutsis
Nondeterminism Is Essential in Small 2FAs with Few Reversals. ICALP (2) (2011)
Christos A. Kapoutsis
Two-Way Automata versus Logarithmic Space. CSR (2011)
Christos A. Kapoutsis
Size Complexity of Two-Way Finite Automata. Developments in Language Theory (2009)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory (2008)
Christos A. Kapoutsis
Deterministic Moles Cannot Solve Liveness. J. Autom. Lang. Comb. 12 (1-2) (2007)
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA (2007)
Christos A. Kapoutsis
Small Sweeping 2NFAs Are Not Closed Under Complement. ICALP (1) (2006)
Christos A. Kapoutsis
Removing Bidirectionality from Nondeterministic Finite Automata. MFCS (2005)
Christos A. Kapoutsis
Deterministic moles cannot solve liveness. DCFS (2005)
Christos A. Kapoutsis
Non-recursive trade-offs for two-way machines. Int. J. Found. Comput. Sci. 16 (5) (2005)
Christos A. Kapoutsis
From k + 1 to k heads the descriptive trade-off is non-recursive. DCFS (2004)
Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas
Morphological iterative closest point algorithm. IEEE Trans. Image Process. 8 (11) (1999)
Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas
Morphological Techniques in the Iterative Closest Point Algorithm. ICIP (1) (1998)

Christos A. Kapoutsis.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Christos A. Kapoutsis