Raj's Portrait Rajesh Jayaram

Email: rkjayaram (at) cs (dot) cmu (dot) edu

Office: GHC 9015

I am a second year PhD student in theoretical computer science at Carnegie Mellon University, where I am fortunate to be advised by David Woodruff. I graduated with a B.Sc. from Brown University in May of 2017, where I concentrated in mathematics and computer science.

My research interests are primarily in randomized algorithms, specifically streaming and sketching algorithms for problems in big-data. In general, I like to think about problems regarding dimensionality reduction -- i.e. to what extent can we extract and compress the significant bits of some enourmous, noisy data-set. Additionally, I am interested in communication complexity, machine learning, optimization, and fine grained complexity.


  1. Perfect $L_p$ Sampling in a Data Stream
    Rajesh Jayaram and David Woodruff, FOCS 2018

  2. Data Streams with Bounded Deletions
    Rajesh Jayaram and David Woodruff, PODS 2018
    Full Version on [arXiv]

  3. Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard!
    Rajesh Jayaram and Barna Saha, ICALP 2017
    Conference Version [pdf]


  1. Learning Stochastically Evolving Networks via Local Probing
    Rajesh Jayaram, advised by Eli Upfal (Senior Thesis)
    [pdf] [Defense Slides]

Teaching at Brown

In the fall of 2016, I was the Head TA for CS157 – Design and Analysis of Algorithms, taught by Prof. Paul Valiant.

In the spring of 2016, I was a TA for CS22 – Discrete Structures and Probability .