Sparse

The Sparse workshop (formerly CTSTA) aims to bring together researchers interested in compiler techniques, programming abstractions, and hardware for sparse computing including sparse tensor algebra, relational algebra, and graph processing applications. Due to the large number of applications, optimization techniques, types of data structures, and specialized hardware, there is a need for automation. In recent years, there has been a lot of interest in compiler techniques to automatically generate sparse computing code. This workshop aims to bring together leading researchers from academia and industry for talks on applications, code generation, source code transformation and optimization, automatic scheduling, data structure modeling, compilation to different types of hardware, specialized accelerators, extensions to new types of sparse array operations, and applying the techniques beyond sparsity to areas such as lossless compression. The workshop will last one day and will include invited talks, discussion, and a small number of submitted talks.

Call for Talks

We are soliciting​ 15 minute​ talks for Sparse 2024 on the topics in the workshop description.​ The talks can be technical,​ on new​ ideas,​ on your thoughts ​about​ future ​needs​, or other topics you are excited about. There will not be a proceeding, so the talks will not require a submitted paper.​​ If you are interested, please submit your talk here. The organization committee will also identify researchers in relevant areas to give invited talks.