I am a PhD candidate in Computer Science at Northeastern University, where I am fortunate to be advised by Rajmohan Rajaraman.
Before coming to Boston, I completed my MSc. in Computer Science from the University of Victoria, where I was advised by Valerie King. I completed my undergraduate studies at the University of Hong Kong, during which I was lucky to spend a year abroad at the University of Chicago.
I am broadly interested in theoretical computer science and algorithms. My past and current research is on online, dynamic and distributed algorithms, and algorithms with predictions. Most of my work deals with obtaining provably fast and competitive algorithms in the face of uncertainty and evolving inputs.
Here is a CV.
Email: wasim(dot)o@northeastern.edu
with S. Behnezhad and R. Rajaraman.
with R. Rajaraman.
Sample Complexity of Linear Regression Models for Opinion Formation in Networks. In AAAI '25. paper.
with H. Liu, R. Rajaraman, R. Sundaram, A. Vullikanti and H. Xu.
with R. Rajaraman.
with R. Rajaraman.
Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT. FSTTCS '20. paper.
with V. King.
Preserving Large Cuts in Fully Dynamic Graphs. MSc. Thesis, University of Victoria.
ESA '24, London, UK. Competitive Capacitated Online Recoloring.
University of Houston, Theory Seminar, Houston, USA. Improved Bounds for Online Balanced Graph Repartitioning.
ESA '22, Potsdam, Germany. Improved Bounds for Online Balanced Graph Repartitioning.
FSTTCS '20, remote. Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT.
CANADAM '19, Vancouver, Canada. Preserving Large Cuts in Fully Dynamic Graphs.
Teaching Assistant for CS 3000: Algorithms and Data, September-December 2021 at Northeastern University.
Course instructor for CSC 320: Foundations of Computer Science, May-August 2020 at the University of Victoria.
Teaching Assistant for CSC 320: Foundations of Computer Science, CSC 425: Advanced Algorithms, and CSC 423: Randomized Algorithms at the University of Victoria.