|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
IEEE Standard for Binary Floating-Point Arithmetic, ANSI/IEEE Std 754-1985, Institute for Electrical and Electronic Engineers, Inc., New York, 1985.
|
| |
2
|
J. L. BENTLEY, D. S. JOHNSON, F. T. LEIGHTON, AND C. C. McGEOC#, "An experimental study of bin packing," in Proc. 21st Ann. Allerton Conf. on Communication, Control, and Computing, University of Illinois, Urbana, IL, 1983, 51- 60.
|
 |
3
|
|
| |
4
|
E. G. Coffman, Jr. , C. Courcoubetis , M. R. Garey , D. S. Johnson , L. A. McGeoch , P. W. Shor , R. R. Weber , M. Yannakakis, Fundamental discrepancies between average-case analyses under discrete and continuous distributions: a bin packing case study, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.230-240, May 05-08, 1991, New Orleans, Louisiana, United States
[doi> 10.1145/103418.103446]
|
| |
5
|
E. G. COFFMAN, JR, M. HOFm, K. So, AND A. C. YAO, "A stochastic model of bin packing," Information and Control 44 (1980), 105-115.
|
| |
6
|
E. G. COFFMAN, JR AND G. S. LUEKER, Probabilistic Analysis of Packing and Partitioning, Wiley & Sons, New York, 1991.
|
| |
7
|
|
| |
8
|
G. N. FREDERICKSON, "Probabilistic analysis for simple oneand two-dimensional bin packing algorithms," Inform. Process. Lett. 11 (1980), 156-161.
|
| |
9
|
B. HAJEK, "Hitting-time and occupation-time bounds implied by drift analysis with applications," Adv. Appl. Prob. 14 (1982), 502-525.
|
| |
10
|
D. S. JOHNSON, A. DEMERS, J. D. ULLMAN, M. R. G ARt#, AND R. L. GRAHAM, "Worst case performance bounds for simple one-dimensional packing algorithms," SIAM J. Cornput. 3 (1974), 299-325.
|
| |
11
|
A. R. KARZIN, S. J. PIm.LIPS, AND P. RAGHAVAN, "Markov paging," in Proceedings 33rd Ann. Syrup. on Foundations of Computer Science,' IEEE Computer Society, Los Angeles, Calif., 1992, 208-217.
|
| |
12
|
N. KARMARKAR, "Probabilistic analysis of some bin-packing algorithms," in Proceedings 23rd Ann. Syrup. on Foumtations of Computer Science,' IEEE Computer Society, Los Angeles, Calif., 1982, 107-111.
|
| |
13
|
|
| |
14
|
H. KUSHNER, Introduction to Stochastic Control, Holt, Rinehart and Winston, Inc., New York, 1971.
|
| |
15
|
G. S. LUEKER, "An average-case analysis of bin packing with uniformly distributed item sizes," Report No. 181, Depaxtment of information and Computer Science, University of California, Irvine, CA, 1982.
|
| |
16
|
V. A. MALYSHEV, "Classification of two-dimensional positive random walks and almost-linear serni-martingale,%" Soviet Math. Dokl. 13 (1972), 136-139.
|
| |
17
|
V. A. MALYSI-IEV AND M. V. MENSHIKOV, "Ergodicity, continuity and analyticity of countable Markov chains," Trudi. Moscow Matem. Obshch 39 (1979), in Russian. English version in Tram. Moscow Math. Soc., Issue 1 (1979), 1-48.
|
| |
18
|
M. V. MENSHIKOV, "Ergodicity and transience conditions for random walks in the positive octant of space," Soviet Math. Dokl. 15 (1979),.
|
| |
19
|
|
| |
20
|
|
| |
21
|
|
CITED BY 8
|
|
Russ Bubley , Martin Dyer , Catherine Greenhill, Beating the 2&Dgr; bound for approximately counting colourings: a computer-assisted proof of rapid mixing, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.355-363, January 25-27, 1998, San Francisco, California, United States
|
|
|
Claire Kenyon , Yuval Rabani , Alistair Sinclair, Biased random walks, Lyapunov functions, and stochastic analysis of best fit bin packing, Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms, p.351-358, January 28-30, 1996, Atlanta, Georgia, United States
|
|
|
Janos Csirik , David S. Johnson , Claire Kenyon , James B. Orlin , Peter W. Shor , Richard R. Weber, On the sum-of-squares algorithm for bin packing, Proceedings of the thirty-second annual ACM symposium on Theory of computing, p.208-217, May 21-23, 2000, Portland, Oregon, United States
|
|
|
Martin Dyer , Leslie Ann Goldberg , Catherine Greenhill , Mark Jerrum , Michael Mitzenmacher, An extension of path coupling and its application to the Glauber dynamics for graph colourings (extended abstract), Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.616-624, January 09-11, 2000, San Francisco, California, United States
|
|
|
|
|
|
|
|
|
Janos Csirik , David S. Johnson , Claire Kenyon , James B. Orlin , Peter W. Shor , Richard R. Weber, On the Sum-of-Squares algorithm for bin packing, Journal of the ACM (JACM), v.53 n.1, p.1-65, January 2006
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
F.2