The following pages link to STACS 2004 (Q5309699):
Displaying 12 items.
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Online ascending auctions for gradually expiring items (Q2253832) (← links)
- Prompt mechanism for online auctions with multi-unit demands (Q2355988) (← links)
- Design and analysis of online batching systems (Q2379918) (← links)
- Non-preemptive buffer management for latency sensitive packets (Q2400042) (← links)
- Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
- Randomized two-valued bounded delay online buffer management (Q2661627) (← links)
- The loss of serving in the dark (Q2680226) (← links)
- Prompt Mechanism for Online Auctions with Multi-unit Demands (Q2867113) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- Prompt Mechanisms for Online Auctions (Q5459982) (← links)
- An optimal algorithm for 2-bounded delay buffer management with lookahead (Q5925532) (← links)
