Deborah Joseph
Deborah A. Joseph is an American computer scientist known for her research in computational geometry, computational biology, and computational complexity theory. She is a professor emeritus of computer science at the University of Wisconsin–Madison.[1]
Education and career
Joseph graduated from Hiram College in 1976 with an interdisciplinary major in ecology.[2] She earned her Ph.D. in 1981 at Purdue University. Her dissertation, On the Power of Formal Systems for Analyzing Linear and Polynomial Time Program Behavior, was supervised by Paul R. Young.[3]
At Wisconsin, Joseph was a recipient of the
National Research Council.[2]
Selected publications
- Joseph, Deborah; Young, Paul (1985), "Some remarks on witness functions for nonpolynomial and noncomplete sets in NP", MR 0821203. This paper introduces the k-creative sets, which form a potential counterexample to the Berman–Hartmanis conjecture.
- S2CID 16477060. Expanded version of a paper from the 23rd Symposium on Foundations of Computer Science(FOCS 1982).
- Joseph, Deborah; Meidânis, João; Tiwari, Prasoon (1992), "Determining DNA sequence similarity using maximum independent set algorithms for interval graphs", Algorithm Theory — SWAT '92: Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8–10, 1992, Proceedings, Lecture Notes in Computer Science, vol. 621, Berlin: Springer, pp. 326–337, MR 1249510.
- Scandinavian Workshop on Algorithm Theory (SWAT 1990) and the PhD thesis[4] of Joseph's student Gautam Das, in which they discover greedy geometric spanners.
References
- ^ Deborah Joseph, Emeritus Professor, University of Wisconsin–Madison, retrieved 2018-12-09
- ^ ISBN 9780309059336
- ^ Deborah Joseph at the Mathematics Genealogy Project
- OCLC 22935858.
