BibTeX record conf/stacs/DasKS18

download as .bib file

@inproceedings{DBLP:conf/stacs/DasKS18,
  author       = {Debarati Das and
                  Michal Kouck{\'{y}} and
                  Michael E. Saks},
  editor       = {Rolf Niedermeier and
                  Brigitte Vall{\'{e}}e},
  title        = {Lower Bounds for Combinatorial Algorithms for Boolean Matrix Multiplication},
  booktitle    = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
                  2018, February 28 to March 3, 2018, Caen, France},
  series       = {LIPIcs},
  volume       = {96},
  pages        = {23:1--23:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2018},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2018.23},
  doi          = {10.4230/LIPICS.STACS.2018.23},
  timestamp    = {Wed, 07 Dec 2022 23:12:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DasKS18.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.