Fredrik Kjolstad
where else to find them
what they talk about
all 5 in the filters
where they keep going back
- OOPSLA4 editions2020–2025
- PLDI Workshop Honoring Andreas Podelski2 editions2023–2026
all 4 in the filters
on a stage with
all 31 in the filters
who talks about the same things
- Alexander J Root4 talks
- Saman Amarasinghe13 talks
- Stephen Chou5 talks
- Peiming Liu2 talks
- Aart Bik3 talks
- Christophe Gyurgyik3 talks
| title | conference | date |
|---|---|---|
| Bonsai: Compiling Queries to Pruned Tree Traversals | PLDI 2026 | 2026-06-15 |
Bonsai compiles high-level queries plus an annotated algebraic tree spec into C++ single-pass traversals that automatically generate always/maybe/never pruning… | ||
| A Compiler for Fused Relational Operations on Multisets | PLDI 2026 | 2026-06-15 |
A compiler lowers physical query plans into an abstract loop IR that fuses inner joins, left/right/full outer joins, non‑equi joins, set ops and multiset (bag)… | ||
| Decoupling Data Layouts from Bounding Volume Hierarchies | PLDI 2026 | 2026-06-15 |
Scion DSL and compiler separate BVH logical ADTs from physical memory layouts and automatically specialize traversal with destructor and constructor… | ||
| REPTILE: Performant Tiling of Recurrences | OOPSLA 2025 | 2025-10-16 |
REPTILE is a compiler that tiles mathematical recurrences by decomposing programs into unique hierarchical tiles, simplifying each tile into its own… | ||
| Compiling Recurrences over Dense and Sparse Arrays | OOPSLA 2024 | 2024-10-20 |
A compiler framework that takes recurrence equations, data-format declarations, and schedule commands and emits native C for dense and sparse arrays by… | ||
| Compiler Support for Sparse Tensor Convolutions | OOPSLA 2024 | 2024-10-20 |
Compiler extends sparse tensor algebra compilation to handle affine subscripts by rewriting compound indices into loop-driven subsection iterators and five… | ||
| Compilation of Shape Operators on Sparse Arrays | OOPSLA 2024 | 2024-10-20 |
A compiler called burrito extends the taco compiler to emit specialized C++ iterators that traverse reshaped sparse formats without materializing temporaries… | ||
| Four Languages for Portability | Sparse 2024 | 2024-06-25 |
Argues that four domain-agnostic collection languages — relations, graphs, tensors, space — map to a single set-iteration IR that composes, fuses and tiles… | ||
| Challenges with Hardware-Software Co-design for Sparse Machine Learning on (...) Dataflow | PLARCH 2023 | 2023-06-17 |
Extends the Sparse Abstract Machine (SAM) and a dataflow accelerator model to handle real ML models, adds new hardware primitives (filter block, unary-value… | ||
| Indexed Streams: A Formal Intermediate Representation for Fused Contraction Programs | PLDI 2023 | 2023-06-17 |
A formal operational IR called index streams models sparse tensors and relations as transition systems with index, value, ready and skip functions… | ||
| Mosaic: An Interoperable Compiler for Tensor Algebra | PLDI 2023 | 2023-06-17 |
Mosaic is a Taco-based compiler that binds tensor expressions to external library or compiler functions via a scheduling API, substitutes bound subexpressions… | ||
| Copy-and-Patch Compilation | OOPSLA 2021 | 2021-10-17 |
Copy-and-patch compiles by copying prebuilt binary stencils into memory and patching relocations and constants at runtime, shifting heavy work to build time. A… | ||
| Compilation of Sparse Array Programming Models | OOPSLA 2021 | 2021-10-17 |
A compiler built on TACO generates C-like code from array index notation and a format language that supports arbitrary fill values, lifts operators into an… | ||
| A Sparse Iteration Space Transformation Framework for Sparse Tensor Algebra | OOPSLA 2020 | 2020-11-15 |
Framework implements sparse iteration-space transformations inside TACO and a CUDA backend and generates fused sparse kernels (SpMV, SpMM, SDDMM, MTTKRP) that… | ||
| nothing matches | ||