SIGN IN
SIGN UP
A lattice-structured proof of a minimum spanning
Full Text:
PDF
Buy this Article
Authors:
Jennifer L. Welch
Laboratory for Computer Science, Massachusetts Institute of Technology
Leslie Lamport
Digital Equipment Corporation, Systems Research Center
Nancy Lynch
Laboratory for Computer Science, Massachusetts Institute of Technology
Published in:
· Proceeding
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Pages 28-43
ACM
New York, NY
, USA
©1988
table of contents
ISBN:0-89791-277-2
doi>
10.1145/62546.62552
1988 Article
Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 289
· Citation Count: 7
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
PODC '13
Share:
|
Tags:
algorithms
complexity of proof procedures
concurrency
design
distributed systems
performance
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