Helen Xu

Office: MIT CSAIL, 32-G770.
Email: hjxu at mit dot edu
Online presence: Google Scholar and Linkedin.
orcid.org/0000-0003-2232-3305

About me

I am a PhD student in the Supertech group at MIT and am fortunate to be advised by Charles Leiserson.
I graduated with a BS in Computer Science and Applied Math at Stony Brook University, where I was lucky to have the opportunity to work with Michael Bender and Rob Johnson.
I finished my SM at MIT in 2018. My thesis "Fill Estimation for Blocked Sparse Matrices and Tensors" can be found here.
I spent Summer 2019 at Microsoft Research in Cambridge, UK with Dr. Nuno Lopes.
I visited ENS Lyon from January to March 2020 under a Chateubriand Fellowship.
I spent Summer 2020 at NVIDIA Research working with Michael Pellauer.
My research interests include parallel computing, cache-efficient algorithms, and performance engineering.

Papers

1. A Parallel Packed Memory Array to Store Dynamic Graphs
   with Brian Wheatman
         ALENEX 21


2. *Beyond Worst-case Analysis of Multicore Caching Strategies
   with Shahin Kamali
         APOCS 21


3. Work-Efficient Parallel Algorithms for Accurate Floating-Point Prefix Sums
   with Sean Fraser and Charles E. Leiserson
         HPEC 20


4. *Brief Announcement: Multicore Paging Algorithms Cannot Be Competitive
   with Shahin Kamali
         SPAA 20 [paper]


5. *Closing the Gap Between Cache-oblivious and Cache-adaptive Analysis
   with Michael A. Bender, Rezaul A. Chowdhury, Rathish Das, Rob Johnson, William Kuszmaul, Andrea Lincoln, Quanquan C. Liu, and Jayson Lynch
         SPAA 20 [paper]


6. *Dynamic Programming with Spiking Neural Computing
   with James Aimone, Ojas Parekh, Cynthia Phllips, Ali Pinar, and William Severa
         ICONS 19 [paper] [ACM]


7. Packed Compressed Sparse Row: A Dynamic Graph Representation
   with Brian Wheatman
         HPEC 18 [paper]


8. *Cache-Adaptive Exploration: Experimental Results and Scan-Hiding for Adaptivity
   with Andrea Lincoln, Quanquan C. Liu, and Jayson Lynch
         SPAA 18 [paper] [ACM]


9. A Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
   with Peter Ahrens and Nicholas Schiefer
         IPDPS 18 [paper]


10. *Write-Optimized Skip Lists
    with Michael A. Bender, Martin Farach-Colton, Rob Johnson, Simon Mauras, Tyler Mayer, and Cynthia Phillips
          PODS 17 [paper] [ACM]
* denotes author lists in alphabetical order.

Teaching

Other