SIGN IN
SIGN UP
On the efficiency of pairing heaps and related data structures
Full Text:
PDF
Buy this Article
Author:
Michael L. Fredman
Rutgers Univ., New Brunswick, NJ
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 46 Issue 4, July 1999
Pages 473-501
ACM
New York, NY
, USA
table of contents
doi>
10.1145/320211.320214
1999 Article
Bibliometrics
· Downloads (6 Weeks): 7
· Downloads (12 Months): 51
· Downloads (cumulative): 1,128
· Citation Count: 15
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
amortized complexity analysis
fibonacci heaps
linked representations
lists, stacks, and queues
lower bounds
performance
priority queues
self-adjusting data structures
sequencing and scheduling
sorting and searching
theory
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