BibTeX
@inproceedings{DBLP:conf/stacs/Bollig03,
author = {Beate Bollig},
title = {Complexity Theoretical Results on Nondeterministic Graph-Driven
Read-Once Branching Programs},
booktitle = {STACS},
year = {2003},
pages = {295-306},
ee = {http://dx.doi.org/10.1007/3-540-36494-3_27},
crossref = {DBLP:conf/stacs/2003},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/stacs/2003,
editor = {Helmut Alt and
Michel Habib},
title = {STACS 2003, 20th Annual Symposium on Theoretical Aspects
of Computer Science, Berlin, Germany, February 27 - March
1, 2003, Proceedings},
booktitle = {STACS},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {2607},
year = {2003},
isbn = {3-540-00623-0},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2009-10-06 by Michael Ley (ley@uni-trier.de)