3D Viewing A* and Beyond AND/OR Graphs Applications Artificial Intelligence Automatic Parallelization AVL Trees Back Propagation Bayesian Networks Binary Heaps Breadth First Search Case Study clipping Code Generation Compiler Compiler Design computer animation Computer Graphics Control Control Flow Analysis curves Data-Flow Analysis Data-Flow Analysis : Theoretical Foundation Data Compression Data Structures Decision Trees Deletion Depth First Search Dictionaries Dijkstras Algorithm Directed Graphs Disk Based Data Structures Energy-Aware Software Systems Exercising Control First Order Logic fractals Game Trees Garbage Collection Global Register Allocation GraphPLAN and SATPlan Graphs Hashing Heuristic hidden surface elimination Hierarchical Models Implementing Object Oriented Languages Inference Informed State Space Search Insertion Instruction Scheduling Interprocedural Data-Flow analysis Introduction Introduction to Machine Independent Optimizations Introduction to Planning Issues Just-In-Time Compilation and Optimizations for .NET CLR Knowledge Based Systems Learning Lecture Linked Lists Local Optimizations Logic and Deduction Logic Programming Machine Independent Optimizations Minimum Spanning Trees Neural Networks Ordered Dictionaries Overview of Compiler Partial Order Planning Partial Redundancy Elimination Planning polygon clipping polygon scan conversion Prims Algorithm Priority Queues Problem Reduction Problem Solving by Search Prolog Queues Quicksort raster graphics ray tracing Reasoning Reasoning Under Uncertainity Red Black Trees Refutation Proofs rendering Resolution Run Time Environments SATPlan Search Searching Searching for Patterns Searching with costs Single Source Shortest Paths Software Pipelining Sorting Stacks surfaces The Static Assignment Form : Construction and Application to Program Optimizations Titbit transformations Traversals Trees Tree Walks Tries Union Worst Case Execution Time