SIGN IN
SIGN UP
On dynamic tree growing in hypercubes
Full Text:
PDF
Buy this Article
Author:
Keqin Li
Department of Mathematics and Computer Science, State University of New York, New Paltz, New York
Published in:
· Proceeding
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Pages 496-503
ACM
New York, NY
, USA
©1997
table of contents
ISBN:0-89791-850-9
doi>
10.1145/331697.332338
1997 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 3
· Downloads (cumulative): 63
· Citation Count: 3
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
dynamic load distribution
hypercube
interconnection architectures
measurement
performance
probabilistic analysis
probabilistic computation
random walk
randomized tree embedding
recurrence relation
theory
trees
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