Generating adversaries for request-answer games

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generating adversaries for request-answer games

Full text

Pdf (208 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms table of contents

San Francisco, California, United States

Pages: 564 - 565

Year of Publication: 2000

ISBN:0-89871-453-2

Authors

Todd Gormley	Department of Computer Science and Engineering, Michigan State University
Nicholas Reingold	AT&T Research, Florham Park A015, 180 Park Avenue, P. O. Box 971, Florham Park, NJ
Eric Torng	Department of Computer Science and Engineering, 3115 Engineering Building, Michigan State University, East Lansing, MI
Jeffery Westbrook	AT&T Research, Florham Park A001, 180 Park Avenue, P.O. Box 971, Florham Park, NJ

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 22, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

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	Susanne Albers, Better bounds for online scheduling, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.130-139, May 04-06, 1997, El Paso, Texas, United States [doi>10.1145/258533.258566]
	2	Yair Bartal , Howard Karloff , Yuval Rabani, A better lower bound for on-line scheduling, Information Processing Letters, v.50 n.3, p.113-116, May 9, 1994 [doi>10.1016/0020-0190(94)00026-3]
	3	S. Ben-David , A. Borodin , R. Karp , G. Tardos , A. Wigderson, On the power of randomization in online algorithms, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.379-386, May 13-17, 1990, Baltimore, Maryland, United States [doi>10.1145/100216.100268]
	4	B. Chen, A. van Vliet, and G. Woeginger. New lower and upper bounds for on-line scheduling. Operations Research Letters, 16:221-230, 1994.
	5	Mark Manasse , Lyle McGeoch , Daniel Sleator, Competitive algorithms for on-line problems, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.322-333, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62243]

CITED BY 6

	Steve Seiden, Barely random algorithms for multiprocessor scheduling, Journal of Scheduling, v.6 n.3, p.309-334, May/June 2003
	T. C. Edwin Cheng , Hans Kellerer , Vladimir Kotov, Semi-on-line multiprocessor scheduling with given total processing time, Theoretical Computer Science, v.337 n.1-3, p.134-146, 9 June 2005
	Susanne Albers, On randomized online scheduling, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
	Yossi Azar , Amir Epstein , Leah Epstein, Load balancing of temporary tasks in the lp norm, Theoretical Computer Science, v.361 n.2, p.314-328, 1 September 2006
	Leah Epstein , Rob Van Stee, Online scheduling of splittable tasks, ACM Transactions on Algorithms (TALG), v.2 n.1, p.79-94, January 2006
	Christopher J. Osborn , Eric Torng, List's worst-average-case or WAC ratio, Journal of Scheduling, v.11 n.3, p.213-215, June 2008