Nodari Sitchinava

Computer Science · Physical Sciences

10h-index584citations47works0.22yr avg
OpenAlex↗ORCID↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Algorithms and Data Compression(20), Parallel Computing and Optimization Techniques(16), Complexity and Algorithms in Graphs(14), Computational Geometry and Mesh Generation(11), Advanced Data Storage Technologies(9)

Publications47 total

Efficient Parallel Algorithms for Hypergraph Matching
arXiv (Cornell University)·2026Open Access
Efficient Parallel Algorithms for Hypergraph Matching
arXiv (Cornell University)·2026Open Access
Eliminating Bank Conflicts in GPU Mergesort
2025· 1 citedOpen Access
A Cell Probe Lower Bound for the Predecessor Search Problem in PRAM
Society for Industrial and Applied Mathematics eBooks·2025
The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory
2024
Locality-of-Reference Optimality of Cache-Oblivious Algorithms
Society for Industrial and Applied Mathematics eBooks·2022
Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts
IEEE Transactions on Computers·2021· 4 cited
Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model
Society for Industrial and Applied Mathematics eBooks·2021· 3 citedOpen Access
Engineering Worst-Case Inputs for Pairwise Merge Sort on GPUs
2020
LCP-Aware Parallel String Sorting
Lecture notes in computer science·2020Open Access
A parallel priority queue with fast updates for GPU architectures.
arXiv (Cornell University)·2019· 1 citedOpen Access
A parallel priority queue with fast updates for GPU architectures
arXiv (Cornell University)·2019· 1 citedOpen Access
Locality
arXiv (Cornell University)·2019Open Access
Fragile Complexity of Comparison-Based Algorithms
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2019· 3 citedOpen Access
An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization
ACM Journal of Experimental Algorithmics·2018· 2 citedOpen Access
Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs
2018· 15 citedOpen Access
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Journal of Graph Algorithms and Applications·2018Open Access
Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts
2018· 8 cited
Reconstructing Generalized Staircase Polygons with Uniform Step Length
Lecture notes in computer science·2018· 1 cited
Reconstructing Generalized Staircase Polygons with Uniform Step Length
arXiv (Cornell University)·2017Open Access
page 1 of 3Next →

Frequent Co-authors

Ben Karsin(10), Peyman Afshani(9), Michael T. Goodrich(7), Henri Casanova(7), John Iacono(6), Deepak Ajwani(6), Kyle Berney(5), Peter Sanders(4), Volker Weichert(4), Norbert Zeh(4), Lars Arge(3), Riko Jacob(3), Darren Strash(3), Qin Zhang(2), Marcel Birn(2), Vitaly Osipov(2), Christian Schulz(2), David Eppstein(2), Johannes Fischer(2), Mark de Berg(2)