@misc{indiciae6a4861a13d92,
  title = {Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations},
  author = {Al Daas, Hussam [Rutherford Appleton Laboratory, Didcot (United Kingdom of Great Britain and Northern Ireland)] (ORCID:0000000193554042) and Ballard, Grey [Wake Forest University, Winston-Salem, NC (United States)] (ORCID:0000000315578027) and Grigori, Laura [Institute of Mathematics, Lausanne (Switzerland); PSI Center for Scientific Computing, Theory and Data, Villigen (Switzerland)] (ORCID:0000000258801076) and Kumar, Suraj [Institut national de recherche en sciences et technologies du numérique, Lyon (France)] (ORCID:0009000114490165) and Rouse, Kathryn [Inmar Intelligence, Winston-Salem, NC (United States)] (ORCID:0009000140450423) and Verite, Mathieu [Institute of Mathematics, Lausanne (Switzerland)] (ORCID:0000000305812772)},
  year = {2025},
  doi = {10.1145/3727344},
  url = {https://www.osti.gov/biblio/3367486},
  note = {Source identifier: 3367486}
}