The following pages link to Jiří Sgall (Q170016):
Displaying 50 items.
- Online knapsack revisited (Q260271) (← links)
- Online scheduling of jobs with fixed start times on related machines (Q261353) (← links)
- A lower bound for randomized on-line multiprocessor scheduling (Q287130) (← links)
- A simple analysis of the harmonic algorithm for two servers (Q294802) (← 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)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
- Paging with connections: FIFO strikes again (Q884462) (← links)
- Randomized strategies for the plurality problem (Q1003477) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Periodic scheduling with obligatory vacations (Q1034630) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Algorithms for testing fault-tolerance of sequenced jobs (Q1041352) (← links)
- Some bounds on multiparty communication complexity of pointer jumping (Q1272658) (← links)
- Dynamic scheduling on parallel machines (Q1331960) (← links)
- (Q1377579) (redirect page) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Optimal on-line scheduling of parallel jobs with dependencies (Q1383801) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- DNF tautologies with a limited number of occurrences of every variable (Q1575269) (← links)
- Communication complexity towards lower bounds on circuit depth (Q1601024) (← links)
- Scheduling shared continuous resources on many-cores (Q1617293) (← links)
- A two-phase algorithm for bin stretching with stretching factor 1.5 (Q1680492) (← links)
- Logarithmic price of buffer downscaling on line metrics (Q1685970) (← links)
- Colored bin packing: online algorithms and lower bounds (Q1702125) (← links)
- Online bin stretching with three bins (Q1702659) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Off-line temporary tasks assignment. (Q1853487) (← links)
- Approximation schemes for scheduling on uniformly related and identical parallel machines (Q1879359) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- Lower bounds for the polynomial calculus and the Gröbner basis algorithm (Q1961057) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Bounds on pairs of families with restricted intersections (Q1977441) (← links)
- New results on multi-level aggregation (Q1998855) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- General caching is hard: even with small pages (Q2408914) (← links)
- Online packet scheduling with bounded delay and lookahead (Q2419122) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Online competitive algorithms for maximizing weighted throughput of unit jobs (Q2458928) (← links)
- An approximation scheme for cake division with a linear number of cuts (Q2460623) (← links)
- On the complexity of cake cutting (Q2467132) (← links)
- Efficient Dynamic Traitor Tracing (Q2706136) (← links)
- (Q2770587) (← links)
- (Q2785569) (← links)
- Online Control Message Aggregation in Chain Networks (Q2842151) (← links)
- Computer-Aided Complexity Classification of Dial-a-Ride Problems (Q2890414) (← links)
