Skip navigation

Browsing by Author Karasik, O. N.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
 
Showing results 1 to 8 of 8
Issue DateTitleAuthor(s)
2021All pairs shortest paths search in large graphsPrihozhy, A. A.; Karasik, O. N.
2024Blocked algorithm of shortest paths search in sparse graphs partitioned into unequally sized clustersPrihozhy, А. А.; Karasik, O. N.
2020Cooperative multi-thread scheduler for solving large-size tasks on multi-core systemsKarasik, O. N.; Prihozhy, A. A.
2022Inference of shortest path algorithms with spatial and temporal locality for Big Data processingPrihozhy, A. A.; Karasik, O. N.
2022Parallel blocked all-pair shortest path algorithm: block size effect on cache operation in multi-core systemKarasik, O. N.; Prihozhy, А. А.
2023Profiling of energy consumption by algorithms of shortest paths search in large dense graphsKarasik, O. N.; Prihozhy, A. A.
2024Requirements to methods of graph clustering at the aim of solving the shortest path problemKarasik, O. N.; Prihozhy, А. А.
2017Semantic model for high-level synthesis of dataflow pipelinesPrihozhy, A. A.; Karasik, O. N.; Frolov, O. M.