Pages that link to "Item:Q1262767"

The following pages link to Tight bounds for minimax grid matching with applications to the average case analysis of algorithms (Q1262767):

Displayed 21 items.

• Continuum limit of total variation on point clouds (Q261295) ‎ (← links)
• A variational approach to the consistency of spectral clustering (Q723005) ‎ (← links)
• A provably efficient algorithm for dynamic storage allocation (Q756873) ‎ (← links)
• Gravitational allocation to Poisson points (Q990185) ‎ (← links)
• The average-case analysis of some on-line algorithms for bin packing (Q1100912) ‎ (← links)
• Packings in two dimensions: Asymptotic average-case analysis of algorithms (Q1209735) ‎ (← links)
• Constructions of majorizing measures, Bernoulli processes and cotype (Q1343333) ‎ (← links)
• Average-case performance analysis of a 2D strip packing algorithm -- NFDH (Q1774522) ‎ (← links)
• Dilation bootstrap (Q2448413) ‎ (← links)
• Monotone properties of random geometric graphs have sharp thresholds (Q2496499) ‎ (← links)
• The spectrum of a random geometric graph is concentrated (Q2641416) ‎ (← links)
• Exact Bounds for the Stochastic Upward Matching Problem (Q3806444) ‎ (← links)
• Exact Bounds for the Stochastic Upward Matching Problem (Q3808933) ‎ (← links)
• Optimal Matching and Empirical Measures (Q4206152) ‎ (← links)
• Matching Theorems and Empirical Discrepancy Computations using Majorizing Measures (Q4292711) ‎ (← links)
• (Q4487093) ‎ (← links)
• Linear waste of best fit bin packing on skewed distributions (Q4537630) ‎ (← links)
• (Q4638245) ‎ (← links)
• Belief Propagation for MiniMax Weight Matching (Q5356967) ‎ (← links)
• Analysis of Stochastic Online Bin Packing Processes (Q5462796) ‎ (← links)
• Bin Packing with Queues (Q5504150) ‎ (← links)