SIGN IN
SIGN UP
Using smoothness to achieve parallelism
Full Text:
PDF
Buy this Article
Authors:
Leonard Adleman
Department of Computer Science, University of Southern California
Kireeti Kompella
Department of Computer Science, University of Southern California
Published in:
· Proceeding
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Pages 528-538
ACM
New York, NY
, USA
©1988
table of contents
ISBN:0-89791-264-0
doi>
10.1145/62212.62264
1988 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 191
· Citation Count: 2
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algorithms
parallel algorithms
parallelism and concurrency
smoothing
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