Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues

Data Structural Bootstrapping, Linear Path Compression, and Catenable Heap Ordered Double Ended Queues (1992)

Cached

Download Links

[ftp.cs.princeton.edu]

Other Repositories/Bibliography

DBLP

by Adam L. Buchsbaum , Rajamani Sundar , Robert E. Tarjan

Venue:	SIAM Journal on Computing
Citations:	15 - 7 self

Versions

Version History

Metadata Version 2

Datum	Value	Source
TITLE	Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues	INFERENCE
AUTHOR NAME	Adam L. Buchsbaum	SVM HeaderParse 0.1
AUTHOR AFFIL	2	SVM HeaderParse 0.2
AUTHOR NAME	Rajamani Sundar	SVM HeaderParse 0.1
AUTHOR AFFIL	3	SVM HeaderParse 0.2
AUTHOR NAME	Robert E. Tarjan	SVM HeaderParse 0.1
AUTHOR AFFIL	; 4; Also affiliated with NEC Research Institute	SVM HeaderParse 0.2
AUTHOR ADDR	; Also affiliated with DIMACS, Rutgers University, Piscataway, NJ 08855. Supported by DIMACS under; 4 Independence Way, Princeton, NJ 08540. Research at	SVM HeaderParse 0.1
ABSTRACT	A deque with heap order is a linear list of elements with real-valued keys which allows insertions and deletions of elements at both ends of the list. It also allows the findmin (equivalently findmax) operation, which returns the element of least (greatest) key, but it does not allow a general deletemin (deletemax) operation. Such a data structure is also called a mindeque (maxdeque). Whereas implementing mindeques in constant time per operation is a solved problem, catenating mindeques in sublogarithmic time has until now remained open. This paper provides an efficient implementation of catenable mindeques, yielding constant amortized time per operation. The important algorithmic technique employed is an idea which is best described as data structural bootstrapping: We abstract mindeques so that their elements represent other mindeques, effecting catenation while preserving heap order. The efficiency of the resulting data structure depends upon the complexity of a special case of path compression which we prove requires linear time. 1	SVM HeaderParse 0.1
YEAR	1995	INFERENCE
VENUE	SIAM J. Computing	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	40--9	INFERENCE
VOLUME	24	INFERENCE
CITATIONS	23 found	ParsCit 1.0