Publikace
- A phi-COMPETITIVE ALGORITHM FOR SCHEDULING PACKETS WITH DEADLINES2022 | Matematicko-fyzikální fakulta
- On packet scheduling with adversarial jamming and speedup2021 | Matematicko-fyzikální fakulta
- Packet Scheduling: Plans, Monotonicity, and the Golden Ratio2021 | Matematicko-fyzikální fakulta
- Breaking the barrier of 2 for the competitiveness of longest queue drop2021 | Matematicko-fyzikální fakulta
- Online packet scheduling with bounded delay and lookahead2019 | Matematicko-fyzikální fakulta
- A phi-Competitive Algorithm for Scheduling Packets with Deadlines2019 | Matematicko-fyzikální fakulta
- On Packet Scheduling with Adversarial Jamming and Speedup2018 | Matematicko-fyzikální fakulta
- Online Packet Scheduling with Bounded Delay and Lookahead2016 | Matematicko-fyzikální fakulta
- Approximation Guarantees for Shortest Superstrings: Simpler and Better2023 | Matematicko-fyzikální fakulta
- Improved Approximation Guarantees for Shortest Superstrings using Cycle Classification by Overlap to Length Ratios2022 | Matematicko-fyzikální fakulta
Loading network view...