Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms
暂无分享,去创建一个
[1] Richard M. Karp,et al. A probabilistic analysis of multidimensional bin packing problems , 1984, STOC '84.
[2] P. Hall. On Representatives of Subsets , 1935 .
[3] J. Kiefer. On large deviations of the empiric D. F. of vector chance variables and a law of the iterated logarithm. , 1961 .
[4] W. Schmidt. On irregularities of distribution vii , 1972 .
[5] F. T. Wright. The Empirical Discrepancy Over Lower Layers and a Related Law of Large Numbers , 1981 .
[6] R. M. Dudley,et al. Empirical and Poisson processes on classes of sets or functions too large for central limit theorems , 1982 .
[7] János Komlós,et al. On optimal matchings , 1984, Comb..
[8] R. Dudley. A course on empirical processes , 1984 .
[9] Peter W. Shor. The average-case analysis of some on-line algorithms for bin packing , 1986, Comb..
[10] T. Shorey,et al. Lectures on irregularities of distribution , 1977 .
[11] W. Schmidt. Irregularities of distribution , 1968 .
[12] V. Vapnik,et al. Necessary and Sufficient Conditions for the Uniform Convergence of Means to their Expectations , 1982 .
[13] J. Blum. ON THE CONVERGENCE OF EMPIRIC DISTRIBUTION FUNCTIONS , 1955 .
[14] Frank Thomson Leighton,et al. Some unexpected expected behavior results for bin packing , 1984, STOC '84.
[15] Frank Thomson Leighton,et al. A provably efficient algorithm for dynamic storage allocation , 1986, STOC '86.
[16] J. Steele. Limit Properties of Random Variables Associated with a Partial Ordering of $R^d$ , 1977 .
[17] Frank Thomson Leighton,et al. Wafer-scale integration of systolic arrays , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[18] Amos Fiat,et al. Polymorphic Arrays: A Novel VLSI Layout for Systolic Computers , 1984, J. Comput. Syst. Sci..