Algorithm design

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm design

Full text

Pdf (967 KB)

Source

Communications of the ACM archive
Volume 30 , Issue 3 (March 1987) table of contents

Pages: 204 - 212

Year of Publication: 1987

ISSN:0001-0782

Author

Robert E. Tarjan

Computer Science Dept., Princeton University, Princeton, NJ and AT&T Bell Laboratories, Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

abstract 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/214748.214752 What is a DOI?

ABSTRACT

The quest for efficiency in computational methods yields not only fast algorithms, but also insights that lead to elegant, simple, and general problem-solving methods.

CITED BY

Michael C. Loui, Strategic directions in research in theory of computing, ACM Computing Surveys (CSUR), v.28 n.4, p.575-590, Dec. 1996

INDEX TERMS

Primary Classification:
F. Theory of Computation
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY