Alexander J Root
|
PhD Candidate Department of Computer Science Stanford University Email: ajroot [at] cs [dot] stanford [dot] edu Curriculum Vitae Google Scholar GitHub |
|
About
I design compilers and programming systems that make it tractable to write high-performance code for irregular computations. My goal is to make asymptotically efficient and architecture-aware code as easy to write as naive code.
I am a PhD candidate in Computer Science at Stanford University, advised by Fredrik Kjolstad. I also work closely with Kayvon Fatahalian. I received my S.B. (2021) and M.Eng. (2022) from MIT, advised by Jonathan Ragan-Kelley, Andrew Adams, and Frédo Durand.
I have interned with NVIDIA’s Programming Systems and Applications group (2026), NVIDIA’s Real-Time Graphics group (2025), Adobe’s Programming Languages and Performance group (2021 - 2023), and Intel’s Inteon team (2021).
I am grateful for support from the NVIDIA Graduate Fellowship (2026 - 2027), the Qualcomm Innovation Fellowship (2025 - 2026), the NSF GRFP (2022 - 2025), and a Stanford School of Engineering Fellowship (2022 - 2023).
Research
High-performance applications must balance interacting tradeoffs between work, memory, and compute efficiency. I build domain-specific languages and compilers that let programmers explore these tradeoffs productively, and that optimize them automatically where possible. I am particularly interested in irregular and divergent applications, such as sparse array programming, relational algebra, and spatial queries, where the best choices are data-dependent, making them especially challenging to optimize. My past and ongoing projects explore:
- Work efficiency via fusion, for sparse array programming (Burrito [OOPSLA ‘24]), spatial queries (Bonsai [PLDI ‘26]), and relational algebra (Chimi, ongoing).
- Memory efficiency via data layout specifications, for trees (Scion [PLDI ‘26]) and tabular data (Pleach, ongoing).
- Compute efficiency on CPUs and GPUs via:
- Load balancing for sparse tensor algebra (Nacho [ASPLOS ‘27]), spatial queries (Grove [arXiv ‘26]), and relational algebra (Chimi, ongoing).
- Vectorization and instruction selection for digital signal processing (Rake [ASPLOS ‘22] and Pitchfork [ASPLOS ‘23]), spatial queries (Grove [arXiv ‘26]), and sparse tensor algebra (Taquito, ongoing).
For spatial queries, the Bonsai compiler (which includes the Scion, Grove, and Pleach extensions) explores these directions together, letting programmers productively co-optimize work, memory, and compute efficiency.
Publications
* denotes equal contribution.
| arXiv Preprint | A Compilation Model for Divergent Parallel Workloads | |
| Alexander J Root, Christophe Gyurgyik, Devanshu Ladsaria, Rohan Sawhney, Jonathan Ragan-Kelley, Andrew Adams, Matt Pharr, Kayvon Fatahalian, and Fredrik Kjolstad | ||
|
|
||
| arXiv Preprint | Composable Rewrites for Layouts of Algebraic Data Types | |
| Christophe Gyurgyik, Alexander J Root, Benjamin Driscoll, Gabriel Radanne, Fredrik Kjolstad, and Clément Pit-Claudel | ||
|
|
||
| ASPLOS 2027 | Partitioning Unstructured Sparse Tensor Algebra for Load-Balanced Parallel Execution | |
| (to appear in) Proceedings of the 32nd ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1 | ||
| Atharva Chougule*, Alexander J Root*, Rubens Lacouture, Bobby Yan, Rohan Yadav, and Fredrik Kjolstad | ||
|
|
||
| PLDI 2026 | Decoupling Data Layouts from Bounding Volume Hierarchies | |
| Proceedings of the ACM on Programming Languages, Volume 10, Issue PLDI | ||
| Christophe Gyurgyik, Alexander J Root, and Fredrik Kjolstad | ||
|
|
||
| PLDI 2026 | Bonsai: Compiling Queries to Pruned Tree Traversals | |
| Proceedings of the ACM on Programming Languages, Volume 10, Issue PLDI | ||
| Alexander J Root, Christophe Gyurgyik, Purvi Goel, Kayvon Fatahalian, Jonathan Ragan-Kelley, Andrew Adams, and Fredrik Kjolstad | ||
|
|
||
| Distinguished Paper Award | ||
| CGO 2026 | Fast Autoscheduling for Sparse ML Frameworks | |
| Proceedings of the 24th ACM/IEEE International Symposium on Code Generation and Optimization (CGO) | ||
| Bobby Yan, Alexander J Root, Trevor Gale, David Broman, and Fredrik Kjolstad | ||
|
|
||
| OOPSLA 2024 | Compilation of Shape Operators on Sparse Arrays | |
| Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA | ||
| Alexander J Root, Bobby Yan, Peiming Liu, Christophe Gyurgyik, Aart J.C. Bik, and Fredrik Kjolstad | ||
|
|
||
| OOPSLA 2024 | Compiler Support for Sparse Tensor Convolutions | |
| Proceedings of the ACM on Programming Languages, Volume 8, Issue OOPSLA | ||
| Peiming Liu, Alexander J Root, Anlun Xu, Yinying Li, Fredrik Kjolstad, and Aart J.C. Bik | ||
|
|
||
| ASPLOS 2023 | Fast Instruction Selection for Fast Digital Signal Processing | |
| Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 4 | ||
| Alexander J Root, Maaz Bin Safeer Ahmad, Dillon Sharlet, Andrew Adams, Shoaib Kamil, and Jonathan Ragan-Kelley | ||
|
|
||
| ASPLOS 2022 | Vector Instruction Selection for Digital Signal Processors Using Program Synthesis | |
| Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems | ||
| Maaz Bin Safeer Ahmad, Alexander J Root, Andrew Adams, Shoaib Kamil, and Alvin Cheung | ||
|
|
Teaching
I enjoy teaching and have been involved with compilers classes at both Stanford and MIT. I also TAed MIT’s introductory algorithms class.
|
CS 343S: Domain-Specific Language Design Studio Teaching Fellow (TF), Spring 2024 and 2025, Stanford University |
|
CS 343D: Domain-Specific Programming Models and Compilers Course Assistant (CA), Winter 2023 and 2024, Stanford University |
|
6.818: Dynamic Computer Language Engineering Teaching Assistant (TA), Fall 2021, MIT |
|
6.006: Introduction to Algorithms Teaching Assistant (TA), Spring 2019 and 2020, MIT |
|
MEET Computer Science Instructor, January 2019, MIT MEET (Global Teaching Labs) |