| When
| Number
| Title
| Professor
| Comments
| Project
|
| Fall 1996
| CS 252
|
Graduate Computer Architecture
|
Dave Patterson
| Great lecturer.
Do not let his intuitive verbal style fool you -
the book is titled
Computer Architecture, A Quantitative Approach,
so numbers matter!
| IDEA encryption on FPGAs
|
| EECS 226a
|
Random Processes
|
David Tse
| Way difficult...
|
|
| MATH 202a
|
Topology and Real Analysis
|
Alan Weinstein
| Good lecture style. Make sure you read ahead
|
|
|
| Spring 1997
| CS 294-7
|
Reconfigurable Computing
|
André DeHon
| Good discussion and tons of papers about many R.C. topics.
André has a thing for simple mathematical models &
theoretical limits
| Placement & Routing Optimizer for Garp
|
| EECS 141
|
Digital Integrated Circuits
|
Jan Rabaey
| Great presentation. Excellent as a 1st course in digital circuits
|
|
| EECS 225a
|
Signal Processing
|
Ed Lee
| Excellent lecturer, stresses intuitive understanding, patient
|
|
| EECS 290T
|
Image and Video Compression
|
Avideh Zakhor
| MPEG out the wazoo. Check out more of the
video group's work
|
|
|
| Fall 1997
| CS 254
|
Topics in VLSI Systems Design
|
John Wawrzynek
| I sat in to see early construction of
BRASS and
IRAM project circuits
|
|
| CS 282
|
Algebraic Algorithms
|
Richard Fateman
| All about symbolic computer algebra systems,
i.e. what makes Mathematica tick
| Understanding mathematics from TeX
|
| CS 294-2
|
Quantum Computation
|
Umesh Vazirani
| Eclectic and eye-opening. At the time of this course,
the biggest quantum circuit ever built was 12 gates!
|
|
| PHYS 137a
|
Quantum Mechanics
(better description)
|
Yuen-Ron Shen
| The peculiar formalisms and mathematical foundation of QM
|
|
|
| Spring 1998
| CS 263
|
Design of Programming Languages
|
Alex Aiken
| A theory course disguised as a software course. ML is cute.
| Bit-Level Binding Time Analysis
|
| CS 270
|
Combinatorial Algorithms and Data Structures
|
Christos Papadimitriou
| Enjoyable survey of CS theory topics and algorithmic techniques
from an excellent lecturer
| FPGA Routing
|
| EECS 224
|
Digital Communication
|
Joe Kahn
| 101 ways to modulate
|
|
| EECS 290T
|
Wavelets and Applications
|
Martin Vetterli
| Nasty math to prove that simple algorithms yield optimal compression
|
|
| PHYS 137b
|
Quantum Mechanics
|
Jim Morehead
| More formalisms & examples of QM systems.
Great young lecturer from LBL
|
|
|
| Fall 1998
| CS 262
|
Advanced Topics in Operating Systems
|
Eric Brewer
| Most excellent systems prof who formed
Inktomi
| Scheduling for Virtualized FPGA Hardware
|
| CS 276
|
Number Theory and Cryptography
|
Manuel Blum
| A bug in every proof
|
|
| CS 294-6
|
Reconfigurable Computing
|
André DeHon
| New and improved version of 294-7 (see above)
|
|
| EECS 290G
|
Intro to MEMS
|
Kristofer Pister
| Building micro-machines using photo-lithography
|
|
| PHYS 221A
|
Quantum Mechanics
|
Eugene Commins
| Secrets of the universe, revealed at last
|
|
|
| Spring 1999
| CS 258
|
Parallel Computer Architecture
|
David Culler
| What makes multiprocessors and supercomputers tick
|
|
| CS 294-3
|
Fourier Transforms & Theoretical Computer Science
|
Umesh Vazirani
| 101 uses for Fourier Transforms
|
|
| CS 294-8
|
Privacy, Security, and Cryptography
|
Doug Tygar
| I would dub it "security for business majors"
|
|
| EECS 229
|
Information Theory
|
Venkat Anantharam
| Why zipping a zipped file does not help
|
|
| PHYS 221B
|
Quantum Mechanics
|
Eugene Commins
| More secrets of the universe... Cabbibo!
|
|
|
| Fall 1999
| CS 264
|
Programming Language Implementation
|
Richard Fateman
| Acquire the tools to make tools which make tools mo' better
|
|
| PHYS 210A
|
Classical Physics
|
Jim Morehead
| A math course in disguise
(stupid tricks with 4-space, Hamiltonians, Lagrangians)
|
|
|
| Spring 2000
| CS 150
|
Design Techniques and Components for Digital Systems
|
John Wawrzynek
| How computers compute using boolean logic
(I was head TA)
| Implement a MIDI synthesizer on an FPGA
|
| EECS 219B
|
Logic Synthesis for Hardware Systems
|
Robert Brayton
| A peek under the hood of CAD programs that make digital circuits
|
|
|
| Fall 2001
| EECS 244
|
Introduction to Computer-Aided Design of Integrated Circuits
|
Kurt Keutzer
| Another peek under the hood of CAD programs that make digital circuits
|
|
|
| Spring 2002
| EECS 290N
|
Concurrent Models of Computation
|
Edward Lee
| Parallel compute models and semantics for the day we realize
that C and microprocessors don't cut it anymore
|
Bounding memory usage for SCORE
|
|
| Fall 2004
| CS 294-6
|
Reading the Classics
|
Christos Papadimitriou
| Classic papers in computer science: Turing, Shannon, Von Neumann,
etc.
|
Vannevar Bush's ``As We May Think''
|
| EECS 249
|
Design of Embedded Systems: Models, Validation, and Synthesis
|
Alberto Sangiovanni-Vincentelli
| Theory and tools for designing tomorrow's high-tech toys,
like the computer under your car hood
|
|
| EECS 290N
|
Concurrent Models of Computation for Embedded Software
|
Edward Lee
| More parallel compute models and semantics, for the day
has arrived that C and microprocessors don't cut it anymore
|
|