This Full-Stack Application (React and Springboot) was developed with the purpose of allowing a user to choose, run and compare the results of any 2 of our algorithms from our list of completed Tree Compression Algorithms that we have explored and implemented, comparing factors such as time taken and compressed image size and quality.

This Full-Stack Application (React and Springboot) was developed with the purpose of allowing a user to choose, run and compare the results of any 2 of our algorithms from our list of completed Tree Compression Algorithms that we have explored and implemented, comparing factors such as time taken and compressed image size and quality.

OCaml implementation of Zero-Suppressed Binary Decision Diagrams (ZDDs) — compressing binary decision trees via list-based and tree-based algorithms, with complexity analysis and experimental benchmarks on compression ratio and execution time.