SIGN IN
SIGN UP
How tall is a tree?
Full Text:
PDF
Buy this Article
Author:
Bruce Reed
CNRS, Paris, France
Published in:
· Proceeding
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pages 479-483
ACM
New York, NY
, USA
©2000
table of contents
ISBN:1-58113-184-4
doi>
10.1145/335305.335360
2000 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 27
· Downloads (cumulative): 356
· Citation Count: 2
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:
computations on discrete structures
design
graph and tree search strategies
performance
sorting and searching
theory
trees
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