OpenAlex
PricingAboutJobs
Log inGet started
Work

Packet Buffering: Randomization Beats Deterministic Algorithms

HTML

Year: 2005
Type: conference-paper
Source: Lecture notes in computer science
Parent work: STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005. Proceedings
DOI: 10.1007/978-3-540-31856-9_24
Author: Markus Schmidt
Institution: University of Freiburg
Language: English

Topic: Optimization and Search Problems
Subfield: Theoretical Computer Science
Field: Mathematics
Domain: Physical Sciences
Keywords: packet buffering, online algorithms, randomized algorithms, competitive ratio, buffering capacity, greedy algorithm, lower bounds, competitive analysis

Open Access status: closed
OpenAlex ID: W1587641343
FWCI: 4.056
Cites: 21
Cited by: 33
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
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security