Meera Sitharam

Visiting Associate Professor of Computer Sciences (1997)

Ph.D., University of Wisconsin, Madison, 1990.

Associate Professor of Mathematics and Computer Science, Kent State University, since 1996; Assistant Professor of Mathematics and Computer Science, Kent State University, 1990-95; Alexander von Humboldt Postdoctoral Fellow at the University of Bonn, 1991; Dr. Sitharam's research interests fall under two broad categories:

Complexity theory in any guise,
Developing, analyzing and implementing discrete models and algorithms for real-world problems.

In the former category, Dr. Sitharam's emphasis has be on complexity lower bounds and byproducts of the lower bound process, including pseudorandomness, cryptography, learning algorithms and statistical property testing algorithms.

In the latter category, Dr. Sitharam has been involved in applications dealing with noncooperative network environments such as QoS provision, requiring game theoretic modeling and analysis, and routing, delay and congestion optimization, requiring the development and implementation of graph theoretic algorithms. She is also involved in applications dealing with CAD, in particular algorithms for geometric constraint decomposition and manipulation which have a combined geometric and graph-theoretic flavor.

Projects:

Recent Publications

Personal Homepage