Colorful illustrations of algorithmic design techniques and problem solving

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Colorful illustrations of algorithmic design techniques and problem solving

Full text

Pdf (141 KB)

Source

Technical Symposium on Computer Science Education archive
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education table of contents

Charlotte, North Carolina, United States

Pages: 425 - 426

Year of Publication: 2001

ISBN:1-58113-329-4

Also published in ...

Authors

David Ginat	Tel-Aviv University
Dan Garcia	University of California at Berkeley
Owen Astrachan	Duke University
Joseph Bergin	Pace University

Sponsor

SIGCSE: ACM Special Interest Group on Computer Science Education

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 23, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

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

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/364447.364814 What is a DOI?

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	R. G. Dromey, How to Solve It by Computer, Prentice-Hall, Inc., Upper Saddle River, NJ, 1982
	2	Udi Manber, Introduction to Algorithms: A Creative Approach, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
	3	Polya, George, How to Solve It, Princeton University Press, 1971 (re-issue).