 | 
Institute Affiliation:
Contact Information:
Phone:
858-534-4868
Email:
gill@cs.ucsd.edu
| | S. Gill Williamson - Professor
Algorithms, combinatorial mathematics, and combinatorics.
Professor Williamson is a prolific author of texts in the field of combinatorics and the design and analysis
of algorithms on subjects ranging from approximation algorithms, discrete and computational geometry, optimization
and operations research, communication complexity, graph theory, randomized algorithms and probabilitymethods,
extremal set theory, packing and covering, combinatorial number theory, algebraic and spectral methods, and
scheduling theory and the use of techniques and results from these topics. Combinatorics is a field of discrete
mathematics related to counting theory that is of critical importance for theoretical work in computer science. It
may include the study of usually finite sets with certain characteristic arrangements of their elements or subsets,
handling such questions as what combinations are possible, and how many there are. These questions also have
practical application to such areas as Internet routing and acceleration, massive data sets, wireless communication,
computational biology, information management and next generation networks.
Capsule Bio:
S. Gill Williamson joined the UCSD faculty in 1965. From 1965 to 1991 he was a member of
the Department of Mathematics. In 1991 he joined CSE and was Chair of CSE from 1991 to 1996. He is the author
numerous research papers. He is also the author of the books "Combinatorics for Computer Science" and "Top-Down
Calculus". He is co-author of: "A Short Course in Discrete Mathematics", "Mathematics for Algorithm and Systems
Analysis", "Foundations of Applied Combinatorics", and "A Comprehensive Introduction to Linear Algebra". He
received his B.S. in Mathematics from Caltech in 1960, M.S. from Stanford University in Statistics in 1962, and
Ph.D. in Mathematics from U.C.S.B. in Mathematics in 1965.
| |
