SIGN IN
SIGN UP
A combinatorial treatment of balancing networks
Full Text:
PDF
Buy this Article
Authors:
Costas Busch
Department of Computer Science, University of Crete, Heraklion 71110, Greece and Institute of Computer Science, Foundation of Research and Technology, Heraklion 71110, Greece
Marios Mavronicolas
Institute of Computer Science, Foundation of Research and Technology, Greece and Department of Computer Science, University of Cyprus, Nicosia, Cyprus
Published in:
· Proceeding
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Pages 206-215
ACM
New York, NY
, USA
©1994
table of contents
ISBN:0-89791-654-9
doi>
10.1145/197917.198092
1994 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 119
· Citation Count: 8
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
combinatorial algorithms
distributed networks
distributed systems
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