Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting

1962/01/01 by Thomas N. Hibbard · 125 citations
Computer Science · Engineering · Mathematics · #Algorithms and Data Compression #semigroups and automata theory #graph theory and CDMA systems #Sorting #Citation #Computer science #Corporation #World Wide Web #Operations research #Information retrieval #Mathematics #Business #Algorithm

paper · pdf · doi:10.1145/321105.321108

published in Journal of the ACM 9(1), 13-28 (Association for Computing Machinery)

openalex publication_date 1962/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/04/04

Abstract

article Free Access Share on Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting Author: Thomas N. Hibbard System Development Corporation, Santa Monica, California System Development Corporation, Santa Monica, CaliforniaView Profile Authors Info & Claims Journal of the ACMVolume 9Issue 1Jan. 1962 pp 13–2810.1145/321105.321108Online:01 January 1962Publication History 101citation961DownloadsMetricsTotal Citations101Total Downloads961Last 12 Months48Last 6 weeks6 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my Alerts New Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF

Citations

• Report on the algorithmic language ALGOL 60
• A high-speed sorting procedure
• A Method for the Construction of Minimum-Redundancy Codes
• Programming the logic theory machine

Cited by

• Randomized binary search trees
• Random binary tree [wikipedia]