BibTeX record conf/soda/AbboudBFK24

download as .bib file

@inproceedings{DBLP:conf/soda/AbboudBFK24,
  author       = {Amir Abboud and
                  Karl Bringmann and
                  Nick Fischer and
                  Marvin K{\"{u}}nnemann},
  editor       = {David P. Woodruff},
  title        = {The Time Complexity of Fully Sparse Matrix Multiplication},
  booktitle    = {Proceedings of the 2024 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2024, Alexandria, VA, USA, January 7-10, 2024},
  pages        = {4670--4703},
  publisher    = {{SIAM}},
  year         = {2024},
  url          = {https://doi.org/10.1137/1.9781611977912.167},
  doi          = {10.1137/1.9781611977912.167},
  timestamp    = {Thu, 04 Apr 2024 19:38:10 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/AbboudBFK24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.