Tight analyses of two local load balancing algorithms

doi:10.1145/225058.225272

Tight analyses of two local load balancing algorithms

Full Text:

Pdf

Buy this Article

Authors:	Bhaskar Ghosh	Department of Computer Science, Yale University, New Haven, CT
	F. T. Leighton	Department of Mathematics and Laboratory for Computer Science, MIT, Cambridge, MA
	Bruce M. Maggs	School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
	S. Muthukrishnan	DIMACS, Rutgers University, Piscataway, NJ
	C. Greg Plaxton	Department of Computer Science, University of Texas at Austin, Austin, TX
	R. Rajaraman	Department of Computer Science, University of Texas at Austin, Austin, TX
	Andréa W. Richa	School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
	Robert E. Tarjan	Department of Computer Science, Princeton University and NEC Research Institute, 35 Olden Street, Princeton, NJ
	David Zuckerman	Department of Computer Science, University of Texas at Austin, Austin, TX

	1995 Article
Bibliometrics
· Downloads (6 Weeks): 1 · Downloads (12 Months): 21 · Citation Count: 12

Published in:

	· Proceeding
	STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
	ACM New York, NY, USA ©1995 table of contents ISBN:0-89791-718-9 doi>10.1145/225058.225272

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- STOC'12

Tags: algorithms network problems probabilistic algorithms theory

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player