Prikladnaya Diskretnaya Matematika. Supplement
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


Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika. Supplement, 2013, Issue 6, Pages 105–107 (Mi pdma68)  
Computational methods in discrete mathematics

About possibility of reduction of sort out in Balash's algorithm

N. V. Anashkina
Full-text PDF (484 kB)
References:
PDF
HTML
Abstract: An optimization of Balash's algorithm using particular feature of geometric structure of deadlock point's environs is presented.
Keywords: Balash's algorithm, discrepancy, deadlock point.
Document Type: Article
UDC: 519.688
Language: Russian
Citation: N. V. Anashkina, “About possibility of reduction of sort out in Balash's algorithm”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 105–107
Citation in format AMSBIB
\Bibitem{Ana13}
\by N.~V.~Anashkina
\paper About possibility of reduction of sort out in Balash's algorithm
\jour Prikl. Diskr. Mat. Suppl.
\yr 2013
\issue 6
\pages 105--107
\mathnet{http://mi.mathnet.ru/pdma68}
Linking options:
  • https://www.mathnet.ru/eng/pdma68
  • https://www.mathnet.ru/eng/pdma/y2013/i6/p105
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Prikladnaya Diskretnaya Matematika. Supplement
    Statistics & downloads:
    Abstract page:180
    Full-text PDF :136
    References:53
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024