OpenAlex
PricingAboutJobs
Log inGet started
Work

An implicit binomial queue with constant insertion time

HTML

Year: 1988
Type: conference-paper
Source: Lecture notes in computer science
Parent work: SWAT 88: 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings
DOI: 10.1007/3-540-19487-8_1
Authors: Svante Carlsson, J. Ian Munro, Patricio V. Poblete
Institutions: Lund University, University of Waterloo, University of Chile
Language: English

Topic: Algorithms and Data Compression
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: priority queues, amortized analysis, worst-case analysis

Open Access status: closed
OpenAlex ID: W1535027983
FWCI: 1.494
Cites: 12
Cited by: 61
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security