Peter Seely | Spectral Graph Theory | Best Researcher Award

Peter Seely | Spectral Graph Theory | Best Researcher Award

Research Assistant at Brigham Young University, United states

Peter Seely is an accomplished computer scientist with a remarkable blend of academic excellence and practical experience. With a strong foundation in computer science and mathematics, Peter has demonstrated exceptional skills in both theoretical and applied aspects of computing. His work spans several programming languages and technologies, including Java, C++, Python, and AWS, showcasing his versatility and technical proficiency. Peter’s innovative research and practical projects have garnered attention for their significant impact, reflecting his commitment to advancing the field of computer science. His career trajectory includes impactful research contributions, meaningful internships, and notable personal projects, underscoring his dedication to both learning and application in technology.

Profile

Google Scholar

Education

Peter Seely earned his Bachelor of Computer Science degree from Brigham Young University (BYU) in Provo, UT, where he also completed a minor in Mathematics. During his academic tenure, he achieved the distinction of Co-Valedictorian with a perfect GPA of 4.00. His exceptional performance was further recognized by receiving a four-year National Merit Scholarship. Peter’s education at BYU provided him with a solid theoretical foundation and a comprehensive understanding of both computer science and mathematics, setting the stage for his subsequent research and professional achievements.

Experience

Peter’s professional experience includes significant roles in both research and industry settings. As a Research Assistant in the Department of Mathematics at BYU, he developed a novel quadratic-time algorithm for finding Local Equitable Partitions in graphs and optimized it to run in linear time on sparse graphs, demonstrating his ability to enhance computational efficiency. His internship as a Software Engineer at Chief Architect involved addressing user workflow bottlenecks through robust C++ solutions. Additionally, his role as an Android Developer and QA Intern at Aura Remote allowed him to implement new features and automate regression testing, showcasing his problem-solving skills and commitment to improving software development processes. Peter’s early career also included a position as a Teacher’s Assistant at DigiPen Institute of Technology, where he engaged youth in learning programming in a gamified manner, and a summer internship at Microsoft Corporation, where he contributed to optimizing bug patching processes.

Research Interest

Peter Seely’s research interests are primarily focused on algorithms, optimization, and software development. His notable research includes developing efficient algorithms for graph theory problems, particularly improving runtime performance. His work on optimizing a quadratic-time algorithm to linear time for sparse graphs reflects his deep interest in advancing computational efficiency and tackling complex theoretical problems. Peter is also interested in applying machine learning techniques to creative domains, as evidenced by his personal project involving the development of a neural network to generate Bach-inspired music, illustrating his interdisciplinary approach to research and innovation.

Awards

Peter’s academic and professional excellence has been recognized through several prestigious awards. Notably, he was awarded the title of Co-Valedictorian at BYU and received a four-year National Merit Scholarship, highlighting his exceptional academic achievements. His contributions to various projects and research have also been acknowledged, underscoring his dedication to advancing knowledge and solving complex problems in computer science.

Publication

  1. Complete Equitable Decompositions
    • Authors: J. Drapeau, J. Henderson, P. Seely, D. Smith, B. Webb
    • Journal: Linear Algebra and Its Applications
    • Year: 2024
    • Link to Publication
  2. Complete Equitable Decompositions
    • Authors: D. Smith, B. Webb, J. Drapeau, J. Henderson, P. Seely
    • Conference: 2024 Joint Mathematics Meetings (JMM 2024)
    • Year: 2024
    • Link to Conference Proceedings
  3. Equitable Partitions: A Hallmark of Real-World Networks

Conclusion

Peter Seely is highly qualified for the Research for Best Researcher Award. His strong academic background, significant research contributions, and practical experience position him as a promising candidate. To further bolster his application, he could focus on increasing his visibility in the research community through publications, showcasing the broader impact of his work, and emphasizing any leadership roles he has undertaken