CSTA Web Repository
 

CSTA K-12 Repository >
CSTA Source: K-12 Repository >
Level 2: Computer Science in the Modern World >
L2 A: Topics >
L2 A 06: Mathematics & Computer Science >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2378/369

Title: Cache-Oblivious Computations: Algorithms and Experimental Evaluation
Authors: Ramachandran, Vijaya
Keywords: massive data sets
memory hierarchy
analysis of algorithms
I/O complexity
cache-oblivious model
longest common sequence
recursion
bioinformatics
priority queue
heap
Gaussian Elimination
Issue Date: Jul-2008
Publisher: U Texas-Austin
Abstract: Discussion based on techniques and analysis for handling massive data sets. Analysis of algorithms is discussed from the perspective of I/O complexity and the cache-oblivious model. Related topics include the Longest Common Subsequence problem, recursion, bioinformatics, priority queue, heaps and Gaussian Elemination. This is a very mathematical treatment.
URI: http://hdl.handle.net/2378/369
Appears in Collections:L2 A 06: Mathematics & Computer Science
L4 A 05: Standard Algorithms [AP Topic Outline V]
L3 C 03: Societal issues in software engineering, limits of computing, levels of languages, computing careers
L3 B 02: Recursion
L3 A 07: Limits of computing
L3 A 03: Discrete Mathematics

Files in This Item:

File Description SizeFormat
Cache_Oblivious_Algorithms.pdf1098KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2006 MIT and Hewlett-Packard
or broken NS 4.x --%>