Professor of Computer Sciences (1982)
A.B., economics, Harvard University, 1969; M.S., computer science, University of Maryland, 1976; Ph.D., computer science, University of Maryland, 1977.
Professor Frederickson's areas of interest include the analysis of algorithms, with especial emphasis on data structures, and graph and network algorithms. His recent work has focused on designing data structures to dynamically maintain information about graphs, on designing optimal algorithms for parametric search problems on trees, and on discovering graph decompositions that facilitate fast algorithms for shortest path problems.
Professor Frederickson serves on the editorial boards of SIAM Journal on Computing, Algorithmica, and Chicago Journal of Theoretical Computer Science.
Projects: Graph Algorithms and Data Structures
Frederickson's home page
CS Annual Report - 19 APR 1996