Daniel Hirschberg
Dr. Hirschberg’s research has centered in the fields of concrete computational complexity and data structures. Most of his work has concentrated on common subsequence problems, complexity analysis of algorithms, design of efficient algorithms, data structures and data compression.
Education
Ph.D., Princeton University, 1975
Research Areas
View Algorithms and Theory
Algorithms and Theory
Algorithm design from several diverse viewpoints and computational complexity theory...