Abstract: Partition-and-Recur PAR method is a simple and useful formal method used to design and prove algorithmic programs. In this paper, we address that PAR method is really an effective formal ...

Abstract: This paper presents a parallel algorithm for the maximum sub array problem implemented on a machine with GPUs. Given a sequence of numbers, the maximum subsequence is a contiguous ...

This project provides an efficient in-memory B-tree implementation in pure Swift, and several useful sorted collection types that use B-trees for their underlying storage. Map<Key, Value> implements a ...

This repository will also work as a diary for GSOC. There will be issue for GSOC aspirants, who can complete those tasks daily for increasing their chances of selection in GSOC. All other rules are ...