SIGN IN
SIGN UP
Optimal parallel generation of a computation tree form
Full Text:
Pdf
Buy this Article
Authors:
Ilan Bar-on
Courant Institute of Mathematical Sciences
Uzi Vishkin
Tel Aviv Univ., Tel Aviv, Israel
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
TOPLAS Homepage
archive
Volume 7 Issue 2, April 1985
Pages 348 - 357
ACM
New York, NY
, USA
table of contents
doi>
10.1145/3318.3478
1985 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 14
· Downloads (cumulative): 350
· Citation Count: 8
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
computations on discrete structures
graph algorithms
parallelism and concurrency
performance
theory
trees
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