Generation of Binary Trees from Ballot Sequences

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generation of Binary Trees from Ballot Sequences

Full text

Pdf (473 KB)

Source

Journal of the ACM (JACM) archive
Volume 25 , Issue 3 (July 1978) table of contents

Pages: 396 - 404

Year of Publication: 1978

ISSN:0004-5411

Authors

Doron Rotem	Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1
Y. L. Varol	Department of Applied Mathematics, University of the Witwatersrand, 1 Jan Smuts Avenue, Johannesburg 2001, South Africa

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 31, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/322077.322082 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	Gary Don Knott, Deletion in binary storage trees., 1975
	2	Gary D. Knott, A numbering system for binary trees, Communications of the ACM, v.20 n.2, p.113-115, Feb. 1977 [doi>10.1145/359423.359434]
	3	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	4	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	5	ROTEM, D On a correspondence between binary trees and a certain type of perrnutauon. Inform. Processing Letters 4 (1975), 58-61
	6	WELLS, M B Elements of Combinatorial Computmg. Pergamon Press, New York, 1971

CITED BY 8

	Marvin Solomon , Raphael A. Finkel, A Note on Enumerating Binary Trees, Journal of the ACM (JACM), v.27 n.1, p.3-5, Jan. 1980
	David Zerling, Generating binary trees using rotations, Journal of the ACM (JACM), v.32 n.3, p.694-701, July 1985
	H. W. Martin , B. J. Orr, A random binary tree generator, Proceedings of the 17th conference on ACM Annual Computer Science Conference, p.33-38, February 21-23, 1989, Louisville, Kentucky
	Eliana Zoque, A basis for the non-crossing partition lattice top homology, Journal of Algebraic Combinatorics: An International Journal, v.23 n.3, p.231-242, May 2006
	Carl E. Langenhop , William E. Wright, An efficient model for representing and analyzing B-trees, Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective, p.35-40, October 1985, Denver, Colorado, United States
	S. Olariu , J. L. Schwing , Z. Wen , J. Zhang, Optimal parallel encoding and decoding algorithms for trees, Proceedings of the 19th annual conference on Computer Science, p.1-10, April 1991, San Antonio, Texas, United States
	Renzo Sprugnoli, The generation of binary trees as a numerical problem, Journal of the ACM (JACM), v.39 n.2, p.317-327, April 1992
	Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990