| 词条 | 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.{{r|em}} Education and careerJoseph graduated from Hiram College in 1976 with an interdisciplinary major in ecology.{{r|cstb}} 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.{{r|mg}} At Wisconsin, Joseph was a recipient of the Presidential Young Investigator Award of the National Science Foundation. She was also an active member of the Computer Science and Telecommunications Board of the National Research Council.{{r|cstb}} Selected publications
| last1 = Joseph | first1 = Deborah | last2 = Young | first2 = Paul | doi = 10.1016/0304-3975(85)90140-9 | issue = 2-3 | journal = Theoretical Computer Science | mr = 821203 | pages = 225–237 | title = Some remarks on witness functions for nonpolynomial and noncomplete sets in NP | volume = 39 | year = 1985}}. This paper introduces the {{mvar|k}}-creative sets, which form a potential counterexample to the Berman–Hartmanis conjecture.
| last1 = Hopcroft | first1 = John | author1-link = John Hopcroft | last2 = Joseph | first2 = Deborah | last3 = Whitesides | first3 = Sue | author3-link = Sue Whitesides | doi = 10.1137/0214025 | issue = 2 | journal = SIAM Journal on Computing | mr = 784740 | pages = 315–333 | title = On the movement of robot arms in 2-dimensional bounded regions | volume = 14 | year = 1985}}. Expanded version of a paper from the 23rd Symposium on Foundations of Computer Science (FOCS 1982).
| last1 = Joseph | first1 = Deborah | last2 = Meidânis | first2 = João | last3 = Tiwari | first3 = Prasoon | contribution = Determining DNA sequence similarity using maximum independent set algorithms for interval graphs | doi = 10.1007/3-540-55706-7_29 | location = Berlin | mr = 1249510 | pages = 326–337 | publisher = Springer | series = Lecture Notes in Computer Science | title = Algorithm Theory — SWAT '92: Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8–10, 1992, Proceedings | volume = 621 | year = 1992}}.
| last1 = Althöfer | first1 = Ingo | last2 = Das | first2 = Gautam | last3 = Dobkin | first3 = David | author3-link = David P. Dobkin | last4 = Joseph | first4 = Deborah | last5 = Soares | first5 = José | doi = 10.1007/BF02189308 | issue = 1 | journal = Discrete & Computational Geometry | mr = 1184695 | pages = 81–100 | title = On sparse spanners of weighted graphs | volume = 9 | year = 1993}}. Expanded version of a paper from the 2nd Scandinavian Workshop on Algorithm Theory (SWAT 1990), in which Joseph and her co-authors discover greedy geometric spanners. References1. ^{{citation|url=https://www.cs.wisc.edu/people/joseph|title=Deborah Joseph, Emeritus Professor|publisher=University of Wisconsin–Madison|accessdate=2018-12-09}} [1][2]2. ^{{mathgenealogy|id=11504}} }}{{Authority control|DBLP=j/DeborahJoseph|MGP=11504}}{{DEFAULTSORT:Joseph, Deborah}} 8 : Year of birth missing (living people)|Living people|American computer scientists|Women computer scientists|Hiram College alumni|Purdue University alumni|University of Wisconsin–Madison faculty|Researchers in geometric algorithms |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。