https://aurivelle.github.io/tags/analysis/AnalysisHugo Blox Builder (https://hugoblox.com)en-usSun, 01 Jun 2025 00:00:00 +0000https://aurivelle.github.io/media/icon_hu_982c5d63a71b2961.pnghttps://aurivelle.github.io/tags/analysis/https://aurivelle.github.io/projects/advdshw/Sun, 01 Jun 2025 00:00:00 +0000https://aurivelle.github.io/projects/advdshw/<p>This repository is a collection of in-depth academic projects for an Advanced Data Structures course, focusing on the implementation and comparative analysis of complex algorithms.</p> <h3 id="key-components">Key Components</h3> <ul> <li><strong>BST Performance Analysis:</strong> Implemented and conducted experiments on various Binary Search Trees, including Splay Trees and Tango Trees, to analyze their performance bounds. Includes a full academic report.</li> <li><strong>Streaming Algorithms Comparison:</strong> Implemented and benchmarked classic streaming algorithms in C++, including Morris, Flajolet-Martin (FM), and HyperLogLog (HLL), to evaluate their accuracy in cardinality estimation.</li> <li><strong>DSU Theoretical Analysis:</strong> A theoretical paper analyzing a linear-time algorithm for a special case of the Disjoint Set Union (DSU) problem.</li> </ul> <p>You can view the complete source code and all academic reports from the link below:</p> <ul> <li><strong> </strong></li> <li><strong> </strong></li> <li><strong> </strong></li> <li><strong> </strong></li> </ul>