Christos A. Kapoutsis

Orcid: 0000-0001-8963-9326

According to our database1, Christos A. Kapoutsis authored at least 26 papers between 1998 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Improved complement for two-way alternating automata.
Acta Informatica, 2022

2021
Alternation in two-way finite automata.
Theor. Comput. Sci., 2021

Complement for two-way alternating automata.
Acta Informatica, 2021

2019
Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract).
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

An Oracle Hierarchy for Small One-Way Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2019

2018
Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols.
Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017
A Logical Characterization of Small 2NFAs.
Int. J. Found. Comput. Sci., 2017

2015
Two-Way Automata Characterizations of L/poly Versus NL.
Theory Comput. Syst., 2015

2014
Two-Way Automata Versus Logarithmic Space.
Theory Comput. Syst., 2014

Predicate Characterizations in the Polynomial-Size Hierarchy.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Nondeterminism is essential in small two-way finite automata with few reversals.
Inf. Comput., 2013

2012
Size complexity of rotating and sweeping automata.
J. Comput. Syst. Sci., 2012

Minicomplexity.
J. Autom. Lang. Comb., 2012

Reversal Hierarchies for Small 2DFAs.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

2011
Nondeterminism Is Essential in Small 2FAs with Few Reversals.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2009
Size Complexity of Two-Way Finite Automata.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2007
Deterministic Moles Cannot Solve Liveness.
J. Autom. Lang. Comb., 2007

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata.
Proceedings of the Stochastic Algorithms: Foundations and Applications, 2007

2006
Algorithms and lower bounds in finite automata size complexity.
PhD thesis, 2006

Small Sweeping 2NFAs Are Not Closed Under Complement.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Non-recursive trade-offs for two-way machines.
Int. J. Found. Comput. Sci., 2005

Removing Bidirectionality from Nondeterministic Finite Automata.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
From k + 1 to k heads the descriptive trade-off is non-recursive.
Proceedings of the 6th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2004, London, Ontario, Canada, July 26, 2004

1999
Morphological iterative closest point algorithm.
IEEE Trans. Image Process., 1999

1998
Morphological Techniques in the Iterative Closest Point Algorithm.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998


  Loading...