Theoretical Foundations

[Overview]   [Faculty]   [Projects]   [Courses]

Theoretical Foundations focuses on formal approaches to modeling the essence of computation problems, developing and analyzing algorithms, and understanding inherent limits of computational models.

Faculty

Nancy Amato, Professor   (Motion planning, computational biology, robotics, computational geometry, animation, CAD, VR, parallel and distributed computing, parallel algorithms, performance modeling, and optimization)

Jianer Chen, Professor   (Algorithms and complexity, computer networks, bioinformatics, computer graphics)

Gabriel Dos Reis, Assistant Professor   (Computer algebra, mathematical software, computer methods in geometry, programming languages and libraries, compiler construction, generic programming)

Don Friesen, Professor   (Algorithm analysis, complexity)

Anxiao (Andrew) Jiang, Assistant Professor   (Information theory, coding for flash memories, wireless and sensor networks, algorithms)

John Keyser, Associate Professor   (Geometric computing, graphics and visualization, simulation and modeling, and computer algebra)

Andreas Klappenecker, Associate Professor   (Quantum computing, image processing, cryptography)

Sing-Hoi Sze, Associate Professor   (Bioinformatics/Computational Biology: multiple sequence alignment, motif finding with applications to predicting transcription factor binding sites, biological network analysis, identification of gene clusters within genomes)

Jeffrey Vitter, Professor   (Massive data, external memory algorithms; compressed data structures; databases; data compression, including text, image, and video compression; machine learning and prediction; randomized, parallel, and incremental algorithms; computational geometry; computational science; algorithm engineering; combinatorial optimization)

Jennifer Welch, Professor   (Algorithms and lower bounds for distributed computing systems, in particular mobile ad hoc networks, distributed shared objects, and metamorphic robot systems)

Projects

Efficient Massively Parallel Adaptive Algorithm for Time-Dependent Transport on Arbitrary Spatial Grids, DOE
PIs: Marvin Adams, Nancy Amato, Lawrence Rauchwerger

CAREER: Design of Efficient Quantum Algorithms, NSF
PI: Andreas Klappenecker

CARGO: Degeneracy Detection for Curved Solids, NSF
PIs: John Keyser, Maurice Rojas

Efficient Decoherence Control Algorithms, NSF
PI: Andreas Klappenecker

Exact Computational Biology Algorithms with Small Parameters, NSF
PIs: Sing-Hoi Sze, Jianer Chen

Exploring the Brain Forest, THECB ATP
PIs: John Keyser

ITR: Accurate and Robust Operations on Curved Geometry, NSF
PI: John Keyser

ITR/AP: A Motion Planning Approach for Protein Folding Simulation, NSF
PIs: Nancy Amato, Lawrence Rauchwerger, Ken Dill (UCSF)

ITR/SY: SmartApps: An Application Centric Approach to Scientific Computing, NSF
PIs: Lawrence Rauchwerger, Nancy Amato

Next Generation Compilers for Emerging Multicore Systems
PI: Lawrence Rauchwerger, Gabriel Dos Reis, Bjarne Stroustrup

Parameterized Computation and Applications, NSF
PI: Jianer Chen

Quantum Computation, TITF
PIs: Andreas Klappenecker, Goong Chen, Berthold-Georg Englert, Suhail Zubairy

Self-Stabilizing Group Communication for Mobile Environments, NSF
PIs: Jennifer Welch, Nancy Lynch (MIT)

Courses

CSCE 121. Introduction to Program Design and Concepts.
CSCE 221. Data Structure and Algorithms.
CSCE 222. Discrete Structures for Computing.
CSCE 314. Programming Languages
CSCE 315. Programming Studios
CSCE 411. Design and Analysis of Algorithms.
CSCE 432. Programming Languages and Their Implementations
CSCE 433. Formal Languages and Automata.
CSCE 440. Quantum Algorithms.
CSCE 441. Computer Graphics.
CSCE 620. Computational Geometry.
CSCE 626. Parallel Algorithm Design and Analysis.
CSCE 627. Theory of Computability.
CSCE 628. Computational Biology.
CSCE 629. Analysis of Algorithms.
CSCE 637. Complexity Theory.
CSCE 640. Quantum Algorithms.
CSCE 641. Computer Graphics.
CSCE 645. Geometric Modeling.
CSCE 668. Distributed Algorithms and Systems.
CSCE 669. Computational Optimization.
CSCE 689. Randomized Algorithms.
CSCE 689. Robust Numerical and Geometric Computation.