Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Parikshit Gopalan
@inproceedings{DBLP:conf/innovations/BlasiokGHKN24,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Adam Tauman Kalai and
Preetum Nakkiran},
editor = {Venkatesan Guruswami},
title = {Loss Minimization Yields Multicalibration for Large Neural Networks},
booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {287},
pages = {17:1--17:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.17},
doi = {10.4230/LIPICS.ITCS.2024.17},
timestamp = {Wed, 24 Jan 2024 15:25:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BlasiokGHKN24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2401-14645,
author = {Parikshit Gopalan and
Princewill Okoroafor and
Prasad Raghavendra and
Abhishek Shetty and
Mihir Singhal},
title = {Omnipredictors for Regression and the Approximate Rank of Convex Functions},
journal = {CoRR},
volume = {abs/2401.14645},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2401.14645},
doi = {10.48550/ARXIV.2401.14645},
eprinttype = {arXiv},
eprint = {2401.14645},
timestamp = {Tue, 06 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2401-14645.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-07821,
author = {Parikshit Gopalan and
Lunjia Hu and
Guy N. Rothblum},
title = {On Computationally Efficient Multi-Class Calibration},
journal = {CoRR},
volume = {abs/2402.07821},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.07821},
doi = {10.48550/ARXIV.2402.07821},
eprinttype = {arXiv},
eprint = {2402.07821},
timestamp = {Mon, 19 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-07821.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanHKRW23,
author = {Parikshit Gopalan and
Lunjia Hu and
Michael P. Kim and
Omer Reingold and
Udi Wieder},
editor = {Yael Tauman Kalai},
title = {Loss Minimization Through the Lens Of Outcome Indistinguishability},
booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS}
2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}},
series = {LIPIcs},
volume = {251},
pages = {60:1--60:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.60},
doi = {10.4230/LIPICS.ITCS.2023.60},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GopalanHKRW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/BlasiokGHN23,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Preetum Nakkiran},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {When Does Optimizing a Proper Loss Yield Calibration?},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/e4165c96702bac5f4962b70f3cf2f136-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/BlasiokGHN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GollakotaGKS23,
author = {Aravind Gollakota and
Parikshit Gopalan and
Adam R. Klivans and
Konstantinos Stavropoulos},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Agnostically Learning Single-Index Models using Omnipredictors},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/2f46ef5725a8eca24f7f24a17955ad1a-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/GollakotaGKS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GopalanKR23,
author = {Parikshit Gopalan and
Michael P. Kim and
Omer Reingold},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {Swap Agnostic Learning, or Characterizing Omniprediction via Multicalibration},
booktitle = {Advances in Neural Information Processing Systems 36: Annual Conference
on Neural Information Processing Systems 2023, NeurIPS 2023, New Orleans,
LA, USA, December 10 - 16, 2023},
year = {2023},
url = {http://papers.nips.cc/paper\_files/paper/2023/hash/7d693203215325902ff9dbdd067a50ac-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/GopalanKR23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BlasiokGHN23,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Preetum Nakkiran},
editor = {Barna Saha and
Rocco A. Servedio},
title = {A Unifying Theory of Distance from Calibration},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1727--1740},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585182},
doi = {10.1145/3564246.3585182},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BlasiokGHN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-06726,
author = {Parikshit Gopalan and
Michael P. Kim and
Omer Reingold},
title = {Characterizing notions of omniprediction via multicalibration},
journal = {CoRR},
volume = {abs/2302.06726},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.06726},
doi = {10.48550/ARXIV.2302.06726},
eprinttype = {arXiv},
eprint = {2302.06726},
timestamp = {Mon, 20 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-06726.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-09424,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Adam Tauman Kalai and
Preetum Nakkiran},
title = {Loss minimization yields multicalibration for large neural networks},
journal = {CoRR},
volume = {abs/2304.09424},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.09424},
doi = {10.48550/ARXIV.2304.09424},
eprinttype = {arXiv},
eprint = {2304.09424},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-09424.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-18764,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Preetum Nakkiran},
title = {When Does Optimizing a Proper Loss Yield Calibration?},
journal = {CoRR},
volume = {abs/2305.18764},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.18764},
doi = {10.48550/ARXIV.2305.18764},
eprinttype = {arXiv},
eprint = {2305.18764},
timestamp = {Wed, 07 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-18764.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2306-10615,
author = {Aravind Gollakota and
Parikshit Gopalan and
Adam R. Klivans and
Konstantinos Stavropoulos},
title = {Agnostically Learning Single-Index Models using Omnipredictors},
journal = {CoRR},
volume = {abs/2306.10615},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2306.10615},
doi = {10.48550/ARXIV.2306.10615},
eprinttype = {arXiv},
eprint = {2306.10615},
timestamp = {Thu, 22 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2306-10615.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpc/BudiuTGWZ22,
author = {Mihai Budiu and
Pratiksha Thaker and
Parikshit Gopalan and
Udi Wieder and
Matei Zaharia},
title = {Overlook: Differentially Private Exploratory Visualization for Big
Data},
journal = {J. Priv. Confidentiality},
volume = {12},
number = {1},
year = {2022},
url = {https://doi.org/10.29012/jpc.779},
doi = {10.29012/JPC.779},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpc/BudiuTGWZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/GopalanRSW22,
author = {Parikshit Gopalan and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
editor = {Sanjoy Dasgupta and
Nika Haghtalab},
title = {Multicalibrated Partitions for Importance Weights},
booktitle = {International Conference on Algorithmic Learning Theory, 29 March
- 1 April 2022, Paris, France},
series = {Proceedings of Machine Learning Research},
volume = {167},
pages = {408--435},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v167/gopalan22a.html},
timestamp = {Fri, 10 Mar 2023 11:41:45 +0100},
biburl = {https://dblp.org/rec/conf/alt/GopalanRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GopalanKSZ22,
author = {Parikshit Gopalan and
Michael P. Kim and
Mihir Singhal and
Shengjia Zhao},
editor = {Po{-}Ling Loh and
Maxim Raginsky},
title = {Low-Degree Multicalibration},
booktitle = {Conference on Learning Theory, 2-5 July 2022, London, {UK}},
series = {Proceedings of Machine Learning Research},
volume = {178},
pages = {3193--3234},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v178/gopalan22a.html},
timestamp = {Tue, 12 Jul 2022 17:36:51 +0200},
biburl = {https://dblp.org/rec/conf/colt/GopalanKSZ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanKRSW22,
author = {Parikshit Gopalan and
Adam Tauman Kalai and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
editor = {Mark Braverman},
title = {Omnipredictors},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {79:1--79:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.79},
doi = {10.4230/LIPICS.ITCS.2022.79},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GopalanKRSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-13576,
author = {Parikshit Gopalan and
Nina Narodytska and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
title = {{KL} Divergence Estimation with Multi-group Attribution},
journal = {CoRR},
volume = {abs/2202.13576},
year = {2022},
url = {https://arxiv.org/abs/2202.13576},
eprinttype = {arXiv},
eprint = {2202.13576},
timestamp = {Thu, 03 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-13576.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2203-01255,
author = {Parikshit Gopalan and
Michael P. Kim and
Mihir Singhal and
Shengjia Zhao},
title = {Low-Degree Multicalibration},
journal = {CoRR},
volume = {abs/2203.01255},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2203.01255},
doi = {10.48550/ARXIV.2203.01255},
eprinttype = {arXiv},
eprint = {2203.01255},
timestamp = {Wed, 16 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2203-01255.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-08649,
author = {Parikshit Gopalan and
Lunjia Hu and
Michael P. Kim and
Omer Reingold and
Udi Wieder},
title = {Loss Minimization through the Lens of Outcome Indistinguishability},
journal = {CoRR},
volume = {abs/2210.08649},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.08649},
doi = {10.48550/ARXIV.2210.08649},
eprinttype = {arXiv},
eprint = {2210.08649},
timestamp = {Wed, 19 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-08649.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-16886,
author = {Jaroslaw Blasiok and
Parikshit Gopalan and
Lunjia Hu and
Preetum Nakkiran},
title = {A Unifying Theory of Distance from Calibration},
journal = {CoRR},
volume = {abs/2211.16886},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.16886},
doi = {10.48550/ARXIV.2211.16886},
eprinttype = {arXiv},
eprint = {2211.16886},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-16886.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-05853,
author = {Parikshit Gopalan and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
title = {Multicalibrated Partitions for Importance Weights},
journal = {CoRR},
volume = {abs/2103.05853},
year = {2021},
url = {https://arxiv.org/abs/2103.05853},
eprinttype = {arXiv},
eprint = {2103.05853},
timestamp = {Tue, 16 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-05853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-05389,
author = {Parikshit Gopalan and
Adam Tauman Kalai and
Omer Reingold and
Vatsal Sharan and
Udi Wieder},
title = {Omnipredictors},
journal = {CoRR},
volume = {abs/2109.05389},
year = {2021},
url = {https://arxiv.org/abs/2109.05389},
eprinttype = {arXiv},
eprint = {2109.05389},
timestamp = {Tue, 21 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-05389.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/GopalanY20,
author = {Parikshit Gopalan and
Amir Yehudayoff},
title = {Concentration for Limited Independence via Inequalities for the Elementary
Symmetric Polynomials},
journal = {Theory Comput.},
volume = {16},
pages = {1--29},
year = {2020},
url = {https://doi.org/10.4086/toc.2020.v016a017},
doi = {10.4086/TOC.2020.V016A017},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toc/GopalanY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanLW20,
author = {Parikshit Gopalan and
Roie Levin and
Udi Wieder},
editor = {Thomas Vidick},
title = {Finding Skewed Subcubes Under a Distribution},
booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
2020, January 12-14, 2020, Seattle, Washington, {USA}},
series = {LIPIcs},
volume = {151},
pages = {84:1--84:30},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.84},
doi = {10.4230/LIPICS.ITCS.2020.84},
timestamp = {Mon, 06 Jan 2020 16:50:09 +0100},
biburl = {https://dblp.org/rec/conf/innovations/GopalanLW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-12018,
author = {Pratiksha Thaker and
Mihai Budiu and
Parikshit Gopalan and
Udi Wieder and
Matei Zaharia},
title = {Overlook: Differentially Private Exploratory Visualization for Big
Data},
journal = {CoRR},
volume = {abs/2006.12018},
year = {2020},
url = {https://arxiv.org/abs/2006.12018},
eprinttype = {arXiv},
eprint = {2006.12018},
timestamp = {Tue, 23 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-12018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/BudiuGSWKA19,
author = {Mihai Budiu and
Parikshit Gopalan and
Lalith Suresh and
Udi Wieder and
Han Kruiger and
Marcos K. Aguilera},
title = {Hillview: {A} trillion-cell spreadsheet for big data},
journal = {Proc. {VLDB} Endow.},
volume = {12},
number = {11},
pages = {1442--1457},
year = {2019},
url = {http://www.vldb.org/pvldb/vol12/p1442-budiu.pdf},
doi = {10.14778/3342263.3342279},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pvldb/BudiuGSWKA19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/GopalanSW19,
author = {Parikshit Gopalan and
Vatsal Sharan and
Udi Wieder},
editor = {Hanna M. Wallach and
Hugo Larochelle and
Alina Beygelzimer and
Florence d'Alch{\'{e}}{-}Buc and
Emily B. Fox and
Roman Garnett},
title = {PIDForest: Anomaly Detection via Partial Identification},
booktitle = {Advances in Neural Information Processing Systems 32: Annual Conference
on Neural Information Processing Systems 2019, NeurIPS 2019, December
8-14, 2019, Vancouver, BC, Canada},
pages = {15783--15793},
year = {2019},
url = {https://proceedings.neurips.cc/paper/2019/hash/eb6dc8aba23375061b6f07b137617096-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/GopalanSW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04827,
author = {Mihai Budiu and
Parikshit Gopalan and
Lalith Suresh and
Udi Wieder and
Han Kruiger and
Marcos K. Aguilera},
title = {Hillview: {A} trillion-cell spreadsheet for big data},
journal = {CoRR},
volume = {abs/1907.04827},
year = {2019},
url = {http://arxiv.org/abs/1907.04827},
eprinttype = {arXiv},
eprint = {1907.04827},
timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1907-04827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-07378,
author = {Parikshit Gopalan and
Roie Levin and
Udi Wieder},
title = {Finding Skewed Subcubes Under a Distribution},
journal = {CoRR},
volume = {abs/1911.07378},
year = {2019},
url = {http://arxiv.org/abs/1911.07378},
eprinttype = {arXiv},
eprint = {1911.07378},
timestamp = {Mon, 02 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-07378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1912-03582,
author = {Parikshit Gopalan and
Vatsal Sharan and
Udi Wieder},
title = {PIDForest: Anomaly Detection via Partial Identification},
journal = {CoRR},
volume = {abs/1912.03582},
year = {2019},
url = {http://arxiv.org/abs/1912.03582},
eprinttype = {arXiv},
eprint = {1912.03582},
timestamp = {Thu, 02 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1912-03582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanKM18,
author = {Parikshit Gopalan and
Daniel M. Kane and
Raghu Meka},
title = {Pseudorandomness via the Discrete Fourier Transform},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {6},
pages = {2451--2487},
year = {2018},
url = {https://doi.org/10.1137/16M1062132},
doi = {10.1137/16M1062132},
timestamp = {Fri, 05 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanKM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/teco/GopalanNR18,
author = {Parikshit Gopalan and
Noam Nisan and
Tim Roughgarden},
title = {Public Projects, Boolean Functions, and the Borders of Border's Theorem},
journal = {{ACM} Trans. Economics and Comput.},
volume = {6},
number = {3-4},
pages = {18:1--18:21},
year = {2018},
url = {https://doi.org/10.1145/3274645},
doi = {10.1145/3274645},
timestamp = {Fri, 10 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/teco/GopalanNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/SharanGW18,
author = {Vatsal Sharan and
Parikshit Gopalan and
Udi Wieder},
editor = {Samy Bengio and
Hanna M. Wallach and
Hugo Larochelle and
Kristen Grauman and
Nicol{\`{o}} Cesa{-}Bianchi and
Roman Garnett},
title = {Efficient Anomaly Detection via Matrix Sketching},
booktitle = {Advances in Neural Information Processing Systems 31: Annual Conference
on Neural Information Processing Systems 2018, NeurIPS 2018, December
3-8, 2018, Montr{\'{e}}al, Canada},
pages = {8080--8091},
year = {2018},
url = {https://proceedings.neurips.cc/paper/2018/hash/34adeb8e3242824038aa65460a47c29e-Abstract.html},
timestamp = {Mon, 16 May 2022 15:41:51 +0200},
biburl = {https://dblp.org/rec/conf/nips/SharanGW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/usenix/SureshMGCL18,
author = {Lalith Suresh and
Dahlia Malkhi and
Parikshit Gopalan and
Ivan Porto Carreiro and
Zeeshan Lokhandwala},
editor = {Haryadi S. Gunawi and
Benjamin C. Reed},
title = {Stable and Consistent Membership at Scale with Rapid},
booktitle = {2018 {USENIX} Annual Technical Conference, {USENIX} {ATC} 2018, Boston,
MA, USA, July 11-13, 2018},
pages = {387--400},
publisher = {{USENIX} Association},
year = {2018},
url = {https://www.usenix.org/conference/atc18/presentation/suresh},
timestamp = {Sat, 25 Feb 2023 23:39:37 +0100},
biburl = {https://dblp.org/rec/conf/usenix/SureshMGCL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-03620,
author = {Lalith Suresh and
Dahlia Malkhi and
Parikshit Gopalan and
Ivan Porto Carreiro and
Zeeshan Lokhandwala},
title = {Stable and Consistent Membership at Scale with Rapid},
journal = {CoRR},
volume = {abs/1803.03620},
year = {2018},
url = {http://arxiv.org/abs/1803.03620},
eprinttype = {arXiv},
eprint = {1803.03620},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-03620.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03065,
author = {Parikshit Gopalan and
Vatsal Sharan and
Udi Wieder},
title = {Faster Anomaly Detection via Matrix Sketching},
journal = {CoRR},
volume = {abs/1804.03065},
year = {2018},
url = {http://arxiv.org/abs/1804.03065},
eprinttype = {arXiv},
eprint = {1804.03065},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03065.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanHKSWY17,
author = {Parikshit Gopalan and
Guangda Hu and
Swastik Kopparty and
Shubhangi Saraf and
Carol Wang and
Sergey Yekhanin},
editor = {Philip N. Klein},
title = {Maximally Recoverable Codes for Grid-like Topologies},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
16-19},
pages = {2092--2108},
publisher = {{SIAM}},
year = {2017},
url = {https://doi.org/10.1137/1.9781611974782.136},
doi = {10.1137/1.9781611974782.136},
timestamp = {Tue, 02 Feb 2021 17:07:33 +0100},
biburl = {https://dblp.org/rec/conf/soda/GopalanHKSWY17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanSW16,
author = {Parikshit Gopalan and
Rocco A. Servedio and
Avi Wigderson},
editor = {Ran Raz},
title = {Degree and Sensitivity: Tails of Two Distributions},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {13:1--13:23},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.13},
doi = {10.4230/LIPICS.CCC.2016.13},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanNSTW16,
author = {Parikshit Gopalan and
Noam Nisan and
Rocco A. Servedio and
Kunal Talwar and
Avi Wigderson},
editor = {Madhu Sudan},
title = {Smooth Boolean Functions are Easy: Efficient Algorithms for Low-Sensitivity
Functions},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, Cambridge, MA, USA, January 14-16, 2016},
pages = {59--70},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2840728.2840738},
doi = {10.1145/2840728.2840738},
timestamp = {Tue, 14 Jun 2022 13:12:41 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GopalanNSTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanSTW16,
author = {Parikshit Gopalan and
Rocco A. Servedio and
Avishay Tal and
Avi Wigderson},
title = {Degree and Sensitivity: tails of two distributions},
journal = {CoRR},
volume = {abs/1604.07432},
year = {2016},
url = {http://arxiv.org/abs/1604.07432},
eprinttype = {arXiv},
eprint = {1604.07432},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanSTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanHSWY16,
author = {Parikshit Gopalan and
Guangda Hu and
Shubhangi Saraf and
Carol Wang and
Sergey Yekhanin},
title = {Maximally Recoverable Codes for Grid-like Topologies},
journal = {CoRR},
volume = {abs/1605.05412},
year = {2016},
url = {http://arxiv.org/abs/1605.05412},
eprinttype = {arXiv},
eprint = {1605.05412},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanHSWY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanSTW16,
author = {Parikshit Gopalan and
Rocco A. Servedio and
Avishay Tal and
Avi Wigderson},
title = {Degree and Sensitivity: tails of two distributions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-069}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/069},
eprinttype = {ECCC},
eprint = {TR16-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanSTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BarakGHMRS15,
author = {Boaz Barak and
Parikshit Gopalan and
Johan H{\aa}stad and
Raghu Meka and
Prasad Raghavendra and
David Steurer},
title = {Making the Long Code Shorter},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {5},
pages = {1287--1324},
year = {2015},
url = {https://doi.org/10.1137/130929394},
doi = {10.1137/130929394},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BarakGHMRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanKM15,
author = {Parikshit Gopalan and
Daniel M. Kane and
Raghu Meka},
editor = {Venkatesan Guruswami},
title = {Pseudorandomness via the Discrete Fourier Transform},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {903--922},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.60},
doi = {10.1109/FOCS.2015.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigecom/GopalanNR15,
author = {Parikshit Gopalan and
Noam Nisan and
Tim Roughgarden},
editor = {Tim Roughgarden and
Michal Feldman and
Michael Schwarz},
title = {Public Projects, Boolean Functions, and the Borders of Border's Theorem},
booktitle = {Proceedings of the Sixteenth {ACM} Conference on Economics and Computation,
{EC} '15, Portland, OR, USA, June 15-19, 2015},
pages = {395},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2764468.2764538},
doi = {10.1145/2764468.2764538},
timestamp = {Fri, 02 Jun 2023 16:54:30 +0200},
biburl = {https://dblp.org/rec/conf/sigecom/GopalanNR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanNR15,
author = {Parikshit Gopalan and
Noam Nisan and
Tim Roughgarden},
title = {Public projects, Boolean functions and the borders of Border's theorem},
journal = {CoRR},
volume = {abs/1504.07687},
year = {2015},
url = {http://arxiv.org/abs/1504.07687},
eprinttype = {arXiv},
eprint = {1504.07687},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanNR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanKM15,
author = {Parikshit Gopalan and
Daniel M. Kane and
Raghu Meka},
title = {Pseudorandomness via the discrete Fourier transform},
journal = {CoRR},
volume = {abs/1506.04350},
year = {2015},
url = {http://arxiv.org/abs/1506.04350},
eprinttype = {arXiv},
eprint = {1506.04350},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanKM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanNSTW15,
author = {Parikshit Gopalan and
Noam Nisan and
Rocco A. Servedio and
Kunal Talwar and
Avi Wigderson},
title = {Smooth Boolean functions are easy: efficient algorithms for low-sensitivity
functions},
journal = {CoRR},
volume = {abs/1508.02420},
year = {2015},
url = {http://arxiv.org/abs/1508.02420},
eprinttype = {arXiv},
eprint = {1508.02420},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanNSTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanNSTW15,
author = {Parikshit Gopalan and
Noam Nisan and
Rocco A. Servedio and
Kunal Talwar and
Avi Wigderson},
title = {Smooth Boolean functions are easy: efficient algorithms for low-sensitivity
functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-131}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/131},
eprinttype = {ECCC},
eprint = {TR15-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanNSTW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Gopalan14,
author = {Parikshit Gopalan},
title = {Constructing Ramsey graphs from Boolean function representations},
journal = {Comb.},
volume = {34},
number = {2},
pages = {173--206},
year = {2014},
url = {https://doi.org/10.1007/s00493-014-2367-1},
doi = {10.1007/S00493-014-2367-1},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Gopalan14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GopalanHJY14,
author = {Parikshit Gopalan and
Cheng Huang and
Bob Jenkins and
Sergey Yekhanin},
title = {Explicit Maximally Recoverable Codes With Locality},
journal = {{IEEE} Trans. Inf. Theory},
volume = {60},
number = {9},
pages = {5245--5256},
year = {2014},
url = {https://doi.org/10.1109/TIT.2014.2332338},
doi = {10.1109/TIT.2014.2332338},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GopalanHJY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/GopalanVZ14,
author = {Parikshit Gopalan and
Salil P. Vadhan and
Yuan Zhou},
editor = {Moni Naor},
title = {Locally testable codes and cayley graphs},
booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ,
USA, January 12-14, 2014},
pages = {81--92},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2554797.2554807},
doi = {10.1145/2554797.2554807},
timestamp = {Mon, 09 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/GopalanVZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanY14,
author = {Parikshit Gopalan and
Amir Yehudayoff},
title = {Inequalities and tail bounds for elementary symmetric polynomial},
journal = {CoRR},
volume = {abs/1402.3543},
year = {2014},
url = {http://arxiv.org/abs/1402.3543},
eprinttype = {arXiv},
eprint = {1402.3543},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanKM14,
author = {Parikshit Gopalan and
Daniel M. Kane and
Raghu Meka},
title = {Pseudorandomness for concentration bounds and signed majorities},
journal = {CoRR},
volume = {abs/1411.4584},
year = {2014},
url = {http://arxiv.org/abs/1411.4584},
eprinttype = {arXiv},
eprint = {1411.4584},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanKM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanY14,
author = {Parikshit Gopalan and
Amir Yehudayoff},
title = {Inequalities and tail bounds for elementary symmetric polynomials},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-019}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/019},
eprinttype = {ECCC},
eprint = {TR14-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GopalanMR13,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold},
title = {{DNF} sparsification and a faster deterministic counting algorithm},
journal = {Comput. Complex.},
volume = {22},
number = {2},
pages = {275--310},
year = {2013},
url = {https://doi.org/10.1007/s00037-013-0068-6},
doi = {10.1007/S00037-013-0068-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GopalanMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanMRZ13,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
David Zuckerman},
title = {Pseudorandom Generators for Combinatorial Shapes},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {3},
pages = {1051--1076},
year = {2013},
url = {https://doi.org/10.1137/110854990},
doi = {10.1137/110854990},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanMRZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Gopalan13,
author = {Parikshit Gopalan},
title = {A Fourier-Analytic Approach to Reed-Muller Decoding},
journal = {{IEEE} Trans. Inf. Theory},
volume = {59},
number = {11},
pages = {7747--7760},
year = {2013},
url = {https://doi.org/10.1109/TIT.2013.2274007},
doi = {10.1109/TIT.2013.2274007},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Gopalan13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isca/AzevedoDSGMY13,
author = {Rodolfo Azevedo and
John D. Davis and
Karin Strauss and
Parikshit Gopalan and
Mark S. Manasse and
Sergey Yekhanin},
editor = {Avi Mendelson},
title = {Zombie memory: extending memory lifetime by reviving dead blocks},
booktitle = {The 40th Annual International Symposium on Computer Architecture,
ISCA'13, Tel-Aviv, Israel, June 23-27, 2013},
pages = {452--463},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2485922.2485961},
doi = {10.1145/2485922.2485961},
timestamp = {Fri, 09 Jul 2021 15:51:20 +0200},
biburl = {https://dblp.org/rec/conf/isca/AzevedoDSGMY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanHJY13,
author = {Parikshit Gopalan and
Cheng Huang and
Bob Jenkins and
Sergey Yekhanin},
title = {Explicit Maximally Recoverable Codes with Locality},
journal = {CoRR},
volume = {abs/1307.4150},
year = {2013},
url = {http://arxiv.org/abs/1307.4150},
eprinttype = {arXiv},
eprint = {1307.4150},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/GopalanHJY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GopalanVZ13,
author = {Parikshit Gopalan and
Salil P. Vadhan and
Yuan Zhou},
title = {Locally Testable Codes and Cayley Graphs},
journal = {CoRR},
volume = {abs/1308.5158},
year = {2013},
url = {http://arxiv.org/abs/1308.5158},
eprinttype = {arXiv},
eprint = {1308.5158},
timestamp = {Mon, 09 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GopalanVZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanHJY13,
author = {Parikshit Gopalan and
Cheng Huang and
Bob Jenkins and
Sergey Yekhanin},
title = {Explicit Maximally Recoverable Codes with Locality},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-104}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/104},
eprinttype = {ECCC},
eprint = {TR13-104},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanHJY13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanVZ13,
author = {Parikshit Gopalan and
Salil P. Vadhan and
Yuan Zhou},
title = {Locally Testable Codes and Cayley Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-114}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/114},
eprinttype = {ECCC},
eprint = {TR13-114},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanVZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/GopalanHSY12,
author = {Parikshit Gopalan and
Cheng Huang and
Huseyin Simitci and
Sergey Yekhanin},
title = {On the Locality of Codeword Symbols},
journal = {{IEEE} Trans. Inf. Theory},
volume = {58},
number = {11},
pages = {6925--6934},
year = {2012},
url = {https://doi.org/10.1109/TIT.2012.2208937},
doi = {10.1109/TIT.2012.2208937},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/GopalanHSY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanMR12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold},
title = {{DNF} Sparsification and a Faster Deterministic Counting Algorithm},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {126--135},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.38},
doi = {10.1109/CCC.2012.38},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanMRTV12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Better Pseudorandom Generators from Milder Pseudorandom Restrictions},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {120--129},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.77},
doi = {10.1109/FOCS.2012.77},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanMRTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BarakGHMRS12,
author = {Boaz Barak and
Parikshit Gopalan and
Johan H{\aa}stad and
Raghu Meka and
Prasad Raghavendra and
David Steurer},
title = {Making the Long Code Shorter},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {370--379},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.83},
doi = {10.1109/FOCS.2012.83},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BarakGHMRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/usenix/HuangSXOCG0Y12,
author = {Cheng Huang and
Huseyin Simitci and
Yikang Xu and
Aaron Ogus and
Brad Calder and
Parikshit Gopalan and
Jin Li and
Sergey Yekhanin},
editor = {Gernot Heiser and
Wilson C. Hsieh},
title = {Erasure Coding in Windows Azure Storage},
booktitle = {2012 {USENIX} Annual Technical Conference, Boston, MA, USA, June 13-15,
2012},
pages = {15--26},
publisher = {{USENIX} Association},
year = {2012},
url = {https://www.usenix.org/conference/atc12/technical-sessions/presentation/huang},
timestamp = {Mon, 01 Feb 2021 08:43:32 +0100},
biburl = {https://dblp.org/rec/conf/usenix/HuangSXOCG0Y12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/jmlr/GopalanKM12,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka},
editor = {Shie Mannor and
Nathan Srebro and
Robert C. Williamson},
title = {Learning Functions of Halfspaces using Prefix Covers},
booktitle = {{COLT} 2012 - The 25th Annual Conference on Learning Theory, June
25-27, 2012, Edinburgh, Scotland},
series = {{JMLR} Proceedings},
volume = {23},
pages = {15.1--15.10},
publisher = {JMLR.org},
year = {2012},
url = {http://proceedings.mlr.press/v23/gopalan12/gopalan12.pdf},
timestamp = {Wed, 29 May 2019 08:41:46 +0200},
biburl = {https://dblp.org/rec/journals/jmlr/GopalanKM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-3534,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold},
title = {{DNF} Sparsification and a Faster Deterministic Counting Algorithm},
journal = {CoRR},
volume = {abs/1205.3534},
year = {2012},
url = {http://arxiv.org/abs/1205.3534},
eprinttype = {arXiv},
eprint = {1205.3534},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-3534.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1210-0049,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Better Pseudorandom Generators from Milder Pseudorandom Restrictions},
journal = {CoRR},
volume = {abs/1210.0049},
year = {2012},
url = {http://arxiv.org/abs/1210.0049},
eprinttype = {arXiv},
eprint = {1210.0049},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1210-0049.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanMR12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold},
title = {{DNF} Sparsification and a Faster Deterministic Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-060}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/060},
eprinttype = {ECCC},
eprint = {TR12-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanMRTV12,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
Luca Trevisan and
Salil P. Vadhan},
title = {Better pseudorandom generators from milder pseudorandom restrictions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-123}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/123},
eprinttype = {ECCC},
eprint = {TR12-123},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanMRTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GopalanG11,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Hardness amplification within {NP} against deterministic algorithms},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {1},
pages = {107--121},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.06.008},
doi = {10.1016/J.JCSS.2010.06.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GopalanG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanOSSW11,
author = {Parikshit Gopalan and
Ryan O'Donnell and
Rocco A. Servedio and
Amir Shpilka and
Karl Wimmer},
title = {Testing Fourier Dimensionality and Sparsity},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {4},
pages = {1075--1100},
year = {2011},
url = {https://doi.org/10.1137/100785429},
doi = {10.1137/100785429},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanOSSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DvirGY11,
author = {Zeev Dvir and
Parikshit Gopalan and
Sergey Yekhanin},
title = {Matching Vector Codes},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {4},
pages = {1154--1178},
year = {2011},
url = {https://doi.org/10.1137/100804322},
doi = {10.1137/100804322},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DvirGY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanGR11,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
title = {List Decoding Tensor Products and Interleaved Codes},
journal = {{SIAM} J. Comput.},
volume = {40},
number = {5},
pages = {1432--1462},
year = {2011},
url = {https://doi.org/10.1137/090778274},
doi = {10.1137/090778274},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanKMSVV11,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka and
Daniel Stefankovic and
Santosh S. Vempala and
Eric Vigoda},
editor = {Rafail Ostrovsky},
title = {An {FPTAS} for {\#}Knapsack and Related Counting Problems},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {817--826},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.32},
doi = {10.1109/FOCS.2011.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanKMSVV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GopalanMRZ11,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
David Zuckerman},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Pseudorandom generators for combinatorial shapes},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {253--262},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993671},
doi = {10.1145/1993636.1993671},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GopalanMRZ11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-3625,
author = {Parikshit Gopalan and
Cheng Huang and
Huseyin Simitci and
Sergey Yekhanin},
title = {On the Locality of Codeword Symbols},
journal = {CoRR},
volume = {abs/1106.3625},
year = {2011},
url = {http://arxiv.org/abs/1106.3625},
eprinttype = {arXiv},
eprint = {1106.3625},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-3625.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0405,
author = {Boaz Barak and
Parikshit Gopalan and
Johan H{\aa}stad and
Raghu Meka and
Prasad Raghavendra and
David Steurer},
title = {Making the long code shorter, with applications to the Unique Games
Conjecture},
journal = {CoRR},
volume = {abs/1111.0405},
year = {2011},
url = {http://arxiv.org/abs/1111.0405},
eprinttype = {arXiv},
eprint = {1111.0405},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0405.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BarakGHMRS11,
author = {Boaz Barak and
Parikshit Gopalan and
Johan H{\aa}stad and
Raghu Meka and
Prasad Raghavendra and
David Steurer},
title = {Making the long code shorter, with applications to the Unique Games
Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-142}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/142},
eprinttype = {ECCC},
eprint = {TR11-142},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BarakGHMRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanHSY11,
author = {Parikshit Gopalan and
Cheng Huang and
Huseyin Simitci and
Sergey Yekhanin},
title = {On the Locality of Codeword Symbols},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-100}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/100},
eprinttype = {ECCC},
eprint = {TR11-100},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanHSY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GopalanSL10,
author = {Parikshit Gopalan and
Amir Shpilka and
Shachar Lovett},
title = {The Complexity of Boolean Functions in Different Characteristics},
journal = {Comput. Complex.},
volume = {19},
number = {2},
pages = {235--263},
year = {2010},
url = {https://doi.org/10.1007/s00037-010-0290-4},
doi = {10.1007/S00037-010-0290-4},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/GopalanSL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanKS10,
author = {Parikshit Gopalan and
Subhash Khot and
Rishi Saket},
title = {Hardness of Reconstructing Multivariate Polynomials over Finite Fields},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {6},
pages = {2598--2621},
year = {2010},
url = {https://doi.org/10.1137/070705258},
doi = {10.1137/070705258},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanKS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DiakonikolasGJSV10,
author = {Ilias Diakonikolas and
Parikshit Gopalan and
Ragesh Jaiswal and
Rocco A. Servedio and
Emanuele Viola},
title = {Bounded Independence Fools Halfspaces},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3441--3462},
year = {2010},
url = {https://doi.org/10.1137/100783030},
doi = {10.1137/100783030},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DiakonikolasGJSV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GalG10,
author = {Anna G{\'{a}}l and
Parikshit Gopalan},
title = {Lower Bounds on Streaming Algorithms for Approximating the Length
of the Longest Increasing Subsequence},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {8},
pages = {3463--3479},
year = {2010},
url = {https://doi.org/10.1137/090770801},
doi = {10.1137/090770801},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GalG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/GopalanS10,
author = {Parikshit Gopalan and
Rocco A. Servedio},
editor = {Maria J. Serna and
Ronen Shaltiel and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Learning and Lower Bounds for AC\({}^{\mbox{0}}\) with Threshold Gates},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 13th International Workshop, {APPROX} 2010, and 14th
International Workshop, {RANDOM} 2010, Barcelona, Spain, September
1-3, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6302},
pages = {588--601},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15369-3\_44},
doi = {10.1007/978-3-642-15369-3\_44},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/GopalanS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanOWZ10,
author = {Parikshit Gopalan and
Ryan O'Donnell and
Yi Wu and
David Zuckerman},
title = {Fooling Functions of Halfspaces under Product Distributions},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {223--234},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.29},
doi = {10.1109/CCC.2010.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanOWZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Gopalan10,
author = {Parikshit Gopalan},
title = {A Fourier-Analytic Approach to Reed-Muller Decoding},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {685--694},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.71},
doi = {10.1109/FOCS.2010.71},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Gopalan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DvirGY10,
author = {Zeev Dvir and
Parikshit Gopalan and
Sergey Yekhanin},
title = {Matching Vector Codes},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {705--714},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.73},
doi = {10.1109/FOCS.2010.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DvirGY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-1593,
author = {Parikshit Gopalan and
Ryan O'Donnell and
Yi Wu and
David Zuckerman},
title = {Fooling functions of halfspaces under product distributions},
journal = {CoRR},
volume = {abs/1001.1593},
year = {2010},
url = {http://arxiv.org/abs/1001.1593},
eprinttype = {arXiv},
eprint = {1001.1593},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-1593.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-3187,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka},
title = {Polynomial-Time Approximation Schemes for Knapsack and Related Counting
Problems using Branching Programs},
journal = {CoRR},
volume = {abs/1008.3187},
year = {2010},
url = {http://arxiv.org/abs/1008.3187},
eprinttype = {arXiv},
eprint = {1008.3187},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-3187.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DvirGY10,
author = {Zeev Dvir and
Parikshit Gopalan and
Sergey Yekhanin},
title = {Matching Vector Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-012}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/012},
eprinttype = {ECCC},
eprint = {TR10-012},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DvirGY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanKM10,
author = {Parikshit Gopalan and
Adam R. Klivans and
Raghu Meka},
title = {Polynomial-Time Approximation Schemes for Knapsack and Related Counting
Problems using Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-133}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/133},
eprinttype = {ECCC},
eprint = {TR10-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanKM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanMRZ10,
author = {Parikshit Gopalan and
Raghu Meka and
Omer Reingold and
David Zuckerman},
title = {Pseudorandom Generators for Combinatorial Shapes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-176}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/176},
eprinttype = {ECCC},
eprint = {TR10-176},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanMRZ10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanS10,
author = {Parikshit Gopalan and
Rocco A. Servedio},
title = {Learning and Lower Bounds for AC\({}^{\mbox{0}}\) with Threshold Gates},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-074}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/074},
eprinttype = {ECCC},
eprint = {TR10-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WuOZG10,
author = {Yi Wu and
Ryan O'Donnell and
David Zuckerman and
Parikshit Gopalan},
title = {Fooling functions of halfspaces under product distributions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-006}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/006},
eprinttype = {ECCC},
eprint = {TR10-006},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WuOZG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GopalanKMP09,
author = {Parikshit Gopalan and
Phokion G. Kolaitis and
Elitza N. Maneva and
Christos H. Papadimitriou},
title = {The Connectivity of Boolean Satisfiability: Computational and Structural
Dichotomies},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {6},
pages = {2330--2355},
year = {2009},
url = {https://doi.org/10.1137/07070440X},
doi = {10.1137/07070440X},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GopalanKMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FeldmanGKP09,
author = {Vitaly Feldman and
Parikshit Gopalan and
Subhash Khot and
Ashok Kumar Ponnuswami},
title = {On Agnostic Learning of Parities, Monomials, and Halfspaces},
journal = {{SIAM} J. Comput.},
volume = {39},
number = {2},
pages = {606--645},
year = {2009},
url = {https://doi.org/10.1137/070684914},
doi = {10.1137/070684914},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FeldmanGKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanLS09,
author = {Parikshit Gopalan and
Shachar Lovett and
Amir Shpilka},
title = {On the Complexity of Boolean Functions in Different Characteristics},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {173--183},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.14},
doi = {10.1109/CCC.2009.14},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/GopalanLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DiakonikolasGJSV09,
author = {Ilias Diakonikolas and
Parikshit Gopalan and
Ragesh Jaiswal and
Rocco A. Servedio and
Emanuele Viola},
title = {Bounded Independence Fools Halfspaces},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {171--180},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.68},
doi = {10.1109/FOCS.2009.68},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DiakonikolasGJSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GopalanOSSW09,
author = {Parikshit Gopalan and
Ryan O'Donnell and
Rocco A. Servedio and
Amir Shpilka and
Karl Wimmer},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {Testing Fourier Dimensionality and Sparsity},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {500--512},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_42},
doi = {10.1007/978-3-642-02927-1\_42},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GopalanOSSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanR09,
author = {Parikshit Gopalan and
Jaikumar Radhakrishnan},
editor = {Claire Mathieu},
title = {Finding duplicates in a data stream},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {402--411},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.45},
doi = {10.1137/1.9781611973068.45},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GopalanR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GopalanGR09,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
editor = {Michael Mitzenmacher},
title = {List decoding tensor products and interleaved codes},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {13--22},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536419},
doi = {10.1145/1536414.1536419},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GopalanGR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0902-3757,
author = {Ilias Diakonikolas and
Parikshit Gopalan and
Ragesh Jaiswal and
Rocco A. Servedio and
Emanuele Viola},
title = {Bounded Independence Fools Halfspaces},
journal = {CoRR},
volume = {abs/0902.3757},
year = {2009},
url = {http://arxiv.org/abs/0902.3757},
eprinttype = {arXiv},
eprint = {0902.3757},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0902-3757.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DiakonikolasGJSV09,
author = {Ilias Diakonikolas and
Parikshit Gopalan and
Ragesh Jaiswal and
Rocco A. Servedio and
Emanuele Viola},
title = {Bounded Independence Fools Halfspaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-016}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/016},
eprinttype = {ECCC},
eprint = {TR09-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DiakonikolasGJSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Gopalan09,
author = {Parikshit Gopalan},
title = {A Fourier-analytic approach to Reed-Muller decoding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-037}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/037},
eprinttype = {ECCC},
eprint = {TR09-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Gopalan09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Gopalan09a,
author = {Parikshit Gopalan},
title = {A note on Efremenko's Locally Decodable Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-069}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/069},
eprinttype = {ECCC},
eprint = {TR09-069},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Gopalan09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanLS09,
author = {Parikshit Gopalan and
Shachar Lovett and
Amir Shpilka},
title = {On the Complexity of Boolean Functions in Different Characteristics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-048}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/048},
eprinttype = {ECCC},
eprint = {TR09-048},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanLS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GopalanGL08,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Richard J. Lipton},
title = {Algorithms for Modular Counting of Roots of Multivariate Polynomials},
journal = {Algorithmica},
volume = {50},
number = {4},
pages = {479--496},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9097-3},
doi = {10.1007/S00453-007-9097-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GopalanGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BasuBGL08,
author = {Saugata Basu and
Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Polynomials that Sign Represent Parity and Descartes' Rule of Signs},
journal = {Comput. Complex.},
volume = {17},
number = {3},
pages = {377--406},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0244-2},
doi = {10.1007/S00037-008-0244-2},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/BasuBGL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Gopalan08,
author = {Parikshit Gopalan},
title = {Query-Efficient Algorithms for Polynomial Interpolation over Composites},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {3},
pages = {1033--1057},
year = {2008},
url = {https://doi.org/10.1137/060661259},
doi = {10.1137/060661259},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Gopalan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GopalanG08,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Hardness Amplification within {NP} against Deterministic Algorithms},
booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational
Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}},
pages = {19--30},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/CCC.2008.17},
doi = {10.1109/CCC.2008.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GopalanG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colt/GopalanKK08,
author = {Parikshit Gopalan and
Adam Kalai and
Adam R. Klivans},
editor = {Rocco A. Servedio and
Tong Zhang},
title = {A Query Algorithm for Agnostically Learning DNF?},
booktitle = {21st Annual Conference on Learning Theory - {COLT} 2008, Helsinki,
Finland, July 9-12, 2008},
pages = {515--516},
publisher = {Omnipress},
year = {2008},
url = {http://colt2008.cs.helsinki.fi/papers/Gopalan-open-question.pdf},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/colt/GopalanKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GopalanKZ08,
author = {Parikshit Gopalan and
Adam R. Klivans and
David Zuckerman},
editor = {Cynthia Dwork},
title = {List-decoding reed-muller codes over small fields},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {265--274},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374417},
doi = {10.1145/1374376.1374417},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GopalanKZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GopalanKK08,
author = {Parikshit Gopalan and
Adam Tauman Kalai and
Adam R. Klivans},
editor = {Cynthia Dwork},
title = {Agnostically learning decision trees},
booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
Victoria, British Columbia, Canada, May 17-20, 2008},
pages = {527--536},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1374376.1374451},
doi = {10.1145/1374376.1374451},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GopalanKK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-4395,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
title = {List Decoding Tensor Products and Interleaved Codes},
journal = {CoRR},
volume = {abs/0811.4395},
year = {2008},
url = {http://arxiv.org/abs/0811.4395},
eprinttype = {arXiv},
eprint = {0811.4395},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-4395.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanGRR08,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Prasad Raghavendra},
title = {List Decoding Tensor Products and Interleaved Codes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-105}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-105/index.html},
eprinttype = {ECCC},
eprint = {TR08-105},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanGRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GalG07,
author = {Anna G{\'{a}}l and
Parikshit Gopalan},
title = {Lower Bounds on Streaming Algorithms for Approximating the Length
of the Longest Increasing Subsequence},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {294--304},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.39},
doi = {10.1109/FOCS.2007.39},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GalG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GopalanKS07,
author = {Parikshit Gopalan and
Subhash Khot and
Rishi Saket},
title = {Hardness of Reconstructing Multivariate Polynomials over Finite Fields},
booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
pages = {349--359},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/FOCS.2007.31},
doi = {10.1109/FOCS.2007.31},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GopalanKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanJKK07,
author = {Parikshit Gopalan and
T. S. Jayram and
Robert Krauthgamer and
Ravi Kumar},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {Estimating the sortedness of a data stream},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {318--327},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283417},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/GopalanJKK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanG07,
author = {Parikshit Gopalan and
Venkatesan Guruswami},
title = {Deterministic Hardness Amplification via Local {GMD} Decoding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-089}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-089/index.html},
eprinttype = {ECCC},
eprint = {TR07-089},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanG07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanKS07,
author = {Parikshit Gopalan and
Subhash Khot and
Rishi Saket},
title = {Hardness of Reconstructing Multivariate Polynomials over Finite Fields},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-073}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-073/index.html},
eprinttype = {ECCC},
eprint = {TR07-073},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanKS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BhatnagarGL06,
author = {Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Symmetric polynomials over Z\({}_{\mbox{\emph{m}}}\) and simultaneous
communication protocols},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {2},
pages = {252--285},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.06.007},
doi = {10.1016/J.JCSS.2005.06.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BhatnagarGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Gopalan06,
author = {Parikshit Gopalan},
title = {Constructing Ramsey Graphs from Boolean Function Representations},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {115--128},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.14},
doi = {10.1109/CCC.2006.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Gopalan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FeldmanGKP06,
author = {Vitaly Feldman and
Parikshit Gopalan and
Subhash Khot and
Ashok Kumar Ponnuswami},
title = {New Results for Learning Noisy Parities and Halfspaces},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {563--574},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.51},
doi = {10.1109/FOCS.2006.51},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FeldmanGKP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GopalanKMP06,
author = {Parikshit Gopalan and
Phokion G. Kolaitis and
Elitza N. Maneva and
Christos H. Papadimitriou},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {The Connectivity of Boolean Satisfiability: Computational and Structural
Dichotomies},
booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
{ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {346--357},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_31},
doi = {10.1007/11786986\_31},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GopalanKMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/GopalanGL06,
author = {Parikshit Gopalan and
Venkatesan Guruswami and
Richard J. Lipton},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Algorithms for Modular Counting of Roots of Multivariate Polynomials},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {544--555},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_51},
doi = {10.1007/11682462\_51},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/GopalanGL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Gopalan06,
author = {Parikshit Gopalan},
title = {Query-efficient algorithms for polynomial interpolation over composites},
booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006},
pages = {908--917},
publisher = {{ACM} Press},
year = {2006},
url = {http://dl.acm.org/citation.cfm?id=1109557.1109657},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/Gopalan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609072,
author = {Parikshit Gopalan and
Phokion G. Kolaitis and
Elitza N. Maneva and
Christos H. Papadimitriou},
title = {The Connectivity of Boolean Satisfiability: Computational and Structural
Dichotomies},
journal = {CoRR},
volume = {abs/cs/0609072},
year = {2006},
url = {http://arxiv.org/abs/cs/0609072},
eprinttype = {arXiv},
eprint = {cs/0609072},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609072.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/FeldmanGKP06,
author = {Vitaly Feldman and
Parikshit Gopalan and
Subhash Khot and
Ashok Kumar Ponnuswami},
title = {New Results for Learning Noisy Parities and Halfspaces},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-059}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-059/index.html},
eprinttype = {ECCC},
eprint = {TR06-059},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FeldmanGKP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GopalanKMP06,
author = {Parikshit Gopalan and
Phokion G. Kolaitis and
Elitza N. Maneva and
Christos H. Papadimitriou},
title = {The Connectivity of Boolean Satisfiability: Computational and Structural
Dichotomies},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-094}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-094/index.html},
eprinttype = {ECCC},
eprint = {TR06-094},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GopalanKMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/GopalanKMMV05,
author = {Parikshit Gopalan and
Howard J. Karloff and
Aranyak Mehta and
Milena Mihail and
Nisheeth K. Vishnoi},
title = {Caching with Expiration Times for Internet Applications},
journal = {Internet Math.},
volume = {2},
number = {2},
pages = {165--184},
year = {2005},
url = {https://doi.org/10.1080/15427951.2005.10129102},
doi = {10.1080/15427951.2005.10129102},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/GopalanKMMV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-143,
author = {Parikshit Gopalan},
title = {Constructing Ramsey Graphs from Boolean Function Representations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-143}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-143/index.html},
eprinttype = {ECCC},
eprint = {TR05-143},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-143.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/BasuBGL04,
author = {Saugata Basu and
Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Polynomials That Sign Represent Parity and Descartes Rule of Signs},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {223--235},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313846},
doi = {10.1109/CCC.2004.1313846},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BasuBGL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-022,
author = {Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {The Degree of Threshold Mod 6 and Diophantine Equations},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-022}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-022/index.html},
eprinttype = {ECCC},
eprint = {TR04-022},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-022.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhatnagarGL03,
author = {Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Symmetric Polynomials over Z\({}_{\mbox{m}}\) and Simultaneous Communication
Protocol},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {450--459},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238218},
doi = {10.1109/SFCS.2003.1238218},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BhatnagarGL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GopalanLM03,
author = {Parikshit Gopalan and
Richard J. Lipton and
Aranyak Mehta},
editor = {Paritosh K. Pandya and
Jaikumar Radhakrishnan},
title = {Randomized Time-Space Tradeoffs for Directed Graph Connectivity},
booktitle = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
Computer Science, 23rd Conference, Mumbai, India, December 15-17,
2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2914},
pages = {208--216},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24597-1\_18},
doi = {10.1007/978-3-540-24597-1\_18},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GopalanLM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-047,
author = {Nayantara Bhatnagar and
Parikshit Gopalan and
Richard J. Lipton},
title = {Symmetric Polynomials over Z\({}_{\mbox{m}}\) and Simultaneous Communication
Protocols},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-047}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-047/index.html},
eprinttype = {ECCC},
eprint = {TR03-047},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-047.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanKMMV02,
author = {Parikshit Gopalan and
Howard J. Karloff and
Aranyak Mehta and
Milena Mihail and
Nisheeth K. Vishnoi},
editor = {David Eppstein},
title = {Caching with expiration times},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {540--547},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545454},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/GopalanKMMV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-03-03 00:11 CET 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:
