| 
|
QuoteRef: chanSC7_1993
topics >
all references >
ThesaHelp:
references c-d
Group:
data structures
Reference
Chang, S.C., Du, M.W., "Diamond deque: a simple data structure for priority deques", Information Processing Letters, 46, July 9, 1993, pp. 231-237. Google
abstract ;;Quote: a diamond deque is a simple, symmetric, pointer-free data structure that combines a min-heap with a max-heap
ThesaHelp: references c-d (337 items)
Group: data structures (12 topics, 275 quotes)