Omer Wasim
Hi!
I am a fourth year PhD candidate at Northeastern University, in the Khoury College of Computer Sciences 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. Even before that, 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. 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
Publications
Sample Complexity of Opinion Formation in Networks. In submission. paper.
with H. Liu, R. Rajaraman, R. Sundaram, A. Vullikanti and H. Xu.
with R. Rajaraman.
Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT. FSTTCS 2020. slides. paper.
with V. King.
Theses
Preserving Large Cuts in Fully Dynamic Graphs. MSc. Thesis, University of Victoria.
Talks
University of Houston, Theory Seminar, Houston, USA. Improved Bounds for Online Balanced Graph Repartitioning.
ESA 2022, Potsdam, Germany. Improved Bounds for Online Balanced Graph Repartitioning.
FSTTCS 2020, remote. Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT.
CANADAM 2019, Vancouver, Canada. Preserving Large Cuts in Fully Dynamic Graphs.
Teaching
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.