SIGN IN
SIGN UP
Highly parallelizable problems
Full Text:
PDF
Buy this Article
Authors:
O. Berkman
Department of Computer Science, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel 69978 and Institute for Advanced Computer Studies, University of Maryland, College Park, Md
Z. Galil
Department of Computer Science, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel 69978 and Department of Computer Science, Columbia University, New York, NY
B. Schieber
IBM Research Division, Thomas J. Watson Research, Center, P.O. Box 218, Yorktown Heights, NY
U. Vishkin
Department of Computer Science, Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel 69978 and Institute for Advanced Computer Studies, University of Maryland, College Park, Md ...
1989 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 17
· Downloads (cumulative): 435
· Citation Count: 22
Published in:
· Proceeding
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pages 309-319
ACM
New York, NY
, USA
©1989
table of contents
ISBN:0-89791-307-8
doi>
10.1145/73007.73036
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
parallelism and concurrency
reducibility and completeness
theory
unbounded-action devices
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