Pages that link to "Item:Q756873"

The following pages link to A provably efficient algorithm for dynamic storage allocation (Q756873):

Displaying 11 items.

• Average-case analysis of cutting and packing in two dimensions (Q582210) (← links)
• First-fit allocation of queues: Tight probabilistic bounds on wasted space (Q756295) (← links)
• Storage allocation under processor sharing. I: Exact solutions and asymptotics (Q972685) (← links)
• The online graph bandwidth problem (Q1198951) (← links)
• Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) (← links)
• Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767) (← links)
• An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
• Stochastic on-line knapsack problems (Q1804369) (← links)
• Asymptotic expansions for a stochastic model of queue storage (Q1884832) (← links)
• Some Exact and Asymptotic Solutions to Single Server Models of Dynamic Storage (Q2904312) (← links)
• Storage allocation under processor sharing II: Further asymptotic results (Q3081338) (← links)