Pages that link to "Item:Q5901639"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901639):
Displaying 7 items.
- A note on sorting buffers offline (Q417998) (← links)
- NP-hardness of the sorting buffer problem on the uniform metric (Q427885) (← links)
- Buffer management for colored packets with deadlines (Q693758) (← links)
- Exploiting locality: Approximating sorting buffers (Q925070) (← links)
- Online and offline algorithms for the sorting buffers problem on the line metric (Q2266935) (← links)
- Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities (Q3448831) (← links)
- Almost Tight Bounds for Reordering Buffer Management (Q5864670) (← links)
