|
Randomized Graph Algorithms
Laryn Qi
Personal, Summer 2023
Implementations of various popular randomized graph algorithms. Topics and problems covered include  Cover Time ,  Min Cut ,  Stopping Time ,  Approximate Max Cut ,  and  Approximate Independent Set . Also includes an incomplete implementation of the first approximation algorithm for Minimum Balanced Cut by Spielman and Teng.
|
|
Cuts on Graphs: Applications and Variations
Josh Jones,
Brandon Tran,
Laryn Qi
CS 270, Spring 2023
We present a survey on state-of-the-art cut algorithms. Topics and problems covered include  Fair Cuts ,  Minimum Balanced Cut ,  and  Sparsest Cut .
|
|
CS 61A: The Structure and Interpretation of Computer Programs
Lecturer: Summer 2022
     • Sample lecture slides
     • Sample exam
     • Course evaluations
Head TA:
Fall 2023,
Spring 2023,
Fall 2022,
Spring 2022
     • Sample discussion slides
     • TA evaluations
TA:
Fall 2021,
Summer 2020
     • Teaching website
Tutor:
Summer 2023,
Summer 2021,
Spring 2021,
Fall 2020
Academic Intern:
Spring 2020
|
|
CS106A – Code in Place: Programming Methodologies
Section Leader:
Spring 2021,
Spring 2020
|
Awards & Honors
[Spring 2023] Outstanding Graduate Student Instructor (OGSI) Award.
[Spring 2023] Top 6.5% in CS 189 (Machine Learning) Kaggle competition (>700 students). Trained an SVM model to classify CIFAR-10 data with 56% accuracy.
[Fall 2021] Top 6% in CS 170 (Algorithms) Final Project competition (>700 students). Designed a greedy algorithm implemented with dynamic programming to approximate an NP-hard problem. Generated and tested heuristics on the cloud.
[Spring 2021] Upsilon Pi Epsilon (UPE). International CS Honor Society. Top third of Berkeley CS majors.
[Spring 2020] CS 61A Outstanding Academic Intern. Awarded to top 9 out of over 130 Academic Interns for exemplary teaching.
|
Work Experience
Amazon, Threat Intelligence
Software Development Engineer Intern, Summer 2021
|
Last updated September 6, 2023.
|
|