Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Christos A. Kapoutsis" ( http://dblp.L3S.de/Authors/Christos_A._Kapoutsis )

  Author page on DBLP  Author page in RDF  Community of Christos A. Kapoutsis in ASPL-2

Publication years (Num. hits)
1998-2012 (14)
Publication types (Num. hits)
article(4) inproceedings(10)
Venues (Conferences, Journals, ...)
DCFS(2) Developments in Language Theor...(2) ICALP(2) CSR(1) ICIP(1) IEEE Transactions on Image Pro...(1) Int. J. Found. Comput. Sci.(1) J. Comput. Syst. Sci.(1) Journal of Automata, Languages...(1) MFCS(1) SAGA(1)
Authors
Christos A. Kapoutsis(14) Richard Královic(3) Tobias Mömke(3) C. P. Vavoulidis(2) Ioannis Pitas(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 14 publication records. Showing 14 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Christos A. Kapoutsis, Richard Královic, Tobias Mömke Size complexity of rotating and sweeping automata. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Two-Way Automata versus Logarithmic Space. Search on Bibsonomy CSR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Nondeterminism Is Essential in Small 2FAs with Few Reversals. Search on Bibsonomy ICALP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Size Complexity of Two-Way Finite Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis, Richard Královic, Tobias Mömke On the Size Complexity of Rotating and Sweeping Automata. Search on Bibsonomy Developments in Language Theory The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Deterministic Moles Cannot Solve Liveness. Search on Bibsonomy Journal of Automata, Languages and Combinatorics The full citation details ... 2007 DBLP  BibTeX  RDF
1Christos A. Kapoutsis, Richard Královic, Tobias Mömke An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. Search on Bibsonomy SAGA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Small Sweeping 2NFAs Are Not Closed Under Complement. Search on Bibsonomy ICALP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Non-recursive trade-offs for two-way machines. Search on Bibsonomy Int. J. Found. Comput. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Removing Bidirectionality from Nondeterministic Finite Automata. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis Deterministic moles cannot solve liveness. Search on Bibsonomy DCFS The full citation details ... 2005 DBLP  BibTeX  RDF
1Christos A. Kapoutsis From k + 1 to k heads the descriptive trade-off is non-recursive. Search on Bibsonomy DCFS The full citation details ... 2004 DBLP  BibTeX  RDF
1Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas Morphological iterative closest point algorithm. Search on Bibsonomy IEEE Transactions on Image Processing The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas Morphological Techniques in the Iterative Closest Point Algorithm. Search on Bibsonomy ICIP The full citation details ... 1998 DBLP  BibTeX  RDF
Displaying result #1 - #14 of 14 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.