JakobyT06'

BibTeX

@inproceedings{DBLP:conf/dagstuhl/JakobyT06,
  author    = {Andreas Jakoby and
               Till Tantau},
  title     = {Computing Shortest Paths in Series-Parallel Graphs in Logarithmic
               Space},
  booktitle = {Complexity of Boolean Functions},
  year      = {2006},
  ee        = {http://drops.dagstuhl.de/opus/volltexte/2006/618},
  crossref  = {DBLP:conf/dagstuhl/2006P6111},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@proceedings{DBLP:conf/dagstuhl/2006P6111,
  editor    = {Matthias Krause and
               Pavel Pudl{\'a}k and
               R{\"u}diger Reischuk and
               Dieter van Melkebeek},
  title     = {Complexity of Boolean Functions, 12.03. - 17.03.2006},
  booktitle = {Complexity of Boolean Functions},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {06111},
  year      = {2006},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}