Ahammed Ullah
I recently completed my PhD in Computer Science at Purdue University. My research interests are in graph algorithms, succinct graph representations, streaming algorithms, and time–space trade-offs, with a focus on designing algorithms and representations that improve both time and space efficiency in large-scale graph computation.
news
| May 2026 | New manuscript. Succinct Graph Representations and Algorithmic Applications is now available on arXiv. Link |
|---|---|
| Apr 2026 | PhD thesis defended. I defended my PhD thesis, Succinct Graph Representations and Poly-Streaming Matching. Purdue repository link |
| Sep 2025 | Best Paper Award. Weighted Matching in a Poly-Streaming Model, a paper based on one of my PhD projects, received the award at the European Symposium on Algorithms. Purdue CS news |