dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Mikhail V. Berlinkov 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
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: Synchronizing Automata on Quasi Eulerian Digraph CoRR abs/1203.3402: (2012)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: The Cerny Conjecture CoRR abs/1204.0856: (2012)
2011
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarie-Pierre Béal, Mikhail V. Berlinkov, Dominique Perrin: A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. 22(2): 277-288 (2011)
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: On a Conjecture by carpi and d'alessandro. Int. J. Found. Comput. Sci. 22(7): 1565-1576 (2011)
2010
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: Approximating the Minimum Length of Synchronizing Words Is Hard. CSR 2010: 37-47
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: On a Conjecture by Carpi and D'Alessandro. Developments in Language Theory 2010: 66-75
2009
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: On calculating length of minimal synchronizing words CoRR abs/0909.3787: (2009)
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMikhail V. Berlinkov: Extension Method and The Cerny Conjecture CoRR abs/0909.3790: (2009)

Coauthor Index

1Marie-Pierre Béal [6]
2Dominique Perrin [6]

Last update Sun May 27 04:04:01 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