Practical Aspects of Doubly Chained Trees for Retrieval

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Practical Aspects of Doubly Chained Trees for Retrieval

Full text

Pdf (615 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 3 (July 1972) table of contents

Pages: 425 - 436

Year of Publication: 1972

ISSN:0004-5411

Author

L. E. Stanfel

University of Texas at Arlington, Arlington, Texas and Colorado State University, Fort Collins, Colorado

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references index terms

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/321707.321713 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	LEHMER, D. The machine tools of combinatorics. In Applied Combinatorial Analysis, E. Beckenbach, Ed., Wiley, New York, 1964, pp. 5-32.
	2	Yale N. Patt, Variable length tree structures having minimum average search time, Communications of the ACM, v.12 n.2, p.72-76, Feb. 1969 [doi>10.1145/362848.362853]
	3	RIORDAN, J. An Introduclion to Combinatorial Analysis. Wiley, New York, 1958.
	4	L. E. Stanfel, Tree Structures for Optimal Searching, Journal of the ACM (JACM), v.17 n.3, p.508-517, July 1970 [doi>10.1145/321592.321601]
	5	Larry E. Stanfel, A comment on optimal tree structures, Communications of the ACM, v.12 n.10, p.582, Oct. 1969 [doi>10.1145/363235.363265]
	6	Edward H. Sussenguth, Jr., Use of tree structures for processing files, Communications of the ACM, v.26 n.1, p.17-20, Jan. 1983 [doi>10.1145/357980.357987]