The following pages link to Kim S. Larsen (Q171931):
Displaying 50 items.
- (Q225406) (redirect page) (← links)
- Online bin packing with advice (Q261387) (← links)
- Regular expressions with nested levels of back referencing form a hierarchy (Q293228) (← links)
- Online bin covering: expectations vs. guarantees (Q300236) (← links)
- Online multi-coloring on the path revisited (Q378204) (← links)
- Better bounds on online unit clustering (Q388452) (← links)
- A comparison of performance measures for online algorithms (Q494791) (← links)
- On the list update problem with advice (Q515679) (← links)
- A theoretical comparison of LRU and LRU-K (Q611043) (← links)
- Fair versus unrestricted bin packing (Q699764) (← links)
- Randomized distributed online algorithms against adaptive offline adversaries (Q783703) (← links)
- Relaxed balance for search trees with local rebalancing (Q826105) (← links)
- The relative worst-order ratio applied to paging (Q881599) (← links)
- Competitive analysis of the online inventory problem (Q992666) (← links)
- Priority algorithms for graph optimization problems (Q1041242) (← links)
- Amortized constant relaxed rebalancing using standard rotations (Q1127819) (← links)
- A new formalism for relational algebra (Q1186599) (← links)
- Bounds on certain multiplications of affine combinations (Q1331901) (← links)
- Injectivity of composite functions (Q1333155) (← links)
- Efficient rebalancing of chromatic search trees (Q1342864) (← links)
- Amortization results for chromatic search trees, with an application to priority queues (Q1384535) (← links)
- Relaxed multi-way trees with group updates. (Q1401964) (← links)
- Relaxed red-black trees with group updates (Q1403321) (← links)
- Online-bounded analysis (Q1617274) (← links)
- Heuristic variants of \(\mathrm{A}^*\) search for 3D flight planning (Q1626759) (← links)
- How to get more out of your oracles (Q1687729) (← links)
- DNA-templated synthesis optimization (Q1694410) (← links)
- Formally proving size optimality of sorting networks (Q1694569) (← links)
- Online dominating set (Q1741855) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- On the existence and construction of non-extreme \((a,b)\)-trees. (Q1853114) (← links)
- Extending the accommodating function (Q1879376) (← links)
- List factoring and relative worst order analysis (Q1950393) (← links)
- The seat reservation problem (Q1961043) (← links)
- Online multi-coloring with advice (Q2355706) (← links)
- A comparison of performance measures via online search (Q2445866) (← links)
- Tight bounds on the competitive ratio on accommodating sequences for the seat reservation problem (Q2464382) (← links)
- The maximum resource bin packing problem (Q2508970) (← links)
- Relative interval analysis of paging algorithms on access graphs (Q2513607) (← links)
- Exponentially decreasing number of operations in balanced trees (Q2576662) (← links)
- (Q2721979) (← links)
- (Q2766831) (← links)
- The Accommodating Function: A Generalization of the Competitive Ratio (Q2784450) (← links)
- A TECHNIQUE FOR EXACT COMPUTATION OF PRECOLORING EXTENSION ON INTERVAL GRAPHS (Q2841989) (← links)
- Relative Interval Analysis of Paging Algorithms on Access Graphs (Q2842157) (← links)
- The Frequent Items Problem in Online Streaming under Various Performance Measures (Q2842773) (← links)
- Online Bin Covering: Expectations vs. Guarantees (Q2867122) (← links)
- A Comparison of Performance Measures via Online Search (Q2898005) (← links)
- Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis (Q2904568) (← links)
- (Q2921733) (← links)
