Christos Kapoutsis
Christos Kapoutsis
Подтвержден адрес электронной почты в домене cmu.edu - Главная страница
Название
Процитировано
Процитировано
Год
Morphological iterative closest point algorithm
CA Kapoutsis, CP Vavoulidis, I Pitas
Transactions on Image Processing 8 (11), 1644-1646, 1999
681999
Removing bidirectionality from nondeterministic finite automata
CA Kapoutsis
International Symposium on Mathematical Foundations of Computer Science, 544-555, 2005
582005
Size complexity of two-way finite automata
CA Kapoutsis
International Conference on Developments in Language Theory, 47-66, 2009
382009
Size complexity of rotating and sweeping automata
CA Kapoutsis, R Královic, T Mömke
Journal of Computer and System Sciences 78 (2), 537-558, 2012
342012
Two-way automata versus logarithmic space
CA Kapoutsis
International Computer Science Symposium in Russia, 359-372, 2011
272011
Deterministic moles cannot solve liveness
CA Kapoutsis
Journal of Automata Languages and Combinatorics 12 (1/2), 215-235, 2007
232007
Deterministic moles cannot solve liveness
CA Kapoutsis
International Workshop on Descriptional Complexity of Formal Systems, 194-205, 2005
232005
Minicomplexity
C Kapoutsis
Journal of Automata, Languages and Combinatorics 17 (2--4), 205--224, 2012
222012
Minicomplexity
CA Kapoutsis
International Workshop on Descriptional Complexity of Formal Systems, 20-42, 2012
222012
Small sweeping 2NFAs are not closed under complement
CA Kapoutsis
International Colloquium on Automata, Languages and Programming, 144-156, 2006
212006
Two-way automata characterizations of L/poly versus NL
CA Kapoutsis, G Pighizzini
International Computer Science Symposium in Russia, 217-228, 2012
182012
Nondeterminism is essential in small two-way finite automata with few reversals
CA Kapoutsis
Information and Computation 222, 208-227, 2013
172013
Morphological techniques in the iterative closest point algorithm
CA Kapoutsis, CP Vavoulidis, I Pitas
International Conference on Image Processing, 808-812 (vol.1), 1998
131998
An exponential gap between LasVegas and deterministic sweeping finite automata
CA Kapoutsis, R Královič, T Mömke
International Symposium on Stochastic Algorithms: Foundations and …, 2007
112007
Algorithms and lower bounds in finite automata size complexity
CA Kapoutsis
Massachusetts Institute of Technology, 2006
102006
Two-Way Automata Characterizations of L/poly Versus NL
C Kapoutsis, G Pighizzini
Theory of Computing Systems 56 (4), 662-685, 2015
92015
On the size complexity of rotating and sweeping automata
CA Kapoutsis, R Královič, T Mömke
International Conference on Developments in Language Theory, 455-466, 2008
82008
Two-Way Automata Versus Logarithmic Space
C Kapoutsis
Theory of Computing Systems 55 (2), 421-447, 2014
72014
From k+1 to k heads the descriptive trade-off is non-recursive
CA Kapoutsis
International Workshop on Descriptional Complexity of Formal Systems, 213-224, 2004
72004
Reversal hierarchies for small 2DFAs
CA Kapoutsis, G Pighizzini
International Symposium on Mathematical Foundations of Computer Science, 554-565, 2012
62012
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20