default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChristos A. Kapoutsis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Viliam Geffert, Christos A. Kapoutsis
, Mohammad Zakzok:
Improved complement for two-way alternating automata. Acta Informatica 59(5): 619-669 (2022)- 2021
- [j11]Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok:
Complement for two-way alternating automata. Acta Informatica 58(5): 463-495 (2021) - [j10]Christos A. Kapoutsis, Mohammad Zakzok:
Alternation in two-way finite automata. Theor. Comput. Sci. 870: 75-102 (2021) - 2020
- [e1]Alexander Chatzigeorgiou, Riccardo Dondi, Herodotos Herodotou, Christos A. Kapoutsis, Yannis Manolopoulos, George A. Papadopoulos, Florian Sikora:
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. Lecture Notes in Computer Science 12011, Springer 2020, ISBN 978-3-030-38918-5 [contents]
2010 – 2019
- 2019
- [c19]Malek Anabtawi, Sabit Hassan, Christos A. Kapoutsis, Mohammad Zakzok:
An Oracle Hierarchy for Small One-Way Finite Automata. LATA 2019: 57-69 - [c18]Christos A. Kapoutsis:
Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract). SOFSEM 2019: 28-38 - 2018
- [c17]Christos A. Kapoutsis:
Optimal 2DFA Algorithms for One-Way Liveness on Two and Three Symbols. Adventures Between Lower Bounds and Higher Altitudes 2018: 33-48 - 2017
- [j9]Christos A. Kapoutsis, Lamana Mulaffer:
A Logical Characterization of Small 2NFAs. Int. J. Found. Comput. Sci. 28(5): 445-464 (2017) - 2016
- [c16]Christos A. Kapoutsis, Lamana Mulaffer:
A Logical Characterization of Small 2NFAs. CIAA 2016: 163-175 - 2015
- [j8]Christos A. Kapoutsis, Giovanni Pighizzini:
Two-Way Automata Characterizations of L/poly Versus NL. Theory Comput. Syst. 56(4): 662-685 (2015) - 2014
- [j7]Christos A. Kapoutsis:
Two-Way Automata Versus Logarithmic Space. Theory Comput. Syst. 55(2): 421-447 (2014) - [c15]Christos A. Kapoutsis:
Predicate Characterizations in the Polynomial-Size Hierarchy. CiE 2014: 234-244 - 2013
- [j6]Christos A. Kapoutsis:
Nondeterminism is essential in small two-way finite automata with few reversals. Inf. Comput. 222: 208-227 (2013) - 2012
- [j5]Christos A. Kapoutsis:
Minicomplexity. J. Autom. Lang. Comb. 17(2-4): 205-224 (2012) - [j4]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78(2): 537-558 (2012) - [c14]Christos A. Kapoutsis, Giovanni Pighizzini:
Two-Way Automata Characterizations of L/poly versus NL. CSR 2012: 217-228 - [c13]Christos A. Kapoutsis:
Minicomplexity. DCFS 2012: 20-42 - [c12]Christos A. Kapoutsis, Nans Lefebvre:
Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata. Developments in Language Theory 2012: 202-213 - [c11]Christos A. Kapoutsis, Giovanni Pighizzini:
Reversal Hierarchies for Small 2DFAs. MFCS 2012: 554-565 - 2011
- [c10]Christos A. Kapoutsis:
Two-Way Automata versus Logarithmic Space. CSR 2011: 359-372 - [c9]Christos A. Kapoutsis:
Nondeterminism Is Essential in Small 2FAs with Few Reversals. ICALP (2) 2011: 198-209
2000 – 2009
- 2009
- [c8]Christos A. Kapoutsis:
Size Complexity of Two-Way Finite Automata. Developments in Language Theory 2009: 47-66 - 2008
- [c7]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
On the Size Complexity of Rotating and Sweeping Automata. Developments in Language Theory 2008: 455-466 - 2007
- [j3]Christos A. Kapoutsis:
Deterministic Moles Cannot Solve Liveness. J. Autom. Lang. Comb. 12(1-2): 215-235 (2007) - [c6]Christos A. Kapoutsis, Richard Královic, Tobias Mömke:
An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA 2007: 130-141 - 2006
- [b1]Christos A. Kapoutsis:
Algorithms and lower bounds in finite automata size complexity. Massachusetts Institute of Technology, Cambridge, MA, USA, 2006 - [c5]Christos A. Kapoutsis:
Small Sweeping 2NFAs Are Not Closed Under Complement. ICALP (1) 2006: 144-156 - 2005
- [j2]Christos A. Kapoutsis:
Non-recursive trade-offs for two-way machines. Int. J. Found. Comput. Sci. 16(5): 943-956 (2005) - [c4]Christos A. Kapoutsis:
Deterministic moles cannot solve liveness. DCFS 2005: 194-205 - [c3]Christos A. Kapoutsis:
Removing Bidirectionality from Nondeterministic Finite Automata. MFCS 2005: 544-555 - 2004
- [c2]Christos A. Kapoutsis:
From k + 1 to k heads the descriptive trade-off is non-recursive. DCFS 2004: 213-224
1990 – 1999
- 1999
- [j1]Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas:
Morphological iterative closest point algorithm. IEEE Trans. Image Process. 8(11): 1644-1646 (1999) - 1998
- [c1]Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas:
Morphological Techniques in the Iterative Closest Point Algorithm. ICIP (1) 1998: 808-812
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
