{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T02:57:27Z","timestamp":1725677847650},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2000,5]]},"DOI":"10.1145\/335305.335385","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T16:40:52Z","timestamp":1069778452000},"page":"592-601","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["A guessing game and randomized online algorithms"],"prefix":"10.1145","author":[{"given":"Steven S.","family":"Seiden","sequence":"first","affiliation":[{"name":"Department of Computer Science, 298 Coates Hall, Louisiana State University, Baton Rouge, LA and Max-Planck-Institut for Computer Science"}]}],"member":"320","published-online":{"date-parts":[[2000,5]]},"reference":[{"key":"e_1_3_2_1_1_2","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0906"},{"key":"e_1_3_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258667"},{"key":"e_1_3_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294260"},{"key":"e_1_3_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796507"},{"key":"e_1_3_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.5555\/791230.792292"},{"key":"e_1_3_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2775"},{"key":"e_1_3_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146588"},{"key":"e_1_3_2_1_9_2","first-page":"609","volume-title":"Proceedings of the 8th A CM-SIAM Symposium on Discrete Algorithms","author":"Chekuri C.","year":"1997","unstructured":"C. Chekuri , R. Motwani , B. Natarajan , and C. Stein . Approximation techniques for average completion time scheduling . In Proceedings of the 8th A CM-SIAM Symposium on Discrete Algorithms , pages 609 - 618 , 1997 .]] C. Chekuri, R. Motwani, B. Natarajan, and C. Stein. Approximation techniques for average completion time scheduling. In Proceedings of the 8th A CM-SIAM Symposium on Discrete Algorithms, pages 609-618, 1997.]]"},{"key":"e_1_3_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(97)00040-0"},{"key":"e_1_3_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276792"},{"key":"e_1_3_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335408"},{"key":"e_1_3_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/646717.756914"},{"key":"e_1_3_2_1_14_2","volume-title":"Manuscript","author":"Fleischer R.","year":"1999","unstructured":"R. Fleischer and S. S. Selden . Page replication-- Variations on a theme . Manuscript , 1999 .]] R. Fleischer and S. S. Selden. Page replication-- Variations on a theme. Manuscript, 1999.]]"},{"key":"e_1_3_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/645587.659604"},{"key":"e_1_3_2_1_16_2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/978-3-540-48413-4_18","volume-title":"Randomization, Approximation, and Combinatorial Optimization- Algorithms and Techniques","author":"Imreh C.","year":"1999","unstructured":"C. Imreh and J. Noga . Scheduling with machine cost . In Randomization, Approximation, and Combinatorial Optimization- Algorithms and Techniques , pages 168 - 176 , 1999 .]] C. Imreh and J. Noga. Scheduling with machine cost. In Randomization, Approximation, and Combinatorial Optimization- Algorithms and Techniques, pages 168- 176, 1999.]]"},{"key":"e_1_3_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01189993"},{"key":"e_1_3_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762111"},{"key":"e_1_3_2_1_19_2","unstructured":"J. Noga. Unpublished manuscript Jun 1999.]] J. Noga. Unpublished manuscript Jun 1999.]]"},{"key":"e_1_3_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.5555\/645589.756529"},{"key":"e_1_3_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009875403874"},{"key":"e_1_3_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1998.2744"},{"key":"e_1_3_2_1_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_24_2","volume-title":"Manuscript","author":"Stougie L.","year":"1997","unstructured":"L. Stougie and A. P. A. Vestjens . Randomized on-line scheduling: How low can't you go ? Manuscript , 1997 .]] L. Stougie and A. P. A. Vestjens. Randomized on-line scheduling: How low can't you go? Manuscript, 1997.]]"},{"key":"e_1_3_2_1_26_2","volume-title":"Theory of games and economic behavior","author":"Von Neumann J.","year":"1944","unstructured":"J. Von Neumann and O. Morgenstern . Theory of games and economic behavior . Princeton University Press , 1 st edition, 1944 .]] J. Von Neumann and O. Morgenstern. Theory of games and economic behavior. Princeton University Press, 1st edition, 1944.]]","edition":"1"},{"key":"e_1_3_2_1_27_2","first-page":"222","volume-title":"Proceedings of the 18th IEEE Symposium on Foundations of Computer Science","author":"Yao A. C.","year":"1977","unstructured":"A. C. Yao . Probabilistic computations : Toward a unified measure of complexity . In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science , pages 222 - 227 , 1977 .]] A. C. Yao. Probabilistic computations: Toward a unified measure of complexity. In Proceedings of the 18th IEEE Symposium on Foundations of Computer Science, pages 222-227, 1977.]]"}],"event":{"name":"STOC00: The 32nd Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Portland Oregon USA","acronym":"STOC00"},"container-title":["Proceedings of the thirty-second annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/335305.335385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T07:40:51Z","timestamp":1673422851000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/335305.335385"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,5]]},"references-count":25,"alternative-id":["10.1145\/335305.335385","10.1145\/335305"],"URL":"https:\/\/doi.org\/10.1145\/335305.335385","relation":{},"subject":[],"published":{"date-parts":[[2000,5]]},"assertion":[{"value":"2000-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}