<--- Back to Details
First PageDocument Content
Computer science / Online algorithms / Computational complexity theory / Virtual memory / Cache / List update problem / Amortized analysis / Cache algorithms / Self-organizing list / Theoretical computer science / Analysis of algorithms / Applied mathematics
Date: 2002-11-13 16:08:16
Computer science
Online algorithms
Computational complexity theory
Virtual memory
Cache
List update problem
Amortized analysis
Cache algorithms
Self-organizing list
Theoretical computer science
Analysis of algorithms
Applied mathematics

Programming Techniques and Data Structures

Add to Reading List

Source URL: www.cs.cmu.edu

Download Document from Source Website

File Size: 1,37 MB

Share Document on Facebook

Similar Documents

Chapter 1 AHA: Amortized Heap Space Usage Analysis

DocID: 1t33c - View Document

Introduction to Algorithms 6.046J/18.401J LECTURE 13 Amortized Analysis • Dynamic tables

DocID: 1s49h - View Document

Abstract data types / Computing / Data structures / Software engineering / Computer science / Queue / Double-ended queue / Amortized analysis / Persistent data structure / Rope / Conc-Tree list

SnapQueue: Lock-Free Queue with Constant Time Snapshots Aleksandar Prokopec École Polytechnique Fédérale de Lausanne, Switzerland Abstract

DocID: 1qv6G - View Document

Abstract data types / Binomial heap / Fibonacci heap / Heap / Amortized analysis / Queue / Data structures / Priority queues / Weak heap / Shadow heap

Algorithms and Data Structures Winter TermExercises for Unit 16 & 17 1. Show the following simple facts about a binomial tree of rank k. a) The tree has 2k nodes.

DocID: 1p2oh - View Document

Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics Jan Hoffmann and Martin Hofmann Ludwig-Maximilians-Universit¨at M¨unchen Abstract. This paper studies the problem of s

DocID: 1mrml - View Document