Theoretical Computer Science

Overview

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.

Faculty

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.

Susan Hohenberger: is primarily interested in cryptography, especially the design and construction of new algorithms and protocols. In addition, she is interested in computer security, complexity theory, and algorithms.

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, paradigms for parallel data structures, and immune system responses.
Avi Rubin: has done extensive work in the area of network security, applied cryptography, and privacy technology.
Edward Scheinerman (Mathematical Sciences): his research interests are discrete mathematics, especially graph theory, partially ordered sets, random graphs, and combinatorics.