Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Avtomatika i Telemekhanika, 1977, Issue 10, Pages 159–167 (Mi at7520)  

Computers in Control

On decomposition of digital units into modules

A. V. Brunchenko

Leningrad
Abstract: The heuristic procedure for decomposition of digital units into modules makes use of the algorithm for cutting a bipartite graph. The operation of the algorithm is illustrated with an example Minsk 32 computers are found powerful enough to apply the algorithm to units of about 3000 logical elements.

Received: 19.01.1977
Bibliographic databases:
Document Type: Article
UDC: 621.382.82:681.32
Language: Russian
Citation: A. V. Brunchenko, “On decomposition of digital units into modules”, Avtomat. i Telemekh., 1977, no. 10, 159–167; Autom. Remote Control, 38:10 (1978), 1560–1567
Citation in format AMSBIB
\Bibitem{Bru77}
\by A.~V.~Brunchenko
\paper On decomposition of digital units into modules
\jour Avtomat. i Telemekh.
\yr 1977
\issue 10
\pages 159--167
\mathnet{http://mi.mathnet.ru/at7520}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=476173}
\zmath{https://zbmath.org/?q=an:0419.94021}
\transl
\jour Autom. Remote Control
\yr 1978
\vol 38
\issue 10
\pages 1560--1567
Linking options:
  • https://www.mathnet.ru/eng/at7520
  • https://www.mathnet.ru/eng/at/y1977/i10/p159
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025