Dorothea Blostein

Dorothea Blostein ({{née}} Haken) is a Canadian computer scientist who works as a professor of computer science at Queen's University. She has published well-cited publications on computer vision,{{ran|BA}} image analysis,{{ran|ZBC}} and graph rewriting,{{ran|BFG}} and is known as one of the authors of the master theorem for divide-and-conquer recurrences.{{ran|BHS}} Her research interests also include biomechanics and tensegrity.{{r|home}}

Blostein is the daughter of mathematician Wolfgang Haken, and while she was in high school and college she helped check her father's proof of the four color theorem.{{r|4c}}

She did her undergraduate studies at the University of Illinois at Urbana–Champaign, earning a B.Sc. in 1978, and then received a master's degree from Carnegie Mellon University in 1980.{{r|splash}} She returned to the University of Illinois for her doctoral studies, completing a Ph.D. in 1987, under the supervision of Narendra Ahuja.{{r|splash|mgp}}

Her husband, Steven D. Blostein, is a professor of electrical and computer engineering at Queen's University.

Selected publications

{{rma|BHS|{{citation

| last1 = Bentley | first1 = Jon Louis | author1-link = Jon Bentley (computer scientist)

| last2 = Haken | first2 = Dorothea

| last3 = Saxe | first3 = James B. | author3-link = James B. Saxe

| doi = 10.1145/1008861.1008865

| issue = 3

| journal = ACM SIGACT News

| pages = 36–44

| title = A general method for solving divide-and-conquer recurrences

| volume = 12

| year = 1980| s2cid = 40642274 }}|tw=2.5em}}

{{rma|BA|{{citation

| last1 = Blostein | first1 = Dorothea

| last2 = Ahuja | first2 = Narendra | author2-link = Narendra Ahuja

| doi = 10.1109/34.41363

| issue = 12

| journal = IEEE Transactions on Pattern Analysis and Machine Intelligence

| pages = 1233–1251

| title = Shape from texture: integrating texture-element extraction and surface estimation

| volume = 11

| year = 1989}}|tw=2.5em}}

{{rma|BFG|{{citation

| last1 = Blostein | first1 = Dorothea

| last2 = Fahmy | first2 = Hoda

| last3 = Grbavec | first3 = Ann

| editor1-last = Cuny | editor1-first = Janice

| editor2-last = Ehrig | editor2-first = Hartmut |editor2-link=Hartmut Ehrig

| editor3-last = Engels | editor3-first = Gregor

| editor4-last = Rozenberg | editor4-first = Grzegorz

| contribution = Issues in the practical use of graph rewriting

| doi = 10.1007/3-540-61228-9_78

| isbn = 978-3-540-68388-9

| location = Berlin

| pages = 38–55

| publisher = Springer

| series = Lecture Notes in Computer Science

| title = Graph Grammars and Their Application to Computer Science: 5th International Workshop, Williamsburg, VA, USA, November 13–18, 1994, Selected Papers

| volume = 1073

| year = 1996}}|tw=2.5em}}

{{rma|ZBC|{{citation

| last1 = Zanibbi | first1 = Richard

| last2 = Blostein | first2 = Dorothea

| last3 = Cordy | first3 = James R. | author3-link = James Cordy

| doi = 10.1109/TPAMI.2002.1046157

| issue = 11

| journal = IEEE Transactions on Pattern Analysis and Machine Intelligence

| pages = 1455–1467

| title = Recognizing mathematical expressions using tree transformation

| volume = 24