<--- 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

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

Theoretical computer science / Logic in computer science / Programming language semantics / Models of computation / Game theory / Semantics / Denotational semantics / Game semantics / Determinacy / Samson Abramsky / Operational semantics

Semantics of Interaction Samson Abramsky Abstract The “classical” paradigm for denotational semantics models data types as domains, i.e. structured sets of some kind, and programs as (suitable) functions between doma

DocID: 1xToC - View Document

Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume

DocID: 1vlSe - View Document

Model Checking Recursive Programs with Numeric Data Types Matthew Hague and Anthony Widjaja Lin Oxford University Computing Laboratory Abstract. Pushdown systems (PDS) naturally model sequential recursive programs. Nume

DocID: 1tTLw - View Document

Abstract Data Types in Object-Capability Systems James Noble1 , Sophia Drossopoulou2 , Mark S. Miller3 , Toby Murray4 , Alex Potanin1 1 Victoria University Wellington, 2 Imperial College London, 3 Google Inc, 4 Universit

DocID: 1sZOy - View Document

Java Collection Framework Version March 2009 Framework  Interfaces (ADT, Abstract Data Types)

DocID: 1shdx - View Document