Christos A. Kapoutsis

33 papers B 4C 6Misc 2Journal 12Unranked 8
YearRankTypeTitle / Venue / Authors
2022 J jnl
Improved complement for two-way alternating automata.
Acta Informatica
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
2021 J jnl
Alternation in two-way finite automata.
Theor. Comput. Sci.
Christos A. Kapoutsis, Mohammad Zakzok
2021 J jnl
Complement for two-way alternating automata.
Acta Informatica
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok
2020 B ed.
SOFSEM 2020: Theory and Practice of Computer Science - 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, Limassol, Cyprus, January 20-24, 2020, Proceedings
SOFSEM
Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora
2019 C conf
An Oracle Hierarchy for Small One-Way Finite Automata.
LATA
Malek Anabtawi, Sabit Hassan, Christos A. Kapoutsis, Mohammad Zakzok
2019 B conf
Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract).
SOFSEM
Christos A. Kapoutsis
2018 — conf
Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols.
Adventures Between Lower Bounds and Higher Altitudes
Christos A. Kapoutsis
2017 J jnl
A Logical Characterization of Small 2NFAs.
Int. J. Found. Comput. Sci.
Christos A. Kapoutsis, Lamana Mulaffer
2016 C conf
A Logical Characterization of Small 2NFAs.
CIAA
Christos A. Kapoutsis, Lamana Mulaffer
2015 J jnl
Two-Way Automata Characterizations of L/poly Versus NL.
Theory Comput. Syst.
Christos A. Kapoutsis, Giovanni Pighizzini
2014 C conf
Predicate Characterizations in the Polynomial-Size Hierarchy.
CiE
Christos A. Kapoutsis
2014 J jnl
Two-Way Automata Versus Logarithmic Space.
Theory Comput. Syst.
Christos A. Kapoutsis
2013 J jnl
Nondeterminism is essential in small two-way finite automata with few reversals.
Inf. Comput.
Christos A. Kapoutsis
2012 C conf
Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata.
Developments in Language Theory
Christos A. Kapoutsis, Nans Lefebvre
2012 — conf
Minicomplexity.
DCFS
Christos A. Kapoutsis
2012 J jnl
Minicomplexity.
J. Autom. Lang. Comb.
Christos A. Kapoutsis
2012 B conf
Reversal Hierarchies for Small 2DFAs.
MFCS
Christos A. Kapoutsis, Giovanni Pighizzini
2012 J jnl
Size complexity of rotating and sweeping automata.
J. Comput. Syst. Sci.
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2012 Misc conf
Two-Way Automata Characterizations of L/poly versus NL.
CSR
Christos A. Kapoutsis, Giovanni Pighizzini
2011 — conf
Nondeterminism Is Essential in Small 2FAs with Few Reversals.
ICALP (2)
Christos A. Kapoutsis
2011 Misc conf
Two-Way Automata versus Logarithmic Space.
CSR
Christos A. Kapoutsis
2009 C conf
Size Complexity of Two-Way Finite Automata.
Developments in Language Theory
Christos A. Kapoutsis
2008 C conf
On the Size Complexity of Rotating and Sweeping Automata.
Developments in Language Theory
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2007 — conf
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata.
SAGA
Christos A. Kapoutsis, Richard Královic, Tobias Mömke
2007 J jnl
Deterministic Moles Cannot Solve Liveness.
J. Autom. Lang. Comb.
Christos A. Kapoutsis
2006 — —
Algorithms and lower bounds in finite automata size complexity.
Christos A. Kapoutsis
2006 — conf
Small Sweeping 2NFAs Are Not Closed Under Complement.
ICALP (1)
Christos A. Kapoutsis
2005 — conf
Deterministic moles cannot solve liveness.
DCFS
Christos A. Kapoutsis
2005 J jnl
Non-recursive trade-offs for two-way machines.
Int. J. Found. Comput. Sci.
Christos A. Kapoutsis
2005 B conf
Removing Bidirectionality from Nondeterministic Finite Automata.
MFCS
Christos A. Kapoutsis
2004 — conf
From k + 1 to k heads the descriptive trade-off is non-recursive.
DCFS
Christos A. Kapoutsis
1999 J jnl
Morphological iterative closest point algorithm.
IEEE Trans. Image Process.
Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas
1998 — conf
Morphological Techniques in the Iterative Closest Point Algorithm.
ICIP (1)
Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas