SIGN IN
SIGN UP
Compress-and-conquer for optimal multicore computing
Full Text:
Pdf
Buy this Article
Authors:
Zhijing G. Mou
Sinovate, LLC, Seatle, WA, USA
Hai Liu
Yale University, New Haven, CT, USA
Paul Hudak
Yale University, New Haven, CT, USA
Published in:
· Proceeding
DAMP '10
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
Pages 35-44
ACM
New York, NY
, USA
©2010
table of contents
ISBN: 978-1-60558-859-9
doi>
10.1145/1708046.1708055
2010 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 31
· Downloads (cumulative): 206
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
POPL '14
Share:
|
Tags:
algorithms
compress and conquer
divide and conquer
functional programming
languages
multicore programming
parallel computing
parallel programming
programming paradigm
scan
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder