BibTeX record conf/icalp/DellHW10

download as .bib file

@inproceedings{DBLP:conf/icalp/DellHW10,
  author    = {Holger Dell and
               Thore Husfeldt and
               Martin Wahlen},
  title     = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
  booktitle = {Automata, Languages and Programming, 37th International Colloquium,
               {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
               {I}},
  pages     = {426--437},
  year      = {2010},
  crossref  = {DBLP:conf/icalp/2010-1},
  url       = {https://doi.org/10.1007/978-3-642-14165-2\_37},
  doi       = {10.1007/978-3-642-14165-2\_37},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/DellHW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/icalp/2010-1,
  editor    = {Samson Abramsky and
               Cyril Gavoille and
               Claude Kirchner and
               Friedhelm Meyer auf der Heide and
               Paul G. Spirakis},
  title     = {Automata, Languages and Programming, 37th International Colloquium,
               {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
               {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {6198},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14165-2},
  doi       = {10.1007/978-3-642-14165-2},
  isbn      = {978-3-642-14164-5},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/2010-1.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics