Weiyun (Anna) Ma

Mail:	Gates Computer Science Building 353 Jane Stanford Way Stanford, CA 94305, USA
Email:	wyma at cs dot stanford dot edu

I am a PhD student at the Department of Computer Science, Stanford University. I am broadly interested in Theoretical Computer Science, including distributed and parallel computation, large-scale graph algorithms, and approximation algorithms. I am fortunate to be advised by Moses Charikar.

Prior to that, I was an undergraduate student at Harvey Mudd College, where I was fortunate to work with Ran Libeskind-Hadas.

Research Papers

• Single-Pass Streaming Algorithms for Correlation Clustering

  With Soheil Behnezhad, Moses Charikar, and Li-Yang Tan
  SODA 2023

• Almost 3-Approximate Correlation Clustering in Constant Rounds

  With Soheil Behnezhad, Moses Charikar, and Li-Yang Tan
  FOCS 2022

• Brief Announcement: A Randomness-Efficient Massively Parallel Algorithm for Connectivity

  With Moses Charikar and Li-Yang Tan
  PODC 2021

• Unconditional Lower Bounds for Adaptive Massively Parallel Computation

  With Moses Charikar and Li-Yang Tan
  SPAA 2020

• The Power of Many Samples in Query Complexity

  With Andrew Bassilakis, Andrew Drucker, Mika Göös, Lunjia Hu, and Li-Yang Tan
  ICALP 2020

• DTL-RnB: Algorithms and Tools for Summarizing the Space of DTL Reconciliations

  With Dmitriy Smirnov, Juliet Forman, Annalise Schweickart, Carter Slocum, Srinidhi Srinivasan, and Ran Libeskind-Hadas
  IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), 2018

• DTL Reconciliation Repair

  With Dmitriy Smirnov and Ran Libeskind-Hadas
  BMC Bioinformatics, 2017