When massive stars die, they unleash some of the most powerful explosions in the universe. Yet not all supernovae are created ...

TsPytham.DotNet.AdvancedCollections provides production-ready data structures that are not included in System.Collections, designed with clean APIs, modern C# features, and performance in mind. This ...

lstr is a fast, minimalist and feature-rich tree command alternative to get a clean, uncluttered directory tree view with optional icons, permissions, file sizes, and .gitignore support for a superior ...

Abstract: Binary search trees (BSTs) are one of the most important data structures in computer science. A parallel construction algorithm of a BST can be easily derived from the sequential algorithm.

The game of Go has long been viewed as the most challenging of classic games for artificial intelligence owing to its enormous search space and the difficulty of evaluating board positions and moves.

Licensed under the GNU GPL version 3 or at your option any later version. If you need another licensing option please contact me directly. In my academic research some of the algorithms I work on ...