Dynamic Scan: Driving Down the Cost of Test. - Samitha Samaranayake; Nodari Sitchinava; Rohit Kapur; Minesh B. Amin; Thomas W. Williams (Computer, 2002)

A Reconfigurable Shared Scan-in Architecture. - Samitha Samaranayake; Emil Gizdarski; Nodari Sitchinava; Frederic Neuveux; Rohit Kapur; Thomas W. Williams (VTS, 2003)

Changing the Scan Enable during Shift. - Nodari Sitchinava; Samitha Samaranayake; Rohit Kapur; Emil Gizdarski; Frederic Neuveux; Thomas W. Williams (VTS, 2004)

Guard Placement For Wireless Localization - David Eppstein; Michael T. Goodrich; Nodari Sitchinava (CoRR, 2006)

Guard placement for efficient point-in-polygon proofs. - David Eppstein; Michael T. Goodrich; Nodari Sitchinava (SCG, 2007)

Fundamental parallel algorithms for private-cache chip multiprocessors. - Lars Arge; Michael T. Goodrich; Michael J. Nelson 002; Nodari Sitchinava (SPAA, 2008)

Geometric Algorithms for Private-Cache Chip Multiprocessors - (Extended Abstract). - Deepak Ajwani; Nodari Sitchinava; Norbert Zeh (ESA (2), 2010)

Parallel external memory graph algorithms. - Lars Arge; Michael T. Goodrich; Nodari Sitchinava (IPDPS, 2010)

I/O-Optimal Distribution Sweeping on Private-Cache Chip Multiprocessors. - Deepak Ajwani; Nodari Sitchinava; Norbert Zeh (IPDPS, 2011)

Sorting, Searching, and Simulation in the MapReduce Framework. - Michael T. Goodrich; Nodari Sitchinava; Qin Zhang 001 (ISAAC, 2011)

A parallel buffer tree. - Nodari Sitchinava; Norbert Zeh (SPAA, 2012)

Computational geometry in the parallel external memory model. - Nodari Sitchinava (ACM SIGSPATIAL Special, 2012)

Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures. - Deepak Ajwani; Nodari Sitchinava (ESA, 2013)

Efficient Parallel and External Matching. - Marcel Birn; Vitaly Osipov; Peter Sanders 001; Christian Schulz 003; Nodari Sitchinava (Euro-Par, 2013)

On (Dynamic) Range Minimum Queries in External Memory. - Lars Arge; Johannes Fischer 001; Peter Sanders 001; Nodari Sitchinava (WADS, 2013)

Provably Efficient GPU Algorithms. - Nodari Sitchinava; Volker Weichert (CoRR, 2013)

On the Complexity of List Ranking in the Parallel External Memory Model. - Riko Jacob; Tobias Lieber; Nodari Sitchinava (MFCS (2), 2014)

I/O-Efficient Range Minima Queries. - Peyman Afshani; Nodari Sitchinava (SWAT, 2014)

Sorting and Permuting without Bank Conflicts on GPUs. - Peyman Afshani; Nodari Sitchinava (ESA, 2015)

Efficient Batched Predecessor Search in Shared Memory on GPUs. - Ben Karsin; Henri Casanova; Nodari Sitchinava (HiPC, 2015)

Introduction to the Special Issue on SPAA 2014. - Friedhelm Meyer auf der Heide; Peter Sanders 001; Nodari Sitchinava (ACM Trans. Parallel Comput., 2016)

An Efficient Algorithm for the 1D Total Visibility-Index Problem. - Peyman Afshani; Mark de Berg; Henri Casanova; Benjamin Karsin; Colin Lambrechts; Nodari Sitchinava; Constantinos Tsirogiannis (ALENEX, 2017)

Lower Bounds in the Asymmetric External Memory Model. - Riko Jacob; Nodari Sitchinava (SPAA, 2017)

An Efficient Multiway Mergesort for GPU Architectures. - Henri Casanova; John Iacono; Ben Karsin; Nodari Sitchinava; Volker Weichert (CoRR, 2017)

Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs. - Ben Karsin; Volker Weichert; Henri Casanova; John Iacono; Nodari Sitchinava (ICS, 2018)

Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts. - Kyle Berney; Henri Casanova; Alyssa Higuchi; Ben Karsin; Nodari Sitchinava (IPDPS, 2018)

An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization. - Peyman Afshani; Mark de Berg; Henri Casanova; Ben Karsin; Colin Lambrechts; Nodari Sitchinava; Constantinos Tsirogiannis (ACM J. Exp. Algorithmics, 2018)

Reconstructing Generalized Staircase Polygons with Uniform Step Length. - Nodari Sitchinava; Darren Strash (J. Graph Algorithms Appl., 2018)

Fragile Complexity of Comparison-Based Algorithms. - Peyman Afshani; Rolf Fagerberg; David Hammer; Riko Jacob; Irina Kostitsyna; Ulrich Meyer 001; Manuel Penschuck; Nodari Sitchinava (ESA, 2019)

A parallel priority queue with fast updates for GPU architectures. - John Iacono; Ben Karsin; Nodari Sitchinava (CoRR, 2019)

LCP-Aware Parallel String Sorting. - Jonas Ellert; Johannes Fischer 001; Nodari Sitchinava (Euro-Par, 2020)

Engineering Worst-Case Inputs for Pairwise Merge Sort on GPUs. - Kyle Berney; Nodari Sitchinava (IPDPS, 2020)

Atomic Power in Forks: A Super-Logarithmic Lower Bound for Implementing Butterfly Networks in the Nonatomic Binary Fork-Join Model. - Michael T. Goodrich; Riko Jacob; Nodari Sitchinava (SODA, 2021)

Locality-of-Reference Optimality of Cache-Oblivious Algorithms. - Peyman Afshani; John Iacono; Varunkumar Jayapaul; Ben Karsin; Nodari Sitchinava (APOCS, 2022)

Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts. - Kyle Berney; Henri Casanova; Ben Karsin; Nodari Sitchinava (IEEE Trans. Computers, 2022)

The All Nearest Smaller Values Problem Revisited in Practice, Parallel and External Memory. - Nodari Sitchinava; Rolf Svenning (SPAA, 2024)

A Cell Probe Lower Bound for the Predecessor Search Problem in PRAM. - Peyman Afshani; Nodari Sitchinava (SODA, 2025)

Eliminating Bank Conflicts in GPU Mergesort. - Kyle Berney; Nodari Sitchinava (SPAA, 2025)