M
Mark R. Brown
Researcher at Yale University
Publications - 9
Citations - 465
Mark R. Brown is an academic researcher from Yale University. The author has contributed to research in topics: Tree (data structure) & M/G/1 queue. The author has an hindex of 8, co-authored 9 publications receiving 458 citations.
Papers
More filters
Journal ArticleDOI
Design and analysis of a data structure for representing sorted lists
Mark R. Brown,Robert E. Tarjan +1 more
TL;DR: This analysis leads to a data structure for representing sorted lists when the access pattern exhibits a (perhaps time-varying) locality of reference that is substantially simpler and may be practical for lists of moderate size.
Journal ArticleDOI
Implementation and Analysis of Binomial Queue Algorithms
TL;DR: The binomial queue, a new data structure for implementing priority queues that can be efficiently merged, was recently discovered by Jean Vuillemin and new methods of representing binomial queues are given which reduce the storage overhead of the structure and increase the efficiency of operations on it.
Journal ArticleDOI
A Fast Merging Algorithm
Mark R. Brown,Robert E. Tarjan +1 more
TL;DR: An algorithm which merges sorted lists represented as balanced binary trees if the lists have lengths m and n (m $\leq$ n), then the merging procedure runs in O(m log n/m) steps, which is the same order on all comparison-based algorithms for this problem.
Journal ArticleDOI
A Partial Analysis of Random Height-Balanced Trees
TL;DR: The collection of nodes nearest to the external nodes in a random height-balanced tree is analyzed, and the average number of single and double rotations which occur at the minimum height during insertions are found.
Proceedings ArticleDOI
A representation for linear lists with movable fingers
Mark R. Brown,Robert E. Tarjan +1 more
TL;DR: The structure has many of the properties of the representation proposed by Guibas, McCreight, Plass, and Roberts, but is substantially simpler and may be practical for lists of moderate size.