BibTeX record conf/stacs/DiekertLU12

download as .bib file

@inproceedings{DBLP:conf/stacs/DiekertLU12,
  author       = {Volker Diekert and
                  J{\"{u}}rn Laun and
                  Alexander Ushakov},
  editor       = {Christoph D{\"{u}}rr and
                  Thomas Wilke},
  title        = {Efficient algorithms for highly compressed data: The Word Problem
                  in Higman's group is in {P}},
  booktitle    = {29th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
  series       = {LIPIcs},
  volume       = {14},
  pages        = {218--229},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2012},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2012.218},
  doi          = {10.4230/LIPICS.STACS.2012.218},
  timestamp    = {Fri, 22 Mar 2024 08:49:35 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DiekertLU12.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.