default search action
Sivakanth Gopi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j13]Joshua Brakensiek
, Manik Dhar, Sivakanth Gopi
Improved Field Size Bounds for Higher Order MDS Codes. IEEE Trans. Inf. Theory 70(10): 6950-6960 (2024) - [j12]Da Yu, Sivakanth Gopi, Janardhan Kulkarni, Zinan Lin, Saurabh Naik, Tomasz Lukasz Religa, Jian Yin, Huishuai Zhang:
Selective Pre-training for Private Fine-tuning. Trans. Mach. Learn. Res. 2024 (2024) - [c30]Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Harsha Nori, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 1: Images. ICLR 2024 - [c29]Xinyu Tang, Richard Shin, Huseyin A. Inan, Andre Manoel, Fatemehsadat Mireshghallah, Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Robert Sim:
Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation. ICLR 2024 - [c28]Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. ICML 2024 - [c27]Joshua Brakensiek
Generalized GM-MDS: Polynomial Codes Are Higher Order MDS. STOC 2024: 728-739 - [c26]Joshua Brakensiek
AG Codes Achieve List Decoding Capacity over Constant-Sized Fields. STOC 2024: 740-751 - [i40]Chulin Xie, Zinan Lin, Arturs Backurs, Sivakanth Gopi, Da Yu, Huseyin A. Inan, Harsha Nori, Haotian Jiang, Huishuai Zhang, Yin Tat Lee, Bo Li, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 2: Text. CoRR abs/2403.01749 (2024) - [i39]Joshua Brakensiek, Manik Dhar, Jiyang Gao, Sivakanth Gopi, Matt Larson:
Rigidity matroids and linear algebraic matroids with applications to matrix completion and tensor codes. CoRR abs/2405.00778 (2024) - 2023
- [c25]Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian:
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler. COLT 2023: 2399-2439 - [c24]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Improved Field Size Bounds for Higher Order MDS Codes. ISIT 2023: 1243-1248 - [c23]Manik Dhar, Sivakanth Gopi:
A construction of Maximally Recoverable LRCs for small number of local groups. ISIT 2023: 1753-1757 - [c22]Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian:
Private Convex Optimization in General Norms. SODA 2023: 5068-5089 - [c21]Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Generic Reed-Solomon Codes Achieve List-Decoding Capacity. STOC 2023: 1488-1501 - [i38]Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian:
Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler. CoRR abs/2302.06085 (2023) - [i37]Da Yu, Sivakanth Gopi, Janardhan Kulkarni, Zinan Lin, Saurabh Naik, Tomasz Lukasz Religa, Jian Yin, Huishuai Zhang:
Selective Pre-training for Private Fine-tuning. CoRR abs/2305.13865 (2023) - [i36]Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Harsha Nori, Sergey Yekhanin:
Differentially Private Synthetic Data via Foundation Model APIs 1: Images. CoRR abs/2305.15560 (2023) - [i35]Suriya Gunasekar, Yi Zhang, Jyoti Aneja, Caio César Teodoro Mendes, Allie Del Giorno, Sivakanth Gopi, Mojan Javaheripi, Piero Kauffmann, Gustavo de Rosa, Olli Saarikivi, Adil Salim, Shital Shah, Harkirat Singh Behl, Xin Wang, Sébastien Bubeck, Ronen Eldan, Adam Tauman Kalai, Yin Tat Lee, Yuanzhi Li:
Textbooks Are All You Need. CoRR abs/2306.11644 (2023) - [i34]Xinyu Tang, Richard Shin, Huseyin A. Inan, Andre Manoel, Fatemehsadat Mireshghallah, Zinan Lin, Sivakanth Gopi, Janardhan Kulkarni, Robert Sim:
Privacy-Preserving In-Context Learning with Differentially Private Few-Shot Generation. CoRR abs/2309.11765 (2023) - [i33]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Generalized GM-MDS: Polynomial Codes are Higher Order MDS. CoRR abs/2310.12888 (2023) - [i32]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi, Zihan Zhang:
AG codes achieve list decoding capacity over contant-sized fields. CoRR abs/2310.12898 (2023) - 2022
- [j11]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. SIAM J. Comput. 51(3): 577-626 (2022) - [j10]Joshua Brakensiek
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes. IEEE Trans. Inf. Theory 68(11): 7125-7140 (2022) - [j9]Sivakanth Gopi
Improved Maximally Recoverable LRCs Using Skew Polynomials. IEEE Trans. Inf. Theory 68(11): 7198-7214 (2022) - [c20]Sivakanth Gopi, Yin Tat Lee, Daogao Liu:
Private Convex Optimization via Exponential Mechanism. COLT 2022: 1948-1989 - [c19]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. ICLR 2022 - [i31]Sivakanth Gopi, Yin Tat Lee, Daogao Liu:
Private Convex Optimization via Exponential Mechanism. CoRR abs/2203.00263 (2022) - [i30]Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Generic Reed-Solomon codes achieve list-decoding capacity. CoRR abs/2206.05256 (2022) - [i29]Sivakanth Gopi, Yin Tat Lee, Daogao Liu, Ruoqi Shen, Kevin Tian:
Private Convex Optimization in General Norms. CoRR abs/2207.08347 (2022) - [i28]Joshua Brakensiek, Manik Dhar, Sivakanth Gopi:
Improved Field Size Bounds for Higher Order MDS Codes. CoRR abs/2212.11262 (2022) - [i27]Manik Dhar, Sivakanth Gopi:
A construction of Maximally Recoverable LRCs for small number of local groups. CoRR abs/2212.12123 (2022) - 2021
- [j8]Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen
Differentially Private Set Union. J. Priv. Confidentiality 11(3) (2021) - [c18]Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin:
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. ISIT 2021: 2453-2458 - [c17]Kunho Kim, Sivakanth Gopi, Janardhan Kulkarni, Sergey Yekhanin:
Differentially Private n-gram Extraction. NeurIPS 2021: 5102-5111 - [c16]Sivakanth Gopi, Yin Tat Lee, Lukas Wutschitz:
Numerical Composition of Differential Privacy. NeurIPS 2021: 11631-11642 - [c15]Zhiqi Bu, Sivakanth Gopi, Janardhan Kulkarni, Yin Tat Lee, Judy Hanwen Shen, Uthaipon Tantipongpipat:
Fast and Memory Efficient Differentially Private-SGD via JL Projections. NeurIPS 2021: 19680-19691 - [i26]Zhiqi Bu, Sivakanth Gopi, Janardhan Kulkarni, Yin Tat Lee, Judy Hanwen Shen, Uthaipon Tantipongpipat:
Fast and Memory Efficient Differentially Private-SGD via JL Projections. CoRR abs/2102.03013 (2021) - [i25]Sivakanth Gopi, Yin Tat Lee, Lukas Wutschitz:
Numerical Composition of Differential Privacy. CoRR abs/2106.02848 (2021) - [i24]Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister, Sergey Yekhanin:
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage. CoRR abs/2107.06440 (2021) - [i23]Joshua Brakensiek, Sivakanth Gopi, Visu Makam:
Lower Bounds for Maximally Recoverable Tensor Code and Higher Order MDS Codes. CoRR abs/2107.10822 (2021) - [i22]Kunho Kim, Sivakanth Gopi, Janardhan Kulkarni, Sergey Yekhanin:
Differentially Private n-gram Extraction. CoRR abs/2108.02831 (2021) - [i21]Da Yu, Saurabh Naik, Arturs Backurs, Sivakanth Gopi, Huseyin A. Inan, Gautam Kamath, Janardhan Kulkarni, Yin Tat Lee, Andre Manoel, Lukas Wutschitz, Sergey Yekhanin, Huishuai Zhang:
Differentially Private Fine-tuning of Language Models. CoRR abs/2110.06500 (2021) - [i20]Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs using Skew Polynomials. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j7]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49(3): 465-496 (2020) - [j6]Sivakanth Gopi
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities. IEEE Trans. Inf. Theory 66(10): 6066-6083 (2020) - [c14]Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang:
Locally Private Hypothesis Selection. COLT 2020: 1785-1816 - [c13]Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin:
Differentially Private Set Union. ICML 2020: 3627-3636 - [i19]Sivakanth Gopi, Gautam Kamath, Janardhan Kulkarni, Aleksandar Nikolov, Zhiwei Steven Wu, Huanyu Zhang:
Locally Private Hypothesis Selection. CoRR abs/2002.09465 (2020) - [i18]Sivakanth Gopi, Pankaj Gulhane, Janardhan Kulkarni, Judy Hanwen Shen, Milad Shokouhi, Sergey Yekhanin:
Differentially Private Set Union. CoRR abs/2002.09745 (2020) - [i17]Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs using Skew Polynomials. CoRR abs/2012.07804 (2020)
2010 – 2019
- 2019
- [j5]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. Theory Comput. 15: 1-24 (2019) - [c12]Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson:
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS 2019: 32:1-32:20 - [c11]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
Maximally Recoverable LRCs: A field size lower bound and constructions for few heavy parities. SODA 2019: 2154-2170 - [c10]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with global modular constraints: algorithms and hardness via polynomial representations. STOC 2019: 590-601 - [i16]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. CoRR abs/1902.04740 (2019) - [i15]Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [b1]Sivakanth Gopi:
Locality in coding theory. Princeton University, USA, 2018 - [j4]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64(8): 5813-5831 (2018) - [j3]Xi Chen
Optimal Instance Adaptive Algorithm for the Top-K Ranking Problem. IEEE Trans. Inf. Theory 64(9): 6139-6160 (2018) - [i14]Zeev Dvir, Sivakanth Gopi, Avi Wigderson:
Spanoids - an abstraction of spanning structures, and a barrier for LCCs. CoRR abs/1809.10372 (2018) - 2017
- [j2]Arnab Bhattacharyya, Sivakanth Gopi:
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. ACM Trans. Comput. Theory 9(2): 7:1-7:17 (2017) - [c9]Arnab Bhattacharyya, Sivakanth Gopi, Avishay Tal:
Lower Bounds for 2-Query LCCs over Large Alphabet. APPROX-RANDOM 2017: 30:1-30:20 - [c8]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw Distributions and Locally Decodable Codes. ITCS 2017: 20:1-20:19 - [c7]Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider:
Competitive analysis of the top-K ranking problem. SODA 2017: 1245-1264 - [c6]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA 2017: 2073-2091 - [i13]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
On Maximally Recoverable Local Reconstruction Codes. CoRR abs/1710.10322 (2017) - [i12]Jop Briët, Sivakanth Gopi:
Gaussian width bounds with applications to arithmetic progressions in random settings. CoRR abs/1711.05624 (2017) - [i11]Sivakanth Gopi, Venkatesan Guruswami, Sergey Yekhanin:
On Maximally Recoverable Local Reconstruction Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j1]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with Subpolynomial Communication. J. ACM 63(4): 39:1-39:15 (2016) - [c5]Arnab Bhattacharyya, Sivakanth Gopi:
Lower Bounds for Constant Query Affine-Invariant LCCs and LTCs. CCC 2016: 12:1-12:17 - [i10]Xi Chen, Sivakanth Gopi, Jieming Mao, Jon Schneider:
Competitive analysis of the top-K ranking problem. CoRR abs/1605.03933 (2016) - [i9]Jop Briët, Zeev Dvir, Sivakanth Gopi:
Outlaw distributions and locally decodable codes. CoRR abs/1609.06355 (2016) - [i8]Arnab Bhattacharyya, Sivakanth Gopi:
Lower bounds for 2-query LCCs over large alphabet. CoRR abs/1611.06980 (2016) - [i7]Arnab Bhattacharyya, Sivakanth Gopi:
Lower bounds for 2-query LCCs over large alphabet. Electron. Colloquium Comput. Complex. TR16 (2016) - [i6]Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf:
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [c4]Zeev Dvir, Sivakanth Gopi:
On the Number of Rich Lines in Truly High Dimensional Sets. SoCG 2015: 584-598 - [c3]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with Sub-Polynomial Communication. STOC 2015: 577-584 - [i5]Arnab Bhattacharyya, Sivakanth Gopi:
Lower bounds for constant query affine-invariant LCCs and LTCs. CoRR abs/1511.07558 (2015) - [i4]Arnab Bhattacharyya, Sivakanth Gopi:
Lower bounds for constant query affine-invariant LCCs and LTCs. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i3]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with sub-polynomial communication. CoRR abs/1407.6692 (2014) - [i2]Zeev Dvir, Sivakanth Gopi:
On the number of rich lines in truly high dimensional sets. CoRR abs/1412.1060 (2014) - [i1]Zeev Dvir, Sivakanth Gopi:
2-Server PIR with sub-polynomial communication. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [c2]Sivakanth Gopi, Praneeth Netrapalli, Prateek Jain, Aditya V. Nori:
One-Bit Compressed Sensing: Provable Support and Vector Recovery. ICML (3) 2013: 154-162 - 2012
- [c1]Pavol Cerný, Sivakanth Gopi, Thomas A. Henzinger, Arjun Radhakrishna
Synthesis from incompatible specifications. EMSOFT 2012: 53-62
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: