Labeeb Asari

on the atlas — 3

• CUDA C++ Programming Guide5 savers
• Every productivity thought I've ever had, as concisely as possible - Alexey Guzey29 savers
• Justin Glibert - How I learned modern Machine Learning12 savers

highlights — 3

• At its core are three key abstractions — a hierarchy of thread groups, shared memories, and barrier synchronization

  CUDA C++ Programming Guide

• he index of a vertex's parent or child is calculated through bitwise operations on the binary representation of its index. Each element of the array contains the pre-calculated sum of a range of values, and by combining that sum with additional ranges encountered during an upward traversal to the root, the prefix sum is calculated.

  Fenwick tree

• Fenwick trees can be extended to update and query subarrays of multidimensional arrays. These operations can be performed with complexity {\displaystyle O(4^{d}\log ^{d}n)}, where {\displaystyle d} is number of dimensions and {\displaystyle n} is the number of elements along each dimension.[4]

  Fenwick tree