Tight bounds for minimax grid matching with applications to the average case analysis of algorithms

This publication has 17 references indexed in Scilit:

• Polymorphic Arrays: A Novel VLSI Layout For Systolic Computers
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2005
• A provably efficient algorithm for dynamic storage allocation
  Published by Association for Computing Machinery (ACM) ,1986
• Wafer-Scale Integration of Systolic Arrays
  IEEE Transactions on Computers, 1985
• On optimal matchings
  Combinatorica, 1984
• Some unexpected expected behavior results for bin packing
  Published by Association for Computing Machinery (ACM) ,1984
• École d'Été de Probabilités de Saint-Flour XII - 1982
  Published by Springer Nature ,1984
• Empirical and Poisson processes on classes of sets or functions too large for central limit theorems
  Probability Theory and Related Fields, 1982
• On large deviations of the empiric D. F. of vector chance variables and a law of the iterated logarithm
  Pacific Journal of Mathematics, 1961
• On the Convergence of Empiric Distribution Functions
  The Annals of Mathematical Statistics, 1955
• On Representatives of Subsets
  Journal of the London Mathematical Society, 1935