Shideh Hashemian
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Shideh Hashemian has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Amir Shaikhha
University of Edinburgh, Edinburgh, United Kingdom
2 shared publications - Michael F. P. O'Boyle
University of Edinburgh, Edinburgh, United Kingdom
2 shared publications - Alexander Brauckmann
University of Edinburgh, Edinburgh, United Kingdom
1 shared publication - Elizabeth Polgreen
University of Edinburgh
1 shared publication - Jackson Woodruff
University of Edinburgh, Edinburgh, United Kingdom
1 shared publication - José Wesley de Souza Magalhães
University of Edinburgh, Edinburgh, United Kingdom
1 shared publication
Latest Publications
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 106-118
Accelerating Sparse Algebra with Program Synthesis
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 106-118
Open AccessAccelerating Sparse Algebra with Program Synthesis
- Open Access
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 27-39
Optimizing Sparse Tensor Compilation for Sparse Output
- 28 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 27-39
Open AccessOptimizing Sparse Tensor Compilation for Sparse Output
- Open Access
- 16 October 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 7 (OOPSLA2) , 204-233
Compiling Structured Tensor Algebra
Tensor algebra is essential for data-intensive workloads in various computational domains. Computational scientists face a trade-off between the specialization degree provided by dense tensor algebra and the algorithmic efficiency that leverages the structure provided by sparse tensors. This paper presents StructTensor, a framework that symbolically computes structure at compilation time. This is enabled by Structured Tensor Unified Representation (STUR), an intermediate language that can capture tensor computations as well as their sparsity and redundancy structures. Through a mathematical view of lossless tensor computations, we show that our symbolic structure computation and the related optimizations are sound. Finally, for different tensor computation workloads and structures, we experimentally show how capturing the symbolic structure can result in outperforming state-of-the-art frameworks for both dense and sparse tensor algebra.
- 16 October 2023
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Programming Languages
- Vol. 7 (OOPSLA2) , 204-233
Open AccessCompiling Structured Tensor Algebra
Tensor algebra is essential for data-intensive workloads in various computational domains. Computational scientists face a trade-off between the specialization degree provided by dense tensor algebra and the algorithmic efficiency that leverages the structure provided by sparse tensors. This paper presents StructTensor, a framework that symbolically computes structure at compilation time. This is enabled by Structured Tensor Unified Representation (STUR), an intermediate language that can capture tensor computations as well as their sparsity and redundancy structures. Through a mathematical view of lossless tensor computations, we show that our symbolic structure computation and the related optimizations are sound. Finally, for different tensor computation workloads and structures, we experimentally show how capturing the symbolic structure can result in outperforming state-of-the-art frameworks for both dense and sparse tensor algebra.