Matematicheskoe modelirovanie
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Mat. Model.:
Year:
Volume:
Issue:
Page:
Find




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

Matematicheskoe modelirovanie, 2004, Volume 16, Number 1, Pages 105–114 (Mi mm361)  
This article is cited in 7 scientific papers (total in 7 papers)

Parallel methods for tree traverse

N. E. Timoshevskaya

Tomsk State University
Full-text PDF (1228 kB) Citations (7)
References:
PDF
HTML
Abstract: Two parallel methods for making tree traverse on a cluster computing system are proposed. Experimental results concerning the methods are given for $k$-order trees, for combination trees, and for optimal appointment trees.
Received: 27.10.2003
Bibliographic databases:
Language: Russian
Citation: N. E. Timoshevskaya, “Parallel methods for tree traverse”, Mat. Model., 16:1 (2004), 105–114
Citation in format AMSBIB
\Bibitem{Tim04}
\by N.~E.~Timoshevskaya
\paper Parallel methods for tree traverse
\jour Mat. Model.
\yr 2004
\vol 16
\issue 1
\pages 105--114
\mathnet{http://mi.mathnet.ru/mm361}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2060798}
\zmath{https://zbmath.org/?q=an:1053.68073}
Linking options:
  • https://www.mathnet.ru/eng/mm361
  • https://www.mathnet.ru/eng/mm/v16/i1/p105
    • This publication is cited in the following 7 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Математическое моделирование
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025