PageSourceSearch

https://goyal-rohan.github.io/

html goyal-rohan.github.io collected 2026-10-03 09:15:10 UTC 12,511 bytes, 235 lines download raw bytes

1<!DOCTYPE html>
2<html lang="en-US">
3  <head>
4    <title>Rohan Goyal | Massachusetts Institute of Technology</title>
5
6    <meta charset="UTF-8">
7    <meta http-equiv="X-UA-Compatible" content="IE=edge">
8    <meta name="viewport" content="width=device-width, initial-scale=1">
9    <meta name="description" content="PhD student in Theoretical Computer Science at MIT.">
10    
11    <meta name="keywords" content="Rohan Goyal, India mathematical olympiad">
12    
13    
14    <link rel="canonical" href="https://www.rohan23.me"/>
15    
16
17    <link rel="icon" media="(prefers-color-scheme:dark)" href="./assets/img/dark_rg.png" type="image/png" />
18    <link rel="icon" media="(prefers-color-scheme:light)" href="./assets/img/light_rg.png" type="image/png" />
19    
19<script src="./assets/js/favicon-switcher.js" type="application/javascript"></script>
19
20
21    <link rel=stylesheet href=https://cdnjs.cloudflare.com/ajax/libs/academicons/1.8.6/css/academicons.min.css integrity="sha256-uFVgMKfistnJAfoCUQigIl+JfUaP47GrRKjf6CTPVmw=" crossorigin=anonymous>
22    <link rel=stylesheet href=https://cdnjs.cloudflare.com/ajax/libs/font-awesome/5.11.2/css/all.min.css integrity="sha256-+N4/V/SbAFiW1MPBCXnfnP9QSN3+Keu+NlB+0ev/YKQ=" crossorigin=anonymous>
23
24    
25    <link rel="stylesheet" href="./assets/css/font.css">
26    
27    
28    <link rel="stylesheet" href="./assets/css/style.css">
29    <link rel="stylesheet" href="./assets/css/publications.css">
30    
31
32  </head>
33  <body>
34    <div class="wrapper">
35      <header>
36        
37        
38        <a class="image avatar"><img src="./assets/img/rohan_square2.jpg" alt="avatar" /></a>
39        
40
41        <h1>Rohan Goyal</h1>
42
43        
44        <position style="font-size:1.10rem;">PhD Student in Theoretical Computer Science</position>
45        <br>
46        
47        
48        <a href="" rel="noopener"><autocolor>Massachusetts Institute of Technology</autocolor></a>
49        <br>
50        
51        
52        <email>(first name) + '_g' (at) mit.edu</email>
53        
54
55        <br>
56        <br>
57        <div class="social-icons">
58        
59
60        
61        <a style="margin: 0 5px 0 0" href="assets/files/rohan-cv-short.pdf">
62          <i class="ai ai-cv" style="font-size:1.3rem;"></i>
63        </a>
64        
65
66        
67
68        
69
70        
71        </div>
72        <br>
73
74      </header>
75      <section>
76
77      <h2 id="about-me">About Me</h2>
78
79<p>I am a second-year PhD student in the <a href="https://toc.csail.mit.edu/">Theory of Computation Group</a> at MIT, where I am extremely fortunate to be advised by Yael Tauman Kalai.</p>
80
81<p>Before this, I did my BSc.(Hons) in Mathematics and Computer Science from <a href="https://www.cmi.ac.in/">Chennai Mathematical Institute</a>. During my undergrad, I was lucky enough to be advised by <a href="https://www.tcs.tifr.res.in/~prahladh/">Prahladh Harsha</a> and <a href="https://mrinalkr.bitbucket.io/">Mrinal Kumar</a>. I also spent summer 2024 in at <a href="https://www.irif.fr/">IRIF Paris</a> working under <a href="https://www.normalesup.org/~saulpic/">David Saulpic</a> on clustering algorithms. I will be spending summer 2026 interning with <a href="https://guyrothblum.wordpress.com/">Guy Rothblum</a> at Apple’s New York offices.</p>
82
83<h2 id="research-interests">Research Interests</h2>
84
85<p>My main interest is in error correction, proof systems, and more generally theoretical CS. I tend to enjoy most problems with flavours of combinatorics, algebra and randomization.</p>
86
87<h1 id="teaching-mit">Teaching (MIT):</h1>
88
89<h2 id="fall-2026">Fall 2026:</h2>
90<ul>
91  <li><a href="https://codes-6s953.github.io/">6.S953: Topics in Error-Correcting Codes for Computer Science</a>
92with <a href="https://www.csail.mit.edu/person/yael-kalai">Yael Tauman Kalai</a></li>
93</ul>
94
95<h1 id="taing-at-cmi">TAing at CMI:</h1>
96<p>Discrete Math: Spring 2023, 2024, <br />
97Complexity Theory 1: Spring 2023, <br />
98Theory of Computation: Fall 2022</p>
99
100<h2 id="publications">Publications:</h2>
101<p>All authors are in alphabetical order of last name.</p>
102
103<h1 id="preprints">Preprints</h1>
104
105<ul>
106  <li>
107    <p><strong>Improved analysis of list-decodability of random linear codes: It’s all about counting constraints</strong> <br />
108with <a href="https://people.eecs.berkeley.edu/~venkatg/">Venkatesan Guruswami</a>  <br />
109[<a href="https://eccc.weizmann.ac.il/report/2026/074/">ECCC</a>]</p>
110  </li>
111  <li>
112    <p><strong>Structure Theorems (and Fast Algorithms) for List Recovery of Subspace-Design Codes</strong> <br />
113with <a href="https://people.eecs.berkeley.edu/~venkatg/">Venkatesan Guruswami</a>           <br />
114[<a href="https://eccc.weizmann.ac.il/report/2025/212/">ECCC</a>] [<a href="https://arxiv.org/abs/2512.08017">ArXiV</a>]</p>
115  </li>
116</ul>
117
118<h1 id="2026">2026</h1>
119
120<ul>
121  <li>
122    <p><strong>Explicit Constant-Alphabet Subspace Design Codes</strong>      <br />
123with <a href="https://people.eecs.berkeley.edu/~venkatg/">Venkatesan Guruswami</a> and <a href="https://jthsieh.github.io/">Jun-Ting (Tim) Hsieh</a>.   <br />
124<span style="color:#16a085">FOCS 2026, New York</span>
125[<a href="https://eccc.weizmann.ac.il/report/2026/057/">ECCC</a>] [<a href="https://arxiv.org/abs/2604.15218v1">ArXiV</a>]</p>
126  </li>
127  <li>
128    <p><strong>Locality of Curve Decoding and Improved Proximity Gaps</strong>      <br />
129with <a href="https://people.eecs.berkeley.edu/~venkatg/">Venkatesan Guruswami</a>, <a href="https://scholar.google.com/citations?user=ZMNZ7x8AAAAJ&amp;hl=en">Yihang (Kimi) Sun</a> and <a href="https://sites.google.com/site/marywootters/">Mary Wootters</a>.    <br />
130<span style="color:#16a085">RANDOM 2026, Boston</span>
131[<a href="https://arxiv.org/abs/2607.08516">ArXiV</a>]</p>
132  </li>
133  <li>
134    <p><strong>Fast list-recovery of univariate multiplicity and folded Reed-Solomon codes</strong>  <br />
135with <a href="https://www.tcs.tifr.res.in/~prahladh/">Prahladh Harsha</a>, <a href="https://mrinalkr.bitbucket.io/">Mrinal Kumar</a>, and <a href="https://sites.google.com/view/ashutoshs/home">Ashutosh Shankar</a>.   <br />
136<span style="color:#16a085">RANDOM 2026, Boston</span>
137[<a href="https://eccc.weizmann.ac.il/report/2025/194/">ECCC</a>] [<a href="https://arxiv.org/abs/2512.00248">ArXiV</a>]</p>
138  </li>
139  <li>
140    <p><strong>Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes</strong>  <br />
141with <a href="https://people.eecs.berkeley.edu/~venkatg/">Venkatesan Guruswami</a>.  <br />
142<span style="color:#16a085">STOC 2026, Salt Lake City</span> [<a href="https://eccc.weizmann.ac.il/report/2025/166/">ECCC</a>]  [<a href="https://eprint.iacr.org/2025/2054">ePrint</a>]  [<a href="https://youtu.be/Dm-SaFFZS48?si=audrU4EMkOR9nrOE&amp;t=6975">Ethproofs call talk by Venkat</a>] [<a href="https://www.youtube.com/live/17KJo9eIsDc?si=rM_iyOcVxeGwDF9f">Talk at TIFR</a>]</p>
143  </li>
144</ul>
145
146<h1 id="2025">2025</h1>
147
148<ul>
149  <li><strong>Efficiently Batching Unambiguous Interactive Proofs</strong>   <br />
150with <a href="https://people.csail.mit.edu/bab/">Bonnie Berger</a>, <a href="https://people.csail.mit.edu/matth/">Matthew Hong</a>, and <a href="https://www.eecs.mit.edu/people/yael-kalai/">Yael Kalai</a>.  <br />
151<span style="color:#16a085">FOCS 2025, Sydney</span> [<a href="https://eccc.weizmann.ac.il/report/2025/159/">ECCC</a>] [<a href="https://arxiv.org/abs/2510.19075">ArXiV</a>]  [<a href="https://youtu.be/cN4whoNd-kM?si=uYMrfqrPOXgGycln">FOCS Video by Matt</a>]</li>
152</ul>
153
154<h1 id="2024">2024</h1>
155
156<ul>
157  <li><strong>Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes</strong>  <br />
158with <a href="https://www.tcs.tifr.res.in/~prahladh/">Prahladh Harsha</a>, <a href="https://mrinalkr.bitbucket.io/">Mrinal Kumar</a>, and <a href="https://sites.google.com/view/ashutoshs/home">Ashutosh Shankar</a>.  <br />
159<span style="color:#16a085">FOCS 2024, Chicago</span> [<a href="https://eccc.weizmann.ac.il/report/2023/185/">ECCC</a>] [<a href="https://arxiv.org/abs/2311.17841">ArXiV</a>] [<a href="https://www.youtube.com/live/t3AdyuYaPzI?si=Yalpe2fbju6czVSb">Simons Talk by Prahladh</a>]</li>
160</ul>
161
162<h2 id="service">Service:</h2>
163<p>Subreviewed for STOC, FOCS, CCC, RANDOM and ACM Transcations on Algorithms.</p>
164
165<h2 id="news">News</h2>
166
167<ul>
168  <li><strong>[May 2026 - August 2026]</strong>: Interning at Apple New York with <a href="https://guyrothblum.wordpress.com/">Guy Rothblum</a>.</li>
169  <li><strong>[January 2026]</strong>: Visiting Chennai Mathematical Institute, Tata Institute of Fundamental Research, Mumbai.</li>
170  <li><strong>[December 2025]</strong>: I will be at FOCS 2025 in Sydney!</li>
171  <li><strong>[December 2025]</strong>: Speaking at the Proofs and Codes Workshop at Cornell Tech.</li>
172  <li><strong>[Summer 2025]</strong>: Visited the Simons Institute for the Cryptography program.</li>
173  <li><strong>[January 2025]</strong>: Attended the Oberwolfach workshop on Cryptography.</li>
174  <li><strong>[Sept. 2024]</strong>: Started my PhD at MIT!</li>
175  <li><strong>[July 2024]</strong>: Participated in IMO 2024 as the Observer A for the Indian team. This was our best ever performance with country rank 4 and 4 gold medals. <a href="https://www.imo-official.org/team_r.aspx?code=IND&amp;year=2024">India at IMO 2024</a></li>
176  <li><strong>[June 2024]</strong> Interned at IRIF in Paris under <a href="https://www.normalesup.org/~saulpic/">David Saulpic</a> and <a href="https://irif.fr/~magniez/">Frédéric Magniez</a></li>
177  <li><strong>[May 2024]</strong> Finished my undergrad program at CMI.</li>
178  <li><strong>[May 2023]</strong> Started my summer internship at TIFR under Prof. Prahladh Harsha.</li>
179  <li><strong>[Apr. 2023]</strong> Participated in EGMO 2023 as the Deputy Leader for the Indian team. <a href="https://www.egmo.org/egmos/egmo12/countries/country35/">India at EGMO 2023</a></li>
180  <li><strong>[Sept. 2021]</strong> Started my undergraduate studies at CMI.</li>
181  <li><strong>[July 2021]</strong> Represented India at IMO 2021.</li>
182</ul>
183
184<h2 id="olympiad-and-outreach">Olympiad and Outreach</h2>
185
186<ul>
187  <li>
188    <p><strong>Indian Mathematical Olympiads:</strong>  I am currently also quite involved with Mathematical Olympiads in India. I help with team training for IMO and EGMO, problem selection, problem proposing and organizing selection camps from the national stage. If you wish to help or support the EGMO program in India, proposing or teaching, please feel free to reach out!</p>
189  </li>
190  <li>
191    <p><strong>Outreach:</strong>  I am also interested in understanding and improving school education in India especially in Mathematics and Computer Science. I want to understand how logical reasoning, puzzle solving and other aspects of problem solving can be inculcated into students at the grassroots level. I am also interested in increasing opportunities, awareness and recogonition for students who demonstrate extraordinary interest or capability in STEM fields.</p>
192  </li>
193</ul>
194
195<p>I would be extremely interested in any opportunities to work on more grassroots’ level for Mathematics education, Computational and Logical Thinking, Problem Solving etc. <strong>If you have any such opportunities where my experience would be useful, please feel free to reach out</strong>. For a list of activities I have been involved in, please reach out to me via email.</p>
196
197<!-- 
198
199## Some Olympiad Writings:
200
201Please visit [my old blog](https://rgtdfg.blogspot.com/p/handouts.html) for a list of Olympiad writings. (mostly outdated right now but I hope to update it soon. I don't like most of them anymore either as they are quite terse and hard to read.)
202
203-->
204
205<h2 id="talks-and-honors">Talks and Honors:</h2>
206<p>Please check my <a href="/assets/files/rohan-cv-short.pdf">cv</a>.</p>
207
208<p>– 
209Website updated May 2026</p>
210
211
212      <br>
213
214      
215      <p><small>Powered by Jekyll and <a href="https://github.com/yaoyao-liu/minimal-light" target="_blank" rel="noopener">Minimal Light</a> theme.</small></p>
216      
217
218      </section>
219      <footer>
220        
221      </footer>
222    </div>
223    
223<script src="/assets/js/scale.fix.js"></script>
223
224    
225    
225<script>
vendor: 364 bytes, lines 225-230
225
226      (function(i,s,o,g,r,a,m){i['GoogleAnalyticsObject']=r;i[r]=i[r]||function(){
227      (i[r].q=i[r].q||[]).push(arguments)},i[r].l=1*new Date();a=s.createElement(o),
228      m=s.getElementsByTagName(o)[0];a.async=1;a.src=g;m.parentNode.insertBefore(a,m)
229      })(window,document,'script','https://www.google-analytics.com/analytics.js','ga');
230      ga('create', '
230UA-111540567-4
vendor: 46 bytes, lines 230-232
230', 'auto');
231      ga('send', 'pageview');
232    
232</script>
232
233    
234  </body>
235</html>

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.