The following pages link to Jiří Sgall (Q170016):
Displaying 50 items.
- A Lower Bound on Deterministic Online Algorithms for Scheduling on Related Machines without Preemption (Q2896382) (← links)
- Open Problems in Throughput Scheduling (Q2912821) (← links)
- (Q2921752) (← links)
- The greedy algorithm for the minimum common string partition problem (Q2944502) (← links)
- (Q2957914) (← links)
- (Q3002790) (← links)
- Better Bounds for Incremental Frequency Allocation in Bipartite Graphs (Q3092234) (← links)
- Two-Bounded-Space Bin Packing Revisited (Q3092235) (← links)
- Online Scheduling of Jobs with Fixed Start Times on Related Machines (Q3167391) (← links)
- (Q3359762) (← links)
- On the Nonlearnability of a Single Spiking Neuron (Q3370746) (← links)
- Better Algorithms for Online Bin Stretching (Q3453280) (← links)
- Online Colored Bin Packing (Q3453281) (← links)
- Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms (Q3453298) (← links)
- Online Scheduling of Equal-Length Jobs on Parallel Machines (Q3527232) (← links)
- (Q3579372) (← links)
- A Lower Bound for Scheduling of Unit Jobs with Immediate Decision on Parallel Machines (Q3602828) (← links)
- Three Results on Frequency Assignment in Linear Cellular Networks (Q3638448) (← links)
- (Q3751573) (← links)
- (Q3765768) (← links)
- (Q3981829) (← links)
- (Q3984103) (← links)
- (Q3990239) (← links)
- (Q3990240) (← links)
- (Q4224901) (← links)
- (Q4250210) (← links)
- (Q4252304) (← links)
- Boolean Circuits, Tensor Ranks, and Communication Complexity (Q4337651) (← links)
- (Q4375799) (← links)
- (Q4418654) (← links)
- Functions that have read‐twice constant width branching programs are not necessarily testable (Q4459589) (← links)
- (Q4501565) (← links)
- (Q4535068) (← links)
- Some bounds on multiparty communication complexity of pointer jumping (Q4593967) (← links)
- (Q4606281) (← links)
- (Q4636503) (← links)
- (Q4737209) (← links)
- (Q4875173) (← links)
- Solution of a covering problem related to labelled tournaments (Q4894614) (← links)
- Randomized On-line Scheduling of Parallel Jobs (Q4895802) (← links)
- (Q4938775) (← links)
- Multiprocessor Scheduling with Rejection (Q4943705) (← links)
- (Q4952673) (← links)
- Improved online algorithms for buffer management in QoS switches (Q4962690) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- On-line scheduling of parallel jobs (Q5096875) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- Optimal Analysis of Best Fit Bin Packing (Q5167762) (← links)
- Online Bin Packing: Old Algorithms and New Results (Q5175911) (← links)
- A <i>ϕ</i>-Competitive Algorithm for Scheduling Packets with Deadlines (Q5236190) (← links)
