Hi, I'm Shubhang

I am a first year Ph.D. student with the theory group at the University of Illinois, Urbana Champaign. During my undergraduate (+ epsilon) years at Purdue University, I was fortunate to be advised by Elena Grigorescu and Jeremiah Blocki. My current research interests lie in theoretical computer science.

Here is my C.V. (last updated August 2020).


Research

Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
Karthik Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu.
(To Appear) International Symposium on Parameterized and Exact Computation (IPEC 2020).

Locally Decodable/Correctable Codes for Insertions and Deletions
Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu.
(To Appear) Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020).

The Maximum Binary Tree Problem
Karthik Chandrasekaran, Elena Grigorescu, Gabriel Istrate, Shubhang Kulkarni, Young-San Lin, Minshen Zhu.
European Symposia on Algorithms (ESA 2020).
[paper] [full arXiv version] [video by Young-San] [slides]

On Locally Decodable Codes in Resource Bounded Channels
Jeremiah Blocki, Shubhang Kulkarni, Samson Zhou.
Information Theoretic Cryptography (ITC 2020).
[paper] [full arXiv version] [Pre-Recorded Talk] [8 Min. Conference Talk]

Exploring Frequented Regions in Pan-Genomic Graphs.
Alan Cleary, Thiruvarangan Ramaraj, Indika Kahanda, Joann Mudge, Shubhang Kulkarni, Brendan Mumey.
15th Annual Rocky Mountain Bioinformatics Conference. ROCKY, 2017.
[Project] [Poster]
Poster Presented at Purdue CS Research Showcase.


Contact

You may reach me at smkulka2 [at] illinois [dot] edu

© 2020 Shubhang Kulkarni