The following pages link to Marek Chrobak (Q287139):
Displayed 50 items.
- Item:Q287139 (redirect page) (← links)
- A better lower bound on the competitive ratio of the randomized 2-server problem (Q287141) (← links)
- A simple analysis of the harmonic algorithm for two servers (Q294802) (← links)
- Better bounds for incremental frequency allocation in bipartite graphs (Q386900) (← links)
- LP-rounding algorithms for the fault-tolerant facility placement problem (Q491622) (← links)
- Better bounds for incremental medians (Q627114) (← links)
- A low-cost memory remapping scheme for address bus protection (Q666092) (← links)
- A linear-time algorithm for drawing a planar graph on a grid (Q673676) (← links)
- Caching is hard -- even in the fault model (Q692624) (← links)
- Randomized competitive algorithms for online buffer management in the adaptive adversary model (Q719250) (← links)
- Connectivity vs. reachability (Q757048) (← links)
- A waste-efficient algorithm for single-droplet sample preparation on microfluidic chips (Q782157) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- A note on scheduling equal-length jobs to maximize throughput (Q880531) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- A data structure useful for finding Hamiltonian cycles (Q909446) (← links)
- Competitive analysis of scheduling algorithms for aggregated links (Q930606) (← links)
- Three results on frequency assignment in linear cellular networks (Q1041229) (← links)
- Algorithms for testing fault-tolerance of sequenced jobs (Q1041352) (← links)
- The reverse greedy algorithm for the metric k-median problem (Q1045901) (← links)
- A note on bounded-reversal multipushdown machines (Q1057071) (← links)
- A characterization of reversal-bounded multipushdown machine languages (Q1058865) (← links)
- Variations on the technique of Ďuriš and Galil (Q1064791) (← links)
- Finite automata and unary languages (Q1099644) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Remarks on string-matching and one-way multihead automata (Q1108049) (← links)
- k\(+1\) heads are better than k for PDAs (Q1109579) (← links)
- A note on random sampling (Q1113669) (← links)
- A note on the server problem and a benevolent adversary (Q1178219) (← links)
- Planar orientations with low out-degree and compaction of adjacency matrices (Q1178710) (← links)
- HARMONIC is 3-competitive for two servers (Q1193886) (← links)
- Minimum-width grid drawings of plane graphs (Q1265328) (← links)
- LRU is better than FIFO (Q1277395) (← links)
- Two results on linear embeddings of complete binary trees (Q1367522) (← links)
- More on randomized on-line algorithms for caching. (Q1401208) (← links)
- On tiling under tomographic constraints. (Q1401222) (← links)
- Preemptive scheduling in overloaded systems. (Q1401985) (← links)
- Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730) (← links)
- Competitive analysis of randomized paging algorithms (Q1575677) (← links)
- Computing simple paths among obstacles (Q1594600) (← links)
- Reconstructing \(hv\)-convex polyominoes from orthogonal projections (Q1606912) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Faster information gathering in ad-hoc radio tree networks (Q1742375) (← links)
- Tile-packing tomography is \(\mathbb{NP}\)-hard (Q1759658) (← links)
- More on random walks, electrical networks, and the harmonic \(k\)-server algorithm. (Q1853151) (← links)
- The 3-server problem in the plane. (Q1853532) (← links)
- A randomized algorithm for two servers on the line. (Q1854341) (← links)
- The weighted 2-server problem (Q1887090) (← links)
- A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue (Q1939283) (← links)