1. An Implementation and Analysis of Fürer’s Faster Integer Multiplication Algorithm Open Access Author: Sutor, Peter Title: An Implementation and Analysis of Fürer’s Faster Integer Multiplication Algorithm Area of Honors: Computer Science Keywords: Faster Integer MultiplicationFFTSchönhage-Strassen AlgorithmDFT File: Download PeterSutor_HonorsThesis.pdf Thesis Supervisors: Martin Furer, Thesis SupervisorDr. John Joseph Hannan, Thesis Honors Advisor
2. The NP-Completeness of Finding Treewidth for Graphs and a 4-Approximation for Finding Treewidth Open Access Author: Hofman, Daniel Stephen Title: The NP-Completeness of Finding Treewidth for Graphs and a 4-Approximation for Finding Treewidth Area of Honors: Interdisciplinary in Computer Engineering and Mathematics Keywords: computer sciencegraph theorytreewidthNP-completenessapproximation algorithms File: Download Treewidth_Thesis.pdf Thesis Supervisors: Martin Furer, Thesis SupervisorChitaranjan Das, Thesis Honors AdvisorSergei Tabachnikov, Thesis Honors Advisor
