The following pages link to Marek Chrobak (Q287139):
Displayed 49 items.
- On some packing problem related to dynamic storage allocation (Q3830539) (← links)
- A New Approach to the Server Problem (Q3977290) (← links)
- On fast algorithms for two servers (Q3988823) (← links)
- (Q4010306) (← links)
- (Q4028881) (← links)
- Optimal Parallel 5-Colouring of Planar Graphs (Q4207597) (← links)
- (Q4250167) (← links)
- (Q4250169) (← links)
- Generosity Helps or an 11-Competitive Algorithm for Three Servers (Q4285911) (← links)
- Page Migration Algorithms Using Work Functions (Q4349701) (← links)
- (Q4418654) (← links)
- A randomized algorithm for gossiping in radio networks (Q4458725) (← links)
- (Q4501565) (← links)
- (Q4535068) (← links)
- (Q4551385) (← links)
- Competitive analysis of randomized paging algorithms (Q4595503) (← links)
- (Q4606281) (← links)
- (Q4633927) (← links)
- (Q4636503) (← links)
- (Q4728262) (← links)
- (Q4737209) (← links)
- (Q4763407) (← links)
- (Q4779149) (← links)
- A Greedy Approximation Algorithm for Minimum-Gap Scheduling (Q4924641) (← links)
- LP-Rounding Algorithms for the Fault-Tolerant Facility Placement Problem (Q4924666) (← links)
- Competitive Algorithms for Relaxed List Update and Multilevel Caching (Q4943079) (← links)
- Improved online algorithms for buffer management in QoS switches (Q4962690) (← links)
- A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines (Q5048294) (← links)
- (Q5092366) (← links)
- Online Algorithms for Multilevel Aggregation (Q5130492) (← links)
- Group Search on the Line (Q5175102) (← links)
- A <i>ϕ</i>-Competitive Algorithm for Scheduling Packets with Deadlines (Q5236190) (← links)
- STACS 2004 (Q5309699) (← links)
- STACS 2004 (Q5309739) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313049) (← links)
- Better Approximation Bounds for the Joint Replenishment Problem (Q5383963) (← links)
- The Wake‐Up Problem in MultiHop Radio Networks (Q5422495) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431308) (← links)
- Online Scheduling of Equal‐Length Jobs: Randomization and Restarts Help (Q5432368) (← links)
- Better Bounds for Incremental Medians (Q5443384) (← links)
- Algorithms – ESA 2004 (Q5464579) (← links)
- Automata, Languages and Programming (Q5466476) (← links)
- (Q5501363) (← links)
- Computing and Combinatorics (Q5716986) (← links)
- Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms (Q5941271) (← links)
- A Simple Algorithm for Optimal Search Trees with Two-way Comparisons (Q6058229) (← links)
- Better hardness results for the minimum spanning tree congestion problem (Q6091160) (← links)
- Classification via two-way comparisons (extended abstract) (Q6179419) (← links)
- An Omega(n^2) Lower Bound for Random Universal Sets for Planar Graphs (Q6323902) (← links)