Inproceedings,
Internally deterministic parallel algorithms can be fast.
G. Blelloch, J. Fineman, P. Gibbons, and J. Shun.PPoPP, page 181-192. ACM, (2012)
Meta data
- BibTeX key
- conf/ppopp/BlellochFGS12
- entry type
- inproceedings
- booktitle
- PPoPP
- year
- 2012
- pages
- 181-192
- publisher
- ACM
- crossref
- conf/ppopp/2012
- ee
- https://doi.org/10.1145/2370036.2145840
- isbn
- 978-1-4503-1160-1
- url
- http://dblp.uni-trier.de/db/conf/ppopp/ppopp2012.html#BlellochFGS12
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/ppopp/BlellochFGS12
%A Blelloch, Guy E.
%A Fineman, Jeremy T.
%A Gibbons, Phillip B.
%A Shun, Julian
%B PPoPP
%D 2012
%E Ramanujam, J.
%E Sadayappan, P.
%I ACM
%K dblp
%P 181-192
%T Internally deterministic parallel algorithms can be fast.
%U http://dblp.uni-trier.de/db/conf/ppopp/ppopp2012.html#BlellochFGS12
%@ 978-1-4503-1160-1
@inproceedings{conf/ppopp/BlellochFGS12,
added-at = {2022-06-12T00:00:00.000+0200},
author = {Blelloch, Guy E. and Fineman, Jeremy T. and Gibbons, Phillip B. and Shun, Julian},
biburl = {https://www.bibsonomy.org/bibtex/211f0d95501550b9ba03ef4c7b6c0de2f/dblp},
booktitle = {PPoPP},
crossref = {conf/ppopp/2012},
editor = {Ramanujam, J. and Sadayappan, P.},
ee = {https://doi.org/10.1145/2370036.2145840},
interhash = {ec7852dcf11f1eac9c94552d3764d497},
intrahash = {11f0d95501550b9ba03ef4c7b6c0de2f},
isbn = {978-1-4503-1160-1},
keywords = {dblp},
pages = {181-192},
publisher = {ACM},
timestamp = {2024-04-10T01:15:39.000+0200},
title = {Internally deterministic parallel algorithms can be fast.},
url = {http://dblp.uni-trier.de/db/conf/ppopp/ppopp2012.html#BlellochFGS12},
year = 2012
}