| DC Field | Value | Language |
|---|
| dc.contributor.author | Verenik, N. L. | - |
| dc.contributor.author | Tatur, M. M. | - |
| dc.date.accessioned | 2018-03-12T12:34:40Z | - |
| dc.date.available | 2018-03-12T12:34:40Z | - |
| dc.date.issued | 2018 | - |
| dc.identifier.citation | Verenik, N. L. Associative processor as means of disjoint sets representation and dynamic connectivity problem solving / N. L. Verenik, M. M. Tatur // Открытые семантические технологии проектирования интеллектуальных систем = Open Semantic Technologies for Intelligent Systems (OSTIS-2018) : материалы международной научно-технической конференции (Минск, 15 - 17 февраля 2018 года) / редкол. : В. В. Голенков (отв. ред.) [и др.]. – Минск : БГУИР, 2018. – С. 175 – 178. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/30402 | - |
| dc.description.abstract | The article briefly describes data structures and algorithms for working with disjoint sets. The use of an associative
processor with an original architecture for representing disjoint
sets and solving the dynamic connectivity problem with the
help of adapted quick-find algorithm is proposed. The presented
approach allows to achieve constant running time of basic union-
find operations and linear complexity for processing sequence of
union-find operations in any order. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.publisher | БГУИР | ru_RU |
| dc.subject | материалы конференций | ru_RU |
| dc.subject | disjoint set | ru_RU |
| dc.subject | union-find | ru_RU |
| dc.subject | quick-find | ru_RU |
| dc.subject | parallel computing | ru_RU |
| dc.subject | vector processor | ru_RU |
| dc.title | Associative processor as means of disjoint sets representation and dynamic connectivity problem solving | ru_RU |
| dc.type | Статья | ru_RU |
| Appears in Collections: | OSTIS-2018
|
