<--- Back to Details
First PageDocument Content
Computer programming / Abstract data types / Heap / Binary heap / Min-max heap / Binary trees / Sorting algorithms / Leftist tree / Double-ended priority queue / Priority queues / Mathematics / Computing
Date: 2002-09-16 17:06:43
Computer programming
Abstract data types
Heap
Binary heap
Min-max heap
Binary trees
Sorting algorithms
Leftist tree
Double-ended priority queue
Priority queues
Mathematics
Computing

RESEARCHCONTRIBUTIONS Programming

Add to Reading List

Source URL: cg.scs.carleton.ca

Download Document from Source Website

File Size: 481,25 KB

Share Document on Facebook

Similar Documents

Abstract data types / Priority queue / Queue / Sequence / Stack / Permutation / Collection / Double-ended queue / Relaxation

Quantitative Relaxation of Concurrent Data Structures Thomas A. Henzinger˚ Christoph M. Kirsch` Hannes Payer`

DocID: 1p5ai - View Document

Software engineering / Computer programming / Pairing heap / Double-ended queue / Binomial heap / Skew binomial heap / Queue / D-ary heap / Heap / Abstract data types / Computing / Priority queues

Functional Data Structures for Typed Racket Hari Prashanth K R Sam Tobin-Hochstadt Northeastern University

DocID: 1826Y - View Document

Parallel computing / Abstract data types / Threads / Data parallelism / Foreach loop / Priority queue / Thread pool pattern / Double-ended queue / Parallel algorithm / Computing / Concurrent computing / Computer programming

On A Generic Parallel Collection Framework Aleksandar Prokopec, Phil Bagwell, Tiark Rompf, Martin Odersky June 27, 2011 Abstract

DocID: 17CcX - View Document

Software engineering / Computer science / Fibonacci heap / Van Emde Boas tree / Queue / Binary heap / Heap / Set / Double-ended priority queue / Abstract data types / Computing / Priority queue

Advanced Algorithms – COMS31900Lecture 6 Van Emde Boas trees Markus Jalsenius

DocID: 14o95 - View Document

Software engineering / Computer programming / Pairing heap / Double-ended queue / Binomial heap / Skew binomial heap / Queue / D-ary heap / Heap / Abstract data types / Computing / Priority queues

Functional Data Structures for Typed Racket Hari Prashanth K R Sam Tobin-Hochstadt Northeastern University

DocID: 13qws - View Document