Christos A. Kapoutsis Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis, Richard Královic, Tobias Mömke: Size complexity of rotating and sweeping automata. J. Comput. Syst. Sci. 78(2): 537-558 (2012)
2011
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Two-Way Automata versus Logarithmic Space. CSR 2011: 359-372
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Nondeterminism Is Essential in Small 2FAs with Few Reversals. ICALP (2) 2011: 198-209
2009
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Size Complexity of Two-Way Finite Automata. Developments in Language Theory 2009: 47-66
2008
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis, Richard Královic, Tobias Mömke: An Exponential Gap Between LasVegas and Deterministic Sweeping Finite Automata. SAGA 2007: 130-141
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Deterministic Moles Cannot Solve Liveness. Journal of Automata, Languages and Combinatorics 12(1-2): 215-235 (2007)
2006
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Small Sweeping 2NFAs Are Not Closed Under Complement. ICALP (1) 2006: 144-156
2005
6no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Deterministic moles cannot solve liveness. DCFS 2005: 194-205
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Removing Bidirectionality from Nondeterministic Finite Automata. MFCS 2005: 544-555
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: Non-recursive trade-offs for two-way machines. Int. J. Found. Comput. Sci. 16(5): 943-956 (2005)
2004
3no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis: From k + 1 to k heads the descriptive trade-off is non-recursive. DCFS 2004: 213-224
1999
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas: Morphological iterative closest point algorithm. IEEE Transactions on Image Processing 8(11): 1644-1646 (1999)
1998
1no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas: Morphological Techniques in the Iterative Closest Point Algorithm. ICIP (1) 1998: 808-812

Coauthor Index

1Richard Královic [9] [10] [14]
2Tobias Mömke [9] [10] [14]
3Ioannis Pitas [1] [2]
4C. P. Vavoulidis [1] [2]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page