Institute of Informatics>>> Department of Image Processing and Computer Graphics>>>

Magyarul

Selected Publications of the Department of Image Processing and Computer Graphics of the year 1981

Articles in journal or book chapters

1. Tamas Legendi and Endre Katona. A 5 State Solution of the Early Bird Problem in a One Dimensional Cellular Space. Acta Cybernetica, 5:173-179, 1981. [PDF]
   Abstract: There exists a class of interesting problems for cellular automata characterized by their common property of decomposing some global behaviour into homogeneous parallel transitions. Well known representatives of this class are the firing squad synchronization problem and the French Flag problem. Another problem of this class was defined by Rosenstiehl et al. (1972) named as the ``early bird'' problem. The problem has been solved also by Vollmar (1978) using a high number of cell states. The solution presented here uses only 5 cell states.
   @ARTICLE{Legendi1981,
   AUTHOR = {Tamas Legendi and Endre Katona},
   JOURNAL = {Acta Cybernetica},
   TITLE = {A 5 State Solution of the Early Bird Problem in a One Dimensional Cellular Space},
   YEAR = {1981},
   PAGES = {173-179},
   VOLUME = {5},
   }
   

Conference articles

1. Endre Katona. Cellular Algorithms for Binary Matrix Operations. In W. Händler, editor, Proceedings of CONPAR, volume 111 of Lecture Notes in Computer Science, Nurnberg, Germany, pages 203-216, June 1981. Springer Verlag. [PDF]
   Abstract: Binary matrixes (matrixes having only 0 and 1 elements) occur in many theoretical and practical areas (e.g. in the theory of graphs and relations, grammars, coding, etc.) therefore the binary matrix operations have high importance in these topics. It is an obvious idea to use cellular processor consisting of micro-cells for the execution of these operations. The present paper gives a powerful cellular algorithm for the multiplication of two binary matrixes, taking into account the cellprocessor architecture developed by T. Legendi. Moreover, on the basis of this solution cellular algorithms are given for coding and for the computation pf the m-th power of a binary matrix.
   @INPROCEEDINGS{Katona1981,
   AUTHOR = {Endre Katona},
   BOOKTITLE = {Proceedings of CONPAR},
   TITLE = {Cellular Algorithms for Binary Matrix Operations},
   YEAR = {1981},
   ADDRESS = {Nurnberg, Germany},
   EDITOR = {W. Händler},
   MONTH = {June},
   PAGES = {203-216},
   PUBLISHER = {Springer Verlag},
   SERIES = {Lecture Notes in Computer Science},
   VOLUME = {111},
   }
   

  This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

 This document was translated from BibTEX by bibtex2html