Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika
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


Vestnik Moskov. Univ. Ser. 1. Mat. Mekh.:
Year:
Volume:
Issue:
Page:
Find




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

Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2023, Number 5, Pages 33–39
DOI: https://doi.org/10.55959/MSU0579-9368-1-64-5-5 (Mi vmumm4565) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Mathematics

Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators

D. I. Vasilyev, È. È. Gasanov

Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Full-text PDF (269 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.55959/MSU0579-9368-1-64-5-5
Abstract: The paper considers the application of the locator cellular automaton model to the closest neighbour search problem. The locator cellular automaton model assumes the possibility for each cell to translate a signal through any distance using the ether. It was proven earlier that the ether model allows us to solve the problem with logarithmic time. In this paper we have derived a logarithmic lower bound for this problem.
Key words: cellular automata, homogeneous structures, the closest neighbour search problem.
Received: 15.03.2023
English version:
Moscow University Mathematics Bulletin, 2023, Volume 78, Issue 5, Pages 244–252
DOI: https://doi.org/10.3103/S0027132223050078
Bibliographic databases:
Document Type: Article
UDC: 511
Language: Russian
Citation: D. I. Vasilyev, È. È. Gasanov, “Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2023, no. 5, 33–39; Moscow University Mathematics Bulletin, 78:5 (2023), 244–252
Citation in format AMSBIB
\Bibitem{VasGas23}
\by D.~I.~Vasilyev, \`E.~\`E.~Gasanov
\paper Lower estimate of complexity in the problem of searching the nearest neighbor on a straight line using a cellular automation with locators
\jour Vestnik Moskov. Univ. Ser.~1. Mat. Mekh.
\yr 2023
\issue 5
\pages 33--39
\mathnet{http://mi.mathnet.ru/vmumm4565}
\crossref{https://doi.org/10.55959/MSU0579-9368-1-64-5-5}
\elib{https://elibrary.ru/item.asp?id=54669690}
\transl
\jour Moscow University Mathematics Bulletin
\yr 2023
\vol 78
\issue 5
\pages 244--252
\crossref{https://doi.org/10.3103/S0027132223050078}
Linking options:
  • https://www.mathnet.ru/eng/vmumm4565
  • https://www.mathnet.ru/eng/vmumm/y2023/i5/p33
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:75
    Full-text PDF :51
    References:18
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024