@inproceedings{DBLP:conf/wg/BilardiPD00,
author = {Gianfranco Bilardi and
Andrea Pietracaprina and
Paolo D'Alberto},
title = {On the Space and Access Complexity of Computation DAGs},
booktitle = {WG},
year = {2000},
pages = {47-58},
ee = {http://dx.doi.org/10.1007/3-540-40064-8_6},
crossref = {DBLP:conf/wg/2000},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/wg/2000,
editor = {Ulrik Brandes and
Dorothea Wagner},
title = {Graph-Theoretic Concepts in Computer Science, 26th International
Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000,
Proceedings},
booktitle = {WG},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {1928},
year = {2000},
isbn = {3-540-41183-6},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2009-06-09 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
