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

The effect of updates in binary search trees

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing

Randomized binary search trees

Journal of the ACM (JACM)

A Simple Sorting Algorithm

Journal of the ACM (JACM)

The Use of Information in Sorting

Journal of the ACM (JACM)

Samplesort: A Sampling Approach to Minimal Storage Tree Sorting

Journal of the ACM (JACM)

Upper Bounds for the Total Path Length of Binary Trees

Journal of the ACM (JACM)

Efficiency of a Binary Comparison Storage Technique

Journal of the ACM (JACM)

Optimal Batched Searching of Tree Structured Files in Multiprocessor Computer Systems

Journal of the ACM (JACM)

Algorithm 346: F-Test Probabilities

Communications of the ACM

Sorting

ACM Computing Surveys (CSUR)

Identifier Search Mechanisms: A Survey and Generalized Model

ACM Computing Surveys (CSUR)

Binary Search Trees and File Organization

ACM Computing Surveys (CSUR)

An empirical study of insertion and deletion in binary search trees

Communications of the ACM

On the probability distribution of the values of binary trees

Communications of the ACM

File structures using hashing functions

Communications of the ACM

Information science in a Ph.D. computer science program

Communications of the ACM

Algorithm 347: an efficient algorithm for sorting with minimal storage [M1]

Communications of the ACM

Algorithm 268: ALGOL 60 reference language editor [R2]

Communications of the ACM

Algorithm 269: determinant evaluation [F3]

Communications of the ACM

Algorithm 271: quickersort

Communications of the ACM

An empirical study of minimal storage sorting

Communications of the ACM

A balanced tree storage and retrieval algorithm

SIGIR '71 Proceedings of the 1971 international ACM SIGIR conference on Information storage and retrieval

Emerging behavior as binary search trees are symmetrically updated

Theoretical Computer Science - Latin American theoretical informatics

Dynamic Binary Search Trees

ACM '78 Proceedings of the 1978 annual conference

Computing integrated costs of sequences of operations with application to dictionaries

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Binary search trees of bounded balance

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing

An empirical evaluation of algorithms for dynamically maintaining binary search trees

ACM '80 Proceedings of the ACM 1980 annual conference

Binary search trees and file organization

SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control

Hybrid trees: A data structure for lists of keys

SIGFIDET '72 Proceedings of 1972 ACM-SIGFIDET workshop on Data description, access and control

Deterministic jumplists

Nordic Journal of Computing

Efficient sample sort and the average case analysis or PEsort

Theoretical Computer Science

Parallel Generation of Binary Search Trees

IEEE Transactions on Computers

Analysis of combinatory algorithms: a sample of current methodology

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference

Measurement of computer systems: an introduction

AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II

Randomness Preserving Deletions on Special Binary Search Trees

Electronic Notes in Theoretical Computer Science (ENTCS)

A guided bibliography to sorting

IBM Systems Journal

On automated verification of probabilistic programs

TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems

Non-blocking binary search trees

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Minimum search tree structures for data partitioned into pages

IEEE Transactions on Computers

Algorithmic probabilistic game semantics

Formal Methods in System Design