( en | de | ru )

 

Disambiguation of "Kapoutsis, Christos A."

Author of the publication

copydeleteadd this publication to your clipboard
Morphological Techniques in the Iterative Closest Point Algorithm.

, , and . ICIP (1), page 808-812. IEEE Computer Society, (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Christos Tagarakis

Christos Vrettos

Christos Koutras

Christos Xenakis

Christos Melemenidis

 

Other publications of authors with the same name

Complement for two-way alternating automata., , and . Acta Informatica, 58 (5): 463-495 (2021)Algorithms and lower bounds in finite automata size complexity.. Massachusetts Institute of Technology, Cambridge, MA, USA, (2006)ndltd.org (oai:dspace.mit.edu:1721.1/37891).Two-Way Automata Characterizations of L/poly Versus NL., and . Theory Comput. Syst., 56 (4): 662-685 (2015)From k + 1 to k heads the descriptive trade-off is non-recursive.. DCFS, Report No. 619, page 213-224. Department of Computer Science, The University of Western Ontario, Canada, (2004)Minicomplexity.. DCFS, volume 7386 of Lecture Notes in Computer Science, page 20-42. Springer, (2012)Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols.. Adventures Between Lower Bounds and Higher Altitudes, volume 11011 of Lecture Notes in Computer Science, page 33-48. Springer, (2018)Non-recursive trade-offs for two-way machines.. Int. J. Found. Comput. Sci., 16 (5): 943-956 (2005)Morphological Techniques in the Iterative Closest Point Algorithm., , and . ICIP (1), page 808-812. IEEE Computer Society, (1998)Small Sweeping 2NFAs Are Not Closed Under Complement.. ICALP (1), volume 4051 of Lecture Notes in Computer Science, page 144-156. Springer, (2006)Nondeterminism Is Essential in Small 2FAs with Few Reversals.. ICALP (2), volume 6756 of Lecture Notes in Computer Science, page 198-209. Springer, (2011)