BibTeX record conf/mfcs/KhamisCIM0PS21

download as .bib file

@inproceedings{DBLP:conf/mfcs/KhamisCIM0PS21,
  author       = {Mahmoud Abo Khamis and
                  Ryan R. Curtin and
                  Sungjin Im and
                  Benjamin Moseley and
                  Hung Q. Ngo and
                  Kirk Pruhs and
                  Alireza Samadian},
  editor       = {Filippo Bonchi and
                  Simon J. Puglisi},
  title        = {An Approximation Algorithm for the Matrix Tree Multiplication Problem},
  booktitle    = {46th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2021, August 23-27, 2021, Tallinn, Estonia},
  series       = {LIPIcs},
  volume       = {202},
  pages        = {6:1--6:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2021.6},
  doi          = {10.4230/LIPICS.MFCS.2021.6},
  timestamp    = {Thu, 14 Oct 2021 10:37:50 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/KhamisCIM0PS21.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.