Algorithms and Theory

Nancy Amato

Nancy M. Amato

Unocal Professor, Regents Professor

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

Jianer Chen

Jianer Chen


(Algorithms and complexity, computer networks, bioinformatics, computer graphics)

Image Of Tim DavisTim Davis


(Sparse matrix algorithms, computational science, numerical methods, and applied mathematics)

Image of Juan GarayJuan Garay


(Cryptography and information security, Cryptographic protocols and schemes, Secure multiparty computation, Cryptocurrencies and blockchain protocols, Cryptography and game theory, Network security, Distributed computing, Consensus problems, Algorithms)

Image of Anxiao JiangAnxiao (Andrew) Jiang

Associate Professor 

(Information theory, coding for flash memories, wireless and sensor networks, algorithms)

Image of John Keyser 2016.jpgJohn Keyser


(Geometric computing, graphics and visualization, simulation and modeling, and computer algebra)

Image of Andreas KlappAndreas Klappenecker


(Quantum computing, image processing, cryptography)

Image of Dmitri LoguinovDmitri Loguinov


(Peer-to-peer networks, congestion control, Internet measurements, high-performance web crawling, massive-scale information retrieval, topology modeling, and stochastic analysis of networks)

Image of Sing Hoi SzeSing-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)

Jennifer Welch 2017Jennifer Welch

Chevron Professor II, Regents Professor

(Algorithms and lower bounds for distributed computing systems, in particular mobile ad hoc networks and distributed shared objects)

Image of Tiffani WilliamsTiffani Williams

Associate Professor

(Bionformatics/Computational Biology: phylogeny, high-performance computing, optimization, performance analysis)

Image of Nicholas DuffieldNick Duffield (Courtesy Appointment)


Image of Maurice RojasJ. Maurice Rojas (Courtesy Appointment)


Courses Offered

CSCE 620/VIZA 720. Computational Geometry Credits 3. 3 Lecture Hours

Concrete algorithm design and analysis; abstract models to analyze the complexity of problems; NP-Completeness; approximation and probabilistic algorithms

Prerequisite: CSCE 311.
Cross Listing: VIZA 670/CSCE 620.

CSCE 626. Parallel Algorithm Design and Analysis. Credits 3. 3 Lecture Hours

Design of algorithms for use on highly parallel machines; area-time complexity of problems and general lower bound theory; application (of these concepts) to artificial intelligence, computer vision and VLSI design automation.

Prerequisite: CSCE 221.

CSCE 627. Theory of Computability. Credits 3. 3 Lecture Hours

Formal models of computation such as pushdown automata; Turing machines and recursive functions; unsolvability results; complexity of solvable results. 

Prerequisite: CSCE 433.

CSCE 629. Analysis of Algorithms. Credits 3. 3 Lecture Hours

Concrete algorithm design and analysis; abstract models to analyze the complexity of problems; NP-Completeness; approximation and probabilistic algorithms.

Prerequisite: CSCE 411.

CSCE 637. Complexity Theory. Credits 3. 3 Lecture Hours

Deterministic, non-deterministic, alternating and probabilistic computations; reducibilities; P, NP and other complexity classes; abstract complexity; time, space and parallel complexity; and relativized computation. 

Prerequisite: CSCE 627 or approval of instructor.

CSCE 640. Quantum Algorithms. Credits 3. 3 Lecture Hours

Introduction to the design and analysis of quantum algorithms; basic principles of the quantum circuit model; gives a gentle introduction to basic quantum algorithms; reviews recent results in quantum information processing. 

Prerequisite: CSCE 629 or approval of instructor.

CSCE 658. Randomized Algorithms. Credits 3. 3 Lecture Hours

Introduction to randomized algorithms; selected tools and techniques from probability theory and game theory are reviewed, with a view towards algorithmic applications; the main focus is a thorough discussion of the main paradigms, techniques, and tools in the design and analysis of randomized algorithms; a detailed analysis of numerous algorithms illustrates the abstract concepts and techniques. 

Prerequisite: Graduate classification.

CSCE 669. Computational Optimization. Credits 3. 3 Lecture Hours

Combinatorial theory of polytopes as a tool for the solution of combinatorial optimization problems; applications to max flow, matching and matroids; geometric interpretation of the results indicating the profound role that polyhedral combinatorics play in the design and complexity of approximation algorithms. 

Prerequisite: CSCE 629.