Fredrik Kjolstad
Assistant Professor of Computer Science
Builds compilers for sparse tensor algebra and array programming used in scientific computing and machine learning.
Fredrik Kjolstad's lab at Stanford works on compilers & programming languages and physics, climate & scientific computing. 30 papers since 2023, 21 at top venues, mostly PACMPL and ASPLOS. 9 PhD students. 4 alumni. Applications close .
At a glance
- papers, 2023–2026
- 8/ year
- at T1 venues
- 70%
- PhD students
- 9
- MS students
- 0
- alumni listed
- 4
Papers by yearfrom the lab homepage, 2023–2026
- 8 papers2026 · T1 6 · collecting
- 7 papers2025 · T1 5
- 7 papers2024 · T1 6
- 8 papers2023 · T1 4
T1 venuesOtherVenues: PACMPL, ASPLOS, MICRO, HPCA, ISCA
Research focuspaper titles that use each topic's words
- algebra4 papers
- Compilers & programming languages2 papers
- Physics, climate & scientific computing1 paper
- used0 papers
- scientific computing0 papers
Paper list
From the lab homepage.
20268 papers
- PACMPL (T1)A Compiler for Fused Relational Operations on Multisets
- PACMPL (T1)Bonsai: Compiling Queries to Pruned Tree Traversals
- PACMPL (T1)Decoupling Data Layouts from Bounding Volume Hierarchies
- PACMPL (T1)Deegen: A JIT-Capable VM Generator for Dynamic Languages
- CGOEmber: A Compiler for Embedding Operations on Decoupled Access-Execute Architectures
- CGOFast Autoscheduling for Sparse ML Frameworks
- ASPLOS (T1)FuseFlow: A Fusion-Centric Compilation Framework for Sparse Deep Learning on Streaming Dataflow
- OSDI (T1)Optimal Software Pipelining and Warp Specialization for Tensor Core GPUs
20257 papers
- MICRO (T1)A Probabilistic Perspective on Tiling Sparse Tensor Algebra
- ASPLOS (T1)Automatic Tracing in Task-Based Runtime Systems
- ASPLOS (T1)Composing Distributed Computations Through Task and Kernel Fusion
- MICRO (T1)Designing Programmable Accelerators for Sparse Tensor Algebra
- IEEE Journal of Solid-State CircuitsOnyx: A 12-nm Programmable Accelerator for Dense and Sparse Applications
- PACMPL (T1)REPTILE: Performant Tiling of Recurrences
- CGOStardust: Compiling Sparse Tensor Algebra to a Reconfigurable Dataflow Architecture
20247 papers
- HPCA (T1)(HPCA), March 2024
- PACMPL (T1)Compilation of Shape Operators on Sparse Arrays
- PACMPL (T1)Compiler Support for Sparse Tensor Convolutions
- PACMPL (T1)Genghan Zhang (opens in a new tab)
- PACMPL (T1)Muhammad Usman Tariq
- VLSIOnyx: A 12nm 756 GOPS/W Coarse-Grained Reconfigurable Array for Accelerating Dense and Sparse Applications
- ISCA (T1)The Dataflow Abstract Machine Simulator Framework
20238 papers
- TECSAHA: An agile approach to the design of coarse-grained reconfigurable accelerators and compilers
- ASPLOS (T1)BaCO: A Fast and Portable Bayesian Compiler Optimization Framework
- PACMPL (T1)Indexed Streams: A Formal Intermediate Representation for the Fused Execution of Contraction Operations
- SCLegate Sparse: Distributed Sparse Computing in Python
- CGOLooplets: A Language For Structured Coiteration
- PACMPL (T1)Mosaic: An Interoperable Compiler for Tensor Algebra
- ASPLOS (T1)The Sparse Abstract Machine
- TACOUnified Buffer: Compiling Image Processing and Machine Learning Applications to Push-Memory Accelerators
Where alumni went4 listed
Apply to StanfordFall 2027
Stanford Computer Science PhD
- Round
- Single round
- Opens
- GRE
- See program page
- English
- TOEFL/IELTS
- Fee
- See program page
Confirmed on the program page.
Similar labsnearest by research summary
- CNTsinghua
Shengen Yan
18 T1 - USUCSD
Yufei Ding
- Compilers & programming languages
- HKCUHK
Henry Hong Xu
31 T1 - USUIUC
Naresh R Shanbhag
- Accelerators, chips & architecture
- CHEPFL
Mahsa Shoaran
- Accelerators, chips & architecture
- USUIUC
Minjia Zhang
- Efficient training & inference
Your notes
Save this lab to keep notes.
Data
Checked against the lab homepage.
- Collected
- Verified
- Papers
- The lab homepage
- Members
- Lab homepage
- Alumni
- Lab homepage
Tiers are venue classifications, not lab rankings.
Stanfordcloses