Number of the records: 1
Exploration of high-dimensional grids by finite automata
Title Exploration of high-dimensional grids by finite automata Author Dobrev Stefan 1970 SAVMATEM - Matematický ústav SAV Co-authors Narayanan Lata Opatrny Jaroslav Co-authors Pankratov Denis Source document Leibniz International Proceedings in Informatics, LIPIcs. Vol. 132 (2019), no. 139, p. 1-16, 46th International Colloquium on Automata, Languages, and Programming / Baier Christel ; Chatzigiannakis Ioannis ; Flocchini Paola ; Leonardi Stefano Language eng - English Country DE - Germany Document kind rozpis článkov z periodík (rzb) Citations GOTOH, Tsuyoshi - FLOCCHINI, Paola - MASUZAWA, Toshimitsu - SANTORO, Nicola. Tight bounds on distributed exploration of temporal graphs. In Leibniz International Proceedings in Informatics, LIPIcs. ISSN 18688969, 2020-02-01, 153. BRANDT, Sebastian - PORTMANN, Julian - UITTO, Jara. Tight bounds for deterministic high-dimensional grid exploration. In Leibniz International Proceedings in Informatics, LIPIcs. ISSN 18688969, 2020-10-01, 179. GOTOH, Tsuyoshi - FLOCCHINI, Paola - MASUZAWA, Toshimitsu - SANTORO, Nicola. Exploration of dynamic networks: Tight bounds on the number of agents. In JOURNAL OF COMPUTER AND SYSTEM SCIENCES. ISSN 0022-0000, 2021, vol. 122, p. 1-18. Dostupné na: https://doi.org/10.1016/j.jcss.2021.04.003. Category ADMB - Scientific papers in foreign non-impacted journals registered in Web of Sciences or Scopus Category of document (from 2022) V3 - Vedecký výstup publikačnej činnosti z časopisu Type of document článok Year 2019 Registered in SCOPUS DOI 10.4230/LIPIcs.ICALP.2019.139 
article
File name Access Size Downloaded Type License Exploration of high-dimensional grids by finite automata.pdf available 540.6 KB 2 Publisher's version rok CC IF IF Q (best) JCR Av Jour IF Perc SJR SJR Q (best) CiteScore N rok vydania rok metriky IF IF Q (best) SJR SJR Q (best) 2019
Number of the records: 1