Jump to content

Edith Hemaspaandra

From Wikipedia, the free encyclopedia

Edith Hemaspaandra (née Spaan, born February 20, 1964) is a Dutch-American theoretical computer scientist whose research concerns computational social choice, the computational complexity theory of problems in social choice theory, and particularly on computational problems involving election manipulation. She is a professor of computer science at the Rochester Institute of Technology.

Early life and education

[edit]

Edith Spaan was born on February 20, 1964, in Schagen, and educated in computer science at the University of Amsterdam. She earned a bachelor's degree there in 1986, and a master's degree in 1988.[1] She completed her Ph.D. in 1993, with the dissertation Complexity of Modal Logics combining complexity theory and modal logic, supervised by Johan van Benthem.[1][2]

When she and her husband (formerly named Lane Hemachandra) married, they both changed their surname to Hemaspaandra.[3]

Career

[edit]

After postdoctoral research at the University at Buffalo,[1] supervised by Alan Selman,[4] Hemaspaandra taught at Le Moyne College from 1993 until 1998. She took her present position at the Rochester Institute of Technology in 1998.[1] She is a full professor in the Golisano College of Computing and Information Sciences at the Rochester Institute of Technology.[5]

References

[edit]
  1. ^ a b c d "Edith Hemaspaandra", Reviewer biographies, Journal of Universal Computer Science, retrieved 2022-08-02
  2. ^ Edith Hemaspaandra at the Mathematics Genealogy Project
  3. ^ Gasarch, William (12 December 2021), "Did Lane Hemaspaandra invent the Fib numbers?", Computational Complexity, retrieved 2022-08-02
  4. ^ "In Memoriam – Alan Selman (1941 – 2021)", Theory of Computing Systems, 67 (3): 413–414, March 2021, doi:10.1007/s00224-021-10036-x
  5. ^ "Edith Hemaspaandra", Directory, Rochester Institute of Technology, retrieved 2022-08-02
[edit]