SIGN IN
SIGN UP
Scalable concurrent priority queue algorithms
Full Text:
PDF
Buy this Article
Authors:
Nir Shavit
Tel-Aviv University and M.I.T.
Asaph Zemach
Tel-Aviv University and Tera Computer Company
Published in:
· Proceeding
PODC '99
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Pages 113-122
ACM
New York, NY
, USA
©1999
table of contents
ISBN:1-58113-099-6
doi>
10.1145/301308.301339
1999 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 16
· Downloads (cumulative): 611
· 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:
PODC '13
Share:
|
Tags:
algorithms
distributed architectures
experimentation
performance
queueing theory
scheduling
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