Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

William H. Burge

dblp:50/1788 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Algorithms and data structures · 50% Combinatorics and discrete mathematics · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Algorithms and data structures › data structure design › search structures › search trees
binary search trees		 0.011976
An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys · J. ACM 1976
Storage systems
buffer management		 0.011971
An Accessing Model · J. ACM 1971
Storage systems › i/o architecture › i/o subsystem
disk access		 0.011971
An Accessing Model · J. ACM 1971
Algorithms and data structures › sequence algorithms
sorting		 0.011958
Sorting, Trees, and Measures of Order · Inf. Control. 1958

Methods — techniques the papers use, named apart from their topics

probabilistic analysis · 0.0queueing model · 0.0
YearPublicationVenuePosition
1991 Scratchpad and the Rogers-Ramanujan Identities
abstract
No abstract available.
William H. Burge
 ISSAC1
1976 An Analysis of Binary Search Trees Formed from Sequences of Nondistinct Keys
abstract
The expected depth of each key in the set of binary search trees formed from all sequences composed from a multiset { p 1 · 1, p 2 · 2, p 3 · 3, ···, p n · n } is obtained, and hence the expected weight of such trees. The expected number of left-to-right local minima and the expected number of cycles in sequences composed from a multiset are then deduced from these results.
William H. Burge
 J. ACM1
1971 An Accessing Model
abstract
A model of a storage system involving a disk and a buffer is analyzed under two access disciplines.The average stationary access rate is calculated for each discipline.
William H. Burge, Alan G. Konheim
 J. ACM1
1958 Sorting, Trees, and Measures of Order
William H. Burge
 Inf. Control.1