Tight bounds for minimax grid matching with applications to the average case analysis of algorithms
Authors:
- 1 June 1989
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 9 (2) , 161-187
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A provably efficient algorithm for dynamic storage allocation1986
- Wafer-Scale Integration of Systolic ArraysIEEE Transactions on Computers, 1985
- On optimal matchingsCombinatorica, 1984
- Some unexpected expected behavior results for bin packing1984
- École d'Été de Probabilités de Saint-Flour XII - 19821984
- Empirical and Poisson processes on classes of sets or functions too large for central limit theoremsProbability Theory and Related Fields, 1982
- Irregularities of distribution, VIIActa Arithmetica, 1972
- On large deviations of the empiric D. F. of vector chance variables and a law of the iterated logarithmPacific Journal of Mathematics, 1961
- On the Convergence of Empiric Distribution FunctionsThe Annals of Mathematical Statistics, 1955
- On Representatives of SubsetsJournal of the London Mathematical Society, 1935