受强制性开放获取政策约束的文章 - Nodari Sitchinava了解详情
可在其他位置公开访问的文章：12 篇
Lower bounds in the asymmetric external memory model
R Jacob, N Sitchinava
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
强制性开放获取政策： US National Science Foundation
Analysis-driven engineering of comparison-based sorting algorithms on GPUs
B Karsin, V Weichert, H Casanova, J Iacono, N Sitchinava
Proceedings of the 2018 International Conference on Supercomputing, 86-95, 2018
强制性开放获取政策： US National Science Foundation, National Fund for Scientific Research, Belgium
Beyond binary search: parallel in-place construction of implicit search tree layouts
K Berney, H Casanova, B Karsin, N Sitchinava
IEEE Transactions on Computers 71 (5), 1104-1116, 2021
强制性开放获取政策： US National Science Foundation
Sorting and permuting without bank conflicts on GPUs
P Afshani, N Sitchinava
Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece …, 2015
强制性开放获取政策： Danish National Research Foundation
An efficient algorithm for the 1D total visibility-index problem and its parallelization
P Afshani, MD Berg, H Casanova, B Karsin, C Lambrechts, N Sitchinava, ...
Journal of Experimental Algorithmics (JEA) 23, 1-23, 2018
强制性开放获取政策： US National Science Foundation
LCP-aware parallel string sorting
J Ellert, J Fischer, N Sitchinava
European Conference on Parallel Processing, 329-342, 2020
强制性开放获取政策： US National Science Foundation
I/O-efficient range minima queries
P Afshani, N Sitchinava
Scandinavian Workshop on Algorithm Theory, 1-12, 2014
强制性开放获取政策： Danish National Research Foundation
Atomic power in forks: A super-logarithmic lower bound for implementing butterfly networks in the nonatomic binary fork-join model
MT Goodrich, R Jacob, N Sitchinava
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
强制性开放获取政策： US National Science Foundation
Engineering worst-case inputs for pairwise merge sort on GPUs
K Berney, N Sitchinava
2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2020
强制性开放获取政策： US National Science Foundation
Locality-of-Reference Optimality of Cache-Oblivious Algorithms∗
P Afshani, J Iacono, V Jayapaul, B Karsin, N Sitchinava
Symposium on Algorithmic Principles of Computer Systems (APOCS), 31-45, 2022
强制性开放获取政策： US National Science Foundation, National Fund for Scientific Research, Belgium
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory
N Sitchinava, R Svenning
Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and …, 2024
强制性开放获取政策： Danish Council for Independent Research
Reconstructing Generalized Staircase Polygons with Uniform Step Length
N Sitchinava, D Strash
International Symposium on Graph Drawing and Network Visualization, 88-101, 2017
强制性开放获取政策： US National Science Foundation
出版信息和资助信息由计算机程序自动确定