The following pages link to Łukasz Jeż (Q260270):
Displaying 48 items.
- Online knapsack revisited (Q260271) (← links)
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- Better bounds for incremental frequency allocation in bipartite graphs (Q386900) (← links)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption (Q499333) (← links)
- (Q719249) (redirect page) (← links)
- Randomized competitive algorithms for online buffer management in the adaptive adversary model (Q719250) (← links)
- Validating the Knuth-Morris-Pratt failure function, fast and online (Q1678758) (← links)
- Logarithmic price of buffer downscaling on line metrics (Q1685970) (← links)
- Scheduling multipacket frames with frame deadlines (Q1702660) (← links)
- Tight bounds for double coverage against weak adversaries (Q1743121) (← links)
- A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue (Q1939283) (← links)
- Collecting weighted items from a dynamic queue (Q1939667) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- A universal randomized packet scheduling algorithm (Q2017873) (← links)
- Lower bounds on the performance of online algorithms for relaxed packing problems (Q2169944) (← links)
- Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling (Q2402672) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- Online scheduling of bounded length jobs to maximize throughput (Q2434304) (← links)
- Tight Bounds for Double Coverage Against Weak Adversaries (Q2788990) (← links)
- Online Control Message Aggregation in Chain Networks (Q2842151) (← links)
- Online scheduling of packets with agreeable deadlines (Q2933633) (← links)
- One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay (Q3092233) (← links)
- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs (Q3092234) (← links)
- Randomized Algorithm for Agreeable Deadlines Packet Scheduling. (Q3113774) (← links)
- Online Scheduling of Jobs with Fixed Start Times on Related Machines (Q3167391) (← links)
- Online Knapsack Revisited (Q3188873) (← links)
- Scheduling Multipacket Frames with Frame Deadlines (Q3460708) (← links)
- Online Scheduling of Bounded Length Jobs to Maximize Throughput (Q3558919) (← links)
- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online (Q3569737) (← links)
- Randomized Algorithms for Buffer Management with 2-Bounded Delay (Q3602832) (← links)
- Make-to-Order Integrated Scheduling and Distribution (Q4575586) (← links)
- The (<i>h</i>, <i>k</i>)-Server Problem on Bounded Depth Trees (Q4575805) (← links)
- (Q4606281) (← links)
- (Q4633927) (← links)
- (Q4636503) (← links)
- The ( <i>h,k</i> )-Server Problem on Bounded Depth Trees (Q4972671) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- Better Bounds for Online Line Chasing (Q5092366) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- Unbounded lower bound for k-server against weak adversaries (Q5145001) (← links)
- A <i>ϕ</i>-Competitive Algorithm for Scheduling Packets with Deadlines (Q5236190) (← links)
- Pricing Online Decisions: Beyond Auctions (Q5363022) (← links)
- Better Approximation Bounds for the Joint Replenishment Problem (Q5383963) (← links)
- Dynamic pricing of servers on trees (Q5875461) (← links)
- (Q5875575) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5896878) (← links)
- On packet scheduling with adversarial jamming and speedup (Q5915656) (← links)
