SIGN IN
SIGN UP
A parallel algorithm for the maximal path problem
Full Text:
PDF
Buy this Article
Author:
R Anderson
Computer Science Department, Stanford University, Stanford, California
Published in:
· Proceeding
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Pages 33-37
ACM
New York, NY
, USA
©1985
table of contents
ISBN:0-89791-151-2
doi>
10.1145/22145.22149
1985 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 16
· Downloads (cumulative): 719
· Citation Count: 1
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
theory
verification
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