Segmented winner trees

Authors:
Andrew Lim;Sartaj Sahni
Affiliations:
Information Technology Institute, Republic of Singapore;University of Florida, FL
Venue:
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Year:
1992

Citing 3
Cited 1

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Fundamentals of Data Structures in Pascal

Fundamentals of Data Structures in Pascal
Optimal Joining of Compacted Cells

IEEE Transactions on Computers

Optimal Joining of Compacted Cells

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new data structure, "segmented winner tree", is introduced. This is useful when one needs to represent data that are partitioned into segments. The segment operations that are efficiently supported are: initialize a unit length segment, find the element with least value in any given segment, update an element in any segment, merge two adjacent segments, and split a segment.