MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "The Relaxed min-max Heap." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

ATOM

A General Technique for Implementation of Efficient Priority Queues
by Peter Høyer — 1994 — In Proc. 3rd Israel Symposium on Theory of Computing and Systems
…. Ding and Weiss [5] proposed the relaxed min-max heap. The double-ended binomial queue was proposed…
Cited by 5 (0 self) – Add To MetaCart

A General Technique for Implementation of Efficient Priority Queues
by Peter Yer — 1994 — In Proc. 3rd Israel Symposium on Theory of Computing and Systems
…] proposed the relaxed min-max heap. The double-ended binomial queue was proposed by Khoong and Leong [10…
Add To MetaCart

Reflected Min-Max Heaps
by Christos Makris Athanasios, Athanasios Tsakalidis, Kostas Tsichlas — 2003 — Information Processing Letters 86
… space by the two axes. Based on this structure the authors in [8] devised the relaxed min-max heaps…
Add To MetaCart

Showing 1 through 3.

ATOM

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB