The following pages link to Sandy Irani (Q494790):
Displaying 39 items.
- A comparison of performance measures for online algorithms (Q494791) (← links)
- The subset assignment problem for data placement in caches (Q724230) (← links)
- Strip packing with precedence constraints and strip packing with release times (Q837172) (← links)
- The power of quantum systems on a line (Q842451) (← links)
- Probabilistic analysis for scheduling with conflicts (Q924143) (← links)
- Randomized algorithms for metrical task systems (Q1127546) (← links)
- Two results on the list update problem (Q1178243) (← links)
- A competitive 2-server algorithm (Q1182124) (← links)
- Combinatorial and experimental results for randomized point matching algorithms (Q1286470) (← links)
- Coloring inductive graphs on-line (Q1312187) (← links)
- (Q1361411) (redirect page) (← links)
- On algorithm design for metrical task systems (Q1361412) (← links)
- Competitive paging with locality of reference (Q1892219) (← links)
- A competitive analysis for the start-gap algorithm for online memory wear leveling (Q2224854) (← links)
- Scheduling with conflicts on bipartite and interval graphs (Q2464395) (← links)
- On-line algorithms for the dynamic traveling repair problem (Q2464421) (← links)
- (Q3191569) (← links)
- Optimal Power-Down Strategies (Q3532574) (← links)
- On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? (Q4000866) (← links)
- (Q4010318) (← links)
- Bounding the Power of Preemption in Randomized Scheduling (Q4210081) (← links)
- (Q4234110) (← links)
- (Q4471271) (← links)
- (Q4527039) (← links)
- The Subset Assignment Problem for Data Placement in Caches. (Q4636518) (← links)
- Reversing trains: A turn of the century sorting problem (Q4729371) (← links)
- (Q4763411) (← links)
- (Q4801181) (← links)
- (Q4828977) (← links)
- (Q4875172) (← links)
- (Q4886074) (← links)
- Strongly Competitive Algorithms for Paging with Locality of Reference (Q4887013) (← links)
- On the Value of Coordination in Distributed Decision Making (Q4887014) (← links)
- Algorithms for power savings (Q4962680) (← links)
- Randomized algorithms for metrical task systems (Q5057430) (← links)
- The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems (Q5171167) (← links)
- Cache Replacement with Memory Allocation (Q5232515) (← links)
- Ground state entanglement in one-dimensional translationally invariant quantum systems (Q5246514) (← links)
- (Q5501806) (← links)
