This is a partial collection of side-projects that I’ve worked on.
View all projects on my GitHub page.
An algorithm that solves the problem of finding the min/max sum that a range of indices has seen across all versions of a dynamic array. Leverages the characteristic properties of persistent segment trees.
A new anonymity-preserving protocol for transaction message propagation that aims to replace diffusion (Poisson gossip with poor anonymity properties) and compete with Dandelion.
A task placement and compute resource allocation scheme for private datacenters, improving the distributed algorithm given by Chen at al. in 2014 to handle multiple task faults of the same application.
A linear time algorithm for computing a minimum distance total k-dominating set in interval graphs, based on perfect elimination ordering and bicompatible ordering.