STACS 2004
From MaRDI portal
Publication:5309699
DOI10.1007/b96012zbMath1122.90347OpenAlexW4236485840MaRDI QIDQ5309699
Jiří Sgall, Wojciech Jawor, Tomas Tichý, Ron Lavi, Stanley P. Y. Fung, Yair Bartal, Marek Chrobak, Francis Y. L. Chin
Publication date: 1 October 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b96012
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines, Design and analysis of online batching systems, Non-preemptive buffer management for latency sensitive packets, Randomized two-valued bounded delay online buffer management, The loss of serving in the dark, Online competitive algorithms for maximizing weighted throughput of unit jobs, Online ascending auctions for gradually expiring items, Buffer management for colored packets with deadlines, Prompt Mechanisms for Online Auctions, An optimal algorithm for 2-bounded delay buffer management with lookahead, Prompt Mechanism for Online Auctions with Multi-unit Demands, Prompt mechanism for online auctions with multi-unit demands