Theoretical Computer Science


The theoretical computer science community at Johns Hopkins deals with algorithmic and mathematical problems ranging from graph theory and combinatorics to data structures and algorithms in the areas of routing and scheduling, geometry, languages, and cryptography.


Giuseppe Ateniese
is currently doing research in applied cryptography, network security, and secure e-commerce.

Baruch Awerbuch
is interested in the algorithmic theory of communication networks, on-line and distributed computing.

James Fill (Mathematical Sciences)
is doing research in the areas of probability, stochastic processes (especially Markov chains), and random structures and algorithms.

Michael Goodrich (Research Professor)
his research is directed at the design of high performance algorithms and data structures for solving large-scale problems motivated from information assurance and security, the Internet, computer graphics, information visualization, and scientific data analysis. He is also interested in computer science education.

Rao Kosaraju
has done extensive work in the design and analysis of parallel and sequential algorithms. Recent research efforts include efficient algorithms for pattern matching, data structure simulations, universal graphs, DNA sequence assembly, n-body potentials, and paradigms for parallel data structures.

Avi Rubin
has done extensive work in the area of network security, applied cryptography, and privacy technology.

Christian Scheideler
his current fields of interest include routing in fixed-connection and mobile networks, storage networks, distributed algorithms, randomized algorithms and stochastic processes.

Edward Scheinerman (Mathematical Sciences)
his research interests are discrete mathematics, especially graph theory, partially ordered sets, random graphs, and combinatorics.
Last modified: January 16 2001