The following pages link to Nodari Sitchinava (Q2842140):
Displaying 15 items.
- On (Dynamic) Range Minimum Queries in External Memory (Q2842141) (← links)
- Empirical Evaluation of the Parallel Distribution Sweeping Framework on Multicore Architectures (Q2849293) (← links)
- On the Complexity of List Ranking in the Parallel External Memory Model (Q2922625) (← links)
- Sorting, Searching, and Simulation in the MapReduce Framework (Q3104632) (← links)
- I/O-Efficient Range Minima Queries (Q3188877) (← links)
- Sorting and Permuting without Bank Conflicts on GPUs (Q3452764) (← links)
- Geometric Algorithms for Private-Cache Chip Multiprocessors (Q3586385) (← links)
- Guard placement for efficient point-in-polygon proofs (Q3602853) (← links)
- An Efficient Algorithm for the 1D Total Visibility-Index Problem and Its Parallelization (Q4555537) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4625103) (← links)
- Reconstructing Generalized Staircase Polygons with Uniform Step Length (Q4961754) (← links)
- Fragile complexity of comparison-based algorithms (Q5075734) (← links)
- Beyond Binary Search: Parallel In-Place Construction of Implicit Search Tree Layouts (Q5095057) (← links)
- An Efficient Algorithm for the 1D Total Visibility-Index Problem (Q5232583) (← links)
- (Q6147384) (← links)