Alexander J. Root

Incoming Stanford CS PhD student, generously supported by the NSF GFRP.

I did my undergrad and masters at MIT under Jonathan Ragan-Kelley and Andrew Adams, where I worked on vector instruction selection, fixed-point computation, and bounds inference. I also interned with Andrew, Shoaib Kamil, and Maaz Bin Safeer Ahmad at Adobe Research on the same topics.

CV  /  Google Scholar  /  Twitter  /  Github

I am interested in domain specific languages, compilers, and architectures, particularly for numerical methods.
Much of my research in undergrad and my masters was applied to the Halide compiler.

In this paper, we propose a new algorithm that first abstracts the target platform instructions into high-level uber-instructions, with each uber-instruction unifying multiple concrete instructions from the target platform. Program synthesis is used to lift input code sequences into semantically equivalent sequences of uber-instructions and then to lower from uber-instructions to machine code.

6.818: Dynamic Computer Language Engineering, TA, Fall 2021

6.006: Introduction to Algorithms, TA, Spring 2020

6.006: Introduction to Algorithms, TA, Spring 2019

MIT MEET (Global Teaching Labs), Computer Science Instructor, January 2019

Website template stolen from Jon Barron