HPC - OpenCL: work efficient scan implementation
-
Updated
Jun 1, 2018 - C++
HPC - OpenCL: work efficient scan implementation
Solutions with comments for Leetcode-75
Love babbar Array sheet
This repository contains my solutions to the LeetCode Daily Challenges of August implemented in C++
A set of parallel programming primitives written in C++ and OpenMP
Here are my solutions to problems from the Yandex training in algorithms 1.0 (Golang)
Parallel and Distributed Algorithms - Project - Line-of-Sight
It is a data structure used to update and query a 2D matrix in a better way because of its good time and space complexities.
AUT Multicore Programming Course Materials
Modern practice-oriented algorithms course.
Work-efficient Parallel Prefix Scan with Blelloch Algorithm
O(1) region count queries using sparse prefix sums
Parallel Scan Algorithm Implemented with OpenMP
Collection of optimized SIMD implementations for popular patterns
Algorithmia: Backtracking, Prefix Sums problems, Multiple Knapsack problem (Dinamyc programing). Adapted BFS, Kruskal, Dijkstra implementations. Heuristics, Greedy algorithms, k-opt search.
A library for aggregating values assigned to indices by slices and the other way around
This repository contains solutions tasks in Swift from Yandex Algorithm Training 5.0, 2024
A simple parallel algorithm for computing prefix sum of an array implemented in C#
Add a description, image, and links to the prefix-sum topic page so that developers can more easily learn about it.
To associate your repository with the prefix-sum topic, visit your repo's landing page and select "manage topics."