SIGN IN
SIGN UP
Information theoretic implications for pairing heaps
Full Text:
Pdf
Buy this Article
Author:
Michael L. Fredman
Dept. of Computer Science--Hill Center, Rutgers University, New Brunswick, NJ
Published in:
· Proceeding
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-962-9
doi>
10.1145/276698.276779
1998 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 4
· Citation Count: 0
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
Share:
|
Tags:
algorithms
design
experimentation
languages
trees
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