Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)
Peter Wang and Zoltan Somogyi. Minimizing the overheads of dependent {AND}-parallelism. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 128-138, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
@InProceedings{wang_et_al:LIPIcs.ICLP.2011.128,
author = {Wang, Peter and Somogyi, Zoltan},
title = {{Minimizing the overheads of dependent \{AND\}-parallelism}},
booktitle = {Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
pages = {128--138},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-31-6},
ISSN = {1868-8969},
year = {2011},
volume = {11},
editor = {Gallagher, John P. and Gelfond, Michael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.128},
URN = {urn:nbn:de:0030-drops-31667},
doi = {10.4230/LIPIcs.ICLP.2011.128},
annote = {Keywords: synchronization, program transformation}
}