From fd3c53b17fd593e29f9d3073a4cd67aef1d78b53 Mon Sep 17 00:00:00 2001
From: SRA2 <36553394+SRA2@users.noreply.github.com>
Date: Mon, 20 Nov 2023 06:03:24 -0600
Subject: [PATCH] Update index.html

---
 index.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/index.html b/index.html
index a6efc28..acfb70b 100644
--- a/index.html
+++ b/index.html
@@ -61,7 +61,7 @@ <h2 style="margin-bottom:10px"> Selected Publications </h2>
 	      
     <td style="padding:10px;width:110%;vertical-align:middle">
               <p style="font-size:14.2px;margin-bottom:0;">
-                <papertitle><strong>Analyzing Ta-Shma’s Code via the Expander Mixing Lemma</strong></papertitle>, To Appear in IEEE Transactions on Information Theory, 2023 
+                <papertitle><strong>Analyzing Ta-Shma’s Code via the Expander Mixing Lemma</strong></papertitle>, IEEE Transactions on Information Theory, 2023 
               </p>
               <p style="font-size:13px;margin-bottom:0;">Silas Richelson, <strong>Sourya Roy</strong> </p>
               <a href="https://eccc.weizmann.ac.il/report/2022/004/" target="_blank"> paper </a> 
@@ -73,7 +73,7 @@ <h2 style="margin-bottom:10px"> Selected Publications </h2>
 	      
 	       <td style="padding:10px;width:110%;vertical-align:middle">
               <p style="font-size:14.2px;margin-bottom:0;">
-                <papertitle><strong>Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes</strong></papertitle>, To Appear in FOCS 2023
+                <papertitle><strong>Gilbert and Varshamov Meet Johnson: List-Decoding Explicit Nearly-Optimal Binary Codes</strong></papertitle>, FOCS 2023
               </p>
               <p style="font-size:13px;margin-bottom:0;">Silas Richelson, <strong>Sourya Roy</strong> </p>
               <a href="https://eccc.weizmann.ac.il/report/2022/069/" target="_blank"> paper </a>