BibTeX record conf/icalp/MehlhornNA87

download as .bib file

@inproceedings{DBLP:conf/icalp/MehlhornNA87,
  author       = {Kurt Mehlhorn and
                  Stefan N{\"{a}}her and
                  Helmut Alt},
  editor       = {Thomas Ottmann},
  title        = {A Lower Bound for the Complexity of the Union-Split-Find Problem},
  booktitle    = {Automata, Languages and Programming, 14th International Colloquium,
                  ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {267},
  pages        = {479--488},
  publisher    = {Springer},
  year         = {1987},
  url          = {https://doi.org/10.1007/3-540-18088-5\_41},
  doi          = {10.1007/3-540-18088-5\_41},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/MehlhornNA87.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.