Sample text 123
Christos Kapoutsis
-
0000-0001-8963-9326 -
Associate Teaching Professor of Computer Science
-
-
[email protected] (Work)
-
[email protected] (Personal)
-
+974 44548488(Work) -
+974 55548478(Mobile)
-
Carnegie Mellon University Qatar, Computer Science, Doha, Qatar -
-
-
-
-
-
-
Publications
-
Scholarly edition Featured
Υπολογιστική Γεωμετρία: Αλγόριθμοι και Εφαρμογές — Greek translation of Computational Geometry: Algorithms and Applications (Springer, 2000)
01 Jan 2011 Crete University Press (Heraklion, Greece)
de Berg M, van Kreveld M, Overmars M, Schwarzkopf O
- Citations
- 0
Total Citations : 0 Dimensions Citation : 0 Scopus Citation : 0 Web of Science Lite Citation : 0 -
Scholarly edition Featured
Συνκριτά Μαθηματικά: Μια Θεμελίωση της Επιστήμης Υπολογιστών — Greek translation of Concrete Mathematics: A Foundation for Computer Science (Addison-Wesley Professional, 1994)
01 Jan 2013 Klidarithmos Publishing (Athens, Greece)
Graham R, Knuth D, Patashnik O
- Citations
- 0
Total Citations : 0 Dimensions Citation : 0 Scopus Citation : 0 Web of Science Lite Citation : 0 -
Thesis / Dissertation Featured
Algorithms and lower bounds in finite automata size complexity
06 Jun 2006
Kapoutsis C - Citations
- 0
Total Citations : 0 Dimensions Citation : 0 Scopus Citation : 0 Web of Science Lite Citation : 0 -
Journal article Featured
Deterministic Moles Cannot Solve Liveness
01 Jan 2007 Journal of Automata, Languages and Combinatorics 12 (1-2 ) : 215 - 235
Kapoutsis C - Citations
- 0
Total Citations : 0 Dimensions Citation : 0 Scopus Citation : 0 Web of Science Lite Citation : 0 -
Journal article Featured
Removing bidirectionality from nondeterministic finite automata
01 Jan 2005 Lecture Notes in Computer Science 3618 : 544 - 555
Kapoutsis C - Citations
- 150
Total Citations : 150 Dimensions Citation : 51 Scopus Citation : 52 Web of Science Lite Citation : 47 -
Journal article Featured
Removing bidirectionality from nondeterministic finite automata
01 Jan 2005 Lecture Notes in Computer Science 3618 : 544 - 555
Kapoutsis C - Citations
- 150
Total Citations : 150 Dimensions Citation : 51 Scopus Citation : 52 Web of Science Lite Citation : 47 -
Conference Featured
Minicomplexity
01 Jan 2012 Lecture Notes in Computer Science 7386 : 20 - 42
Kapoutsis CA - Citations
- 33
Total Citations : 33 Dimensions Citation : 9 Scopus Citation : 7 Web of Science Lite Citation : 17 -
Conference Featured
Minicomplexity
01 Jan 2012 Lecture Notes in Computer Science 7386 : 20 - 42
Kapoutsis CA - Citations
- 33
Total Citations : 33 Dimensions Citation : 9 Scopus Citation : 7 Web of Science Lite Citation : 17 -
Conference Featured
Minicomplexity <i>Some Motivation</i>, <i>Some History</i>, <i>and Some Structure</i> (Invited Talk Extended Abstract)
01 Jan 2019 Lecture Notes in Computer Science 11376 : 28 - 38
Kapoutsis CA - Citations
- 2
Total Citations : 2 Dimensions Citation : 1 Scopus Citation : 1 Web of Science Lite Citation : 0 -
Conference Featured
Minicomplexity <i>Some Motivation</i>, <i>Some History</i>, <i>and Some Structure</i> (Invited Talk Extended Abstract)
01 Jan 2019 Lecture Notes in Computer Science 11376 : 28 - 38
Kapoutsis CA - Citations
- 2
Total Citations : 2 Dimensions Citation : 1 Scopus Citation : 1 Web of Science Lite Citation : 0 -
Conference Featured
Nondeterminism is essential in small two-way finite automata with few reversals
01 Jan 2013 Information and Computation 222 : 208 - 227
Kapoutsis CA - Citations
- 31
Total Citations : 31 Dimensions Citation : 10 Scopus Citation : 11 Web of Science Lite Citation : 10 -
Conference Featured
Nondeterminism is essential in small two-way finite automata with few reversals
01 Jan 2013 Information and Computation 222 : 208 - 227
Kapoutsis CA - Citations
- 31
Total Citations : 31 Dimensions Citation : 10 Scopus Citation : 11 Web of Science Lite Citation : 10 -
Conference Featured
Size Complexity of Two-Way Finite Automata
01 Jan 2009 Lecture Notes in Computer Science 5583 : 47 - 66
Kapoutsis CA - Citations
- 90
Total Citations : 90 Dimensions Citation : 33 Scopus Citation : 31 Web of Science Lite Citation : 26 -
Conference Featured
Size Complexity of Two-Way Finite Automata
01 Jan 2009 Lecture Notes in Computer Science 5583 : 47 - 66
Kapoutsis CA - Citations
- 90
Total Citations : 90 Dimensions Citation : 33 Scopus Citation : 31 Web of Science Lite Citation : 26 -
Conference Featured
Small sweeping 2NFAs are not closed under complement
01 Jan 2006 Lecture Notes in Computer Science 4051 : 144 - 156
Kapoutsis CA - Citations
- 31
Total Citations : 31 Dimensions Citation : 11 Scopus Citation : 12 Web of Science Lite Citation : 8
