Trudy Instituta Matematiki
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Proceedings of the Institute of Mathematics of the NAS of Belarus:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Instituta Matematiki, 2010, Volume 18, Number 2, Pages 87–92 (Mi timb20)  
Approximate fine information structure of algorithms

N. A. Likhoded

Institute of Mathematics of the National Academy of Sciences of Belarus
Full-text PDF (203 kB)
References:
PDF
HTML
Abstract: A method for obtaining of functions setting data dependencies for sequential programs is presented.\linebreak The method is suitable for the automatization. In practice it is applicable in most cases.
Received: 07.12.2009
Document Type: Article
UDC: 519.6+681.3.012
Language: Russian
Citation: N. A. Likhoded, “Approximate fine information structure of algorithms”, Tr. Inst. Mat., 18:2 (2010), 87–92
Citation in format AMSBIB
\Bibitem{Lik10}
\by N.~A.~Likhoded
\paper Approximate fine information structure of algorithms
\jour Tr. Inst. Mat.
\yr 2010
\vol 18
\issue 2
\pages 87--92
\mathnet{http://mi.mathnet.ru/timb20}
Linking options:
  • https://www.mathnet.ru/eng/timb20
  • https://www.mathnet.ru/eng/timb/v18/i2/p87
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Труды Института математики
    Statistics & downloads:
    Abstract page:165
    Full-text PDF :85
    References:25
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024