Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Aduri Pavan
@article{DBLP:journals/cacm/PavanVBM23,
author = {A. Pavan and
N. V. Vinodchandran and
Arnab Bhattacharyya and
Kuldeep S. Meel},
title = {Model Counting Meets Distinct Elements},
journal = {Commun. {ACM}},
volume = {66},
number = {9},
pages = {95--102},
year = {2023},
url = {https://doi.org/10.1145/3607824},
doi = {10.1145/3607824},
timestamp = {Fri, 20 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/PavanVBM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tods/PavanVBM23,
author = {A. Pavan and
N. Variyam Vinodchandran and
Arnab Bhattacharyya and
Kuldeep S. Meel},
title = {Model Counting Meets \emph{F}\({}_{\mbox{0}}\) Estimation},
journal = {{ACM} Trans. Database Syst.},
volume = {48},
number = {3},
pages = {7:1--7:28},
year = {2023},
url = {https://doi.org/10.1145/3603496},
doi = {10.1145/3603496},
timestamp = {Sat, 28 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tods/PavanVBM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/PavanMV023,
author = {Aduri Pavan and
Kuldeep S. Meel and
N. V. Vinodchandran and
Arnab Bhattacharyya},
editor = {Brian Williams and
Yiling Chen and
Jennifer Neville},
title = {Constraint Optimization over Semirings},
booktitle = {Thirty-Seventh {AAAI} Conference on Artificial Intelligence, {AAAI}
2023, Thirty-Fifth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2023, Thirteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2023, Washington, DC, USA, February
7-14, 2023},
pages = {4070--4077},
publisher = {{AAAI} Press},
year = {2023},
url = {https://doi.org/10.1609/aaai.v37i4.25522},
doi = {10.1609/AAAI.V37I4.25522},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aaai/PavanMV023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0001GMMPV23,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Kuldeep S. Meel and
Dimitrios Myrisiotis and
A. Pavan and
N. V. Vinodchandran},
title = {On Approximating Total Variation Distance},
booktitle = {Proceedings of the Thirty-Second International Joint Conference on
Artificial Intelligence, {IJCAI} 2023, 19th-25th August 2023, Macao,
SAR, China},
pages = {3479--3487},
publisher = {ijcai.org},
year = {2023},
url = {https://doi.org/10.24963/ijcai.2023/387},
doi = {10.24963/IJCAI.2023/387},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/0001GMMPV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/0002PWV23,
author = {Peter Dixon and
Aduri Pavan and
Jason Vander Woude and
N. V. Vinodchandran},
editor = {Alice Oh and
Tristan Naumann and
Amir Globerson and
Kate Saenko and
Moritz Hardt and
Sergey Levine},
title = {List and Certificate Complexities in Replicable Learning},
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/61d0a96d4a73b626367310b3ad32579d-Abstract-Conference.html},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/0002PWV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/NieZNBPQ23,
author = {Guanyu Nie and
Yanhui Zhu and
Yididiya Y. Nadew and
Samik Basu and
A. Pavan and
Christopher John Quinn},
editor = {Robin J. Evans and
Ilya Shpitser},
title = {Size-constrained k-submodular maximization in near-linear time},
booktitle = {Uncertainty in Artificial Intelligence, {UAI} 2023, July 31 - 4 August
2023, Pittsburgh, PA, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {216},
pages = {1545--1554},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v216/nie23a.html},
timestamp = {Tue, 29 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/uai/NieZNBPQ23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/PadmanabhanZ0P23,
author = {Madhavan R. Padmanabhan and
Yanhui Zhu and
Samik Basu and
Aduri Pavan},
editor = {Robin J. Evans and
Ilya Shpitser},
title = {Maximizing submodular functions under submodular constraints},
booktitle = {Uncertainty in Artificial Intelligence, {UAI} 2023, July 31 - 4 August
2023, Pittsburgh, PA, {USA}},
series = {Proceedings of Machine Learning Research},
volume = {216},
pages = {1618--1627},
publisher = {{PMLR}},
year = {2023},
url = {https://proceedings.mlr.press/v216/padmanabhan23a.html},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/uai/PadmanabhanZ0P23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/Chen0V23,
author = {Michael Chen and
A. Pavan and
N. V. Vinodchandran},
editor = {Rotem Oshman},
title = {Brief Announcement: Relations Between Space-Bounded and Adaptive Massively
Parallel Computations},
booktitle = {37th International Symposium on Distributed Computing, {DISC} 2023,
October 10-12, 2023, L'Aquila, Italy},
series = {LIPIcs},
volume = {281},
pages = {37:1--37:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.DISC.2023.37},
doi = {10.4230/LIPICS.DISC.2023.37},
timestamp = {Thu, 05 Oct 2023 15:45:05 +0200},
biburl = {https://dblp.org/rec/conf/wdag/Chen0V23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2302-12937,
author = {Aduri Pavan and
Kuldeep S. Meel and
N. V. Vinodchandran and
Arnab Bhattacharyya},
title = {Constraint Optimization over Semirings},
journal = {CoRR},
volume = {abs/2302.12937},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2302.12937},
doi = {10.48550/ARXIV.2302.12937},
eprinttype = {arXiv},
eprint = {2302.12937},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2302-12937.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-02240,
author = {Peter Dixon and
A. Pavan and
Jason Vander Woude and
N. V. Vinodchandran},
title = {List and Certificate Complexities in Replicable Learning},
journal = {CoRR},
volume = {abs/2304.02240},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.02240},
doi = {10.48550/ARXIV.2304.02240},
eprinttype = {arXiv},
eprint = {2304.02240},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-02240.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-04837,
author = {Jason Vander Woude and
Peter Dixon and
Aduri Pavan and
Jamie Radcliffe and
N. V. Vinodchandran},
title = {Geometry of Rounding: Near Optimal Bounds and a New Neighborhood Sperner's
Lemma},
journal = {CoRR},
volume = {abs/2304.04837},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2304.04837},
doi = {10.48550/ARXIV.2304.04837},
eprinttype = {arXiv},
eprint = {2304.04837},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2304-04837.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-09134,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Kuldeep S. Meel and
Dimitrios Myrisiotis and
A. Pavan and
N. V. Vinodchandran},
title = {Total Variation Distance Estimation Is as Easy as Probabilistic Inference},
journal = {CoRR},
volume = {abs/2309.09134},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.09134},
doi = {10.48550/ARXIV.2309.09134},
eprinttype = {arXiv},
eprint = {2309.09134},
timestamp = {Fri, 22 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-09134.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001GMM0V23,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Kuldeep S. Meel and
Dimitrios Myrisiotis and
A. Pavan and
N. V. Vinodchandran},
title = {Total Variation Distance Estimation Is as Easy as Probabilistic Inference},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-145}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/145},
eprinttype = {ECCC},
eprint = {TR23-145},
timestamp = {Wed, 10 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/0001GMM0V23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/PavanVBM22,
author = {Aduri Pavan and
N. V. Vinodchandran and
Arnab Bhattacharyya and
Kuldeep S. Meel},
title = {Model Counting Meets Distinct Elements in a Data Stream},
journal = {{SIGMOD} Rec.},
volume = {51},
number = {1},
pages = {87--94},
year = {2022},
url = {https://doi.org/10.1145/3542700.3542721},
doi = {10.1145/3542700.3542721},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmod/PavanVBM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/0002PWV22,
author = {Peter Dixon and
Aduri Pavan and
Jason Vander Woude and
N. V. Vinodchandran},
editor = {Stefano Leonardi and
Anupam Gupta},
title = {Pseudodeterminism: promises and lowerbounds},
booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Rome, Italy, June 20 - 24, 2022},
pages = {1552--1565},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3519935.3520043},
doi = {10.1145/3519935.3520043},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/0002PWV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-07209,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Kuldeep S. Meel and
Dimitrios Myrisiotis and
Aduri Pavan and
N. V. Vinodchandran},
title = {On Approximating Total Variation Distance},
journal = {CoRR},
volume = {abs/2206.07209},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.07209},
doi = {10.48550/ARXIV.2206.07209},
eprinttype = {arXiv},
eprint = {2206.07209},
timestamp = {Tue, 21 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-07209.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2211-02694,
author = {Jason Vander Woude and
Peter Dixon and
Aduri Pavan and
Jamie Radcliffe and
N. V. Vinodchandran},
title = {Geometry of Rounding},
journal = {CoRR},
volume = {abs/2211.02694},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2211.02694},
doi = {10.48550/ARXIV.2211.02694},
eprinttype = {arXiv},
eprint = {2211.02694},
timestamp = {Wed, 09 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2211-02694.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Woude00RV22,
author = {Jason Vander Woude and
Peter Dixon and
A. Pavan and
Jamie Radcliffe and
N. V. Vinodchandran},
title = {The Geometry of Rounding},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-160}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/160},
eprinttype = {ECCC},
eprint = {TR22-160},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/Woude00RV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/snam/FuPKBDP21,
author = {Xiaoyun Fu and
Madhavan R. Padmanabhan and
Raj Gaurav Kumar and
Samik Basu and
Shawn F. Dorius and
A. Pavan},
title = {Measuring the impact of influence on individuals: roadmap to quantifying
attitude},
journal = {Soc. Netw. Anal. Min.},
volume = {11},
number = {1},
pages = {61},
year = {2021},
url = {https://doi.org/10.1007/s13278-021-00763-x},
doi = {10.1007/S13278-021-00763-X},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/snam/FuPKBDP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/FuB0P21,
author = {Xiaoyun Fu and
Rishabh Rajendra Bhatt and
Samik Basu and
Aduri Pavan},
editor = {Yixin Chen and
Heiko Ludwig and
Yicheng Tu and
Usama M. Fayyad and
Xingquan Zhu and
Xiaohua Hu and
Suren Byna and
Xiong Liu and
Jianping Zhang and
Shirui Pan and
Vagelis Papalexakis and
Jianwu Wang and
Alfredo Cuzzocrea and
Carlos Ordonez},
title = {Multi-Objective Submodular Optimization with Approximate Oracles and
Influence Maximization},
booktitle = {2021 {IEEE} International Conference on Big Data (Big Data), Orlando,
FL, USA, December 15-18, 2021},
pages = {328--334},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/BigData52589.2021.9671756},
doi = {10.1109/BIGDATA52589.2021.9671756},
timestamp = {Fri, 13 Jan 2023 17:06:49 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/FuB0P21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/00020V21,
author = {Peter Dixon and
A. Pavan and
N. V. Vinodchandran},
editor = {James R. Lee},
title = {Complete Problems for Multi-Pseudodeterministic Computations},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {66:1--66:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.66},
doi = {10.4230/LIPICS.ITCS.2021.66},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/00020V21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/PavanVBM21,
author = {Aduri Pavan and
N. V. Vinodchandran and
Arnab Bhattacharyya and
Kuldeep S. Meel},
editor = {Leonid Libkin and
Reinhard Pichler and
Paolo Guagliardo},
title = {Model Counting meets F\({}_{\mbox{0}}\) Estimation},
booktitle = {PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium
on Principles of Database Systems, Virtual Event, China, June 20-25,
2021},
pages = {299--311},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452021.3458311},
doi = {10.1145/3452021.3458311},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/PavanVBM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2103-08589,
author = {Peter Dixon and
Aduri Pavan and
N. V. Vinodchandran},
title = {Promise Problems Meet Pseudodeterminism},
journal = {CoRR},
volume = {abs/2103.08589},
year = {2021},
url = {https://arxiv.org/abs/2103.08589},
eprinttype = {arXiv},
eprint = {2103.08589},
timestamp = {Tue, 23 Mar 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2103-08589.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-00639,
author = {Aduri Pavan and
N. V. Vinodchandran and
Arnab Bhattacharyya and
Kuldeep S. Meel},
title = {Model Counting meets {F0} Estimation},
journal = {CoRR},
volume = {abs/2105.00639},
year = {2021},
url = {https://arxiv.org/abs/2105.00639},
eprinttype = {arXiv},
eprint = {2105.00639},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-00639.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DixonPV21,
author = {Peter Dixon and
Aduri Pavan and
N. V. Vinodchandran},
title = {Promise Problems Meet Pseudodeterminism},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-043}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/043},
eprinttype = {ECCC},
eprint = {TR21-043},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DixonPV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asunam/FuPK0DP20,
author = {Xiaoyun Fu and
Madhavan R. Padmanabhan and
Raj Gaurav Kumar and
Samik Basu and
Shawn F. Dorius and
Aduri Pavan},
editor = {Martin Atzm{\"{u}}ller and
Michele Coscia and
Rokia Missaoui},
title = {Measuring the Impact of Influence on Individuals: Roadmap to Quantifying
Attitude},
booktitle = {{IEEE/ACM} International Conference on Advances in Social Networks
Analysis and Mining, {ASONAM} 2020, The Hague, Netherlands, December
7-10, 2020},
pages = {227--231},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/ASONAM49781.2020.9381300},
doi = {10.1109/ASONAM49781.2020.9381300},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/asunam/FuPK0DP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tcc/0002GPV20,
author = {Peter Dixon and
Sutanu Gayen and
Aduri Pavan and
N. V. Vinodchandran},
editor = {Rafael Pass and
Krzysztof Pietrzak},
title = {Perfect Zero Knowledge: New Upperbounds and Relativized Separations},
booktitle = {Theory of Cryptography - 18th International Conference, {TCC} 2020,
Durham, NC, USA, November 16-19, 2020, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {12550},
pages = {684--704},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-64375-1\_24},
doi = {10.1007/978-3-030-64375-1\_24},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tcc/0002GPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/webi/KumarB0P20,
author = {Raj Gaurav Kumar and
Preeti Bhardwaj and
Samik Basu and
Aduri Pavan},
editor = {Jing He and
Hemant Purohit and
Guangyan Huang and
Xiaoying Gao and
Ke Deng},
title = {Disrupting Diffusion: Critical Nodes in Network},
booktitle = {{IEEE/WIC/ACM} International Joint Conference on Web Intelligence
and Intelligent Agent Technology, {WI/IAT} 2020, Melbourne, Australia,
December 14-17, 2020},
pages = {397--404},
publisher = {{IEEE}},
year = {2020},
url = {https://doi.org/10.1109/WIIAT50758.2020.00058},
doi = {10.1109/WIIAT50758.2020.00058},
timestamp = {Mon, 28 Jun 2021 11:58:10 +0200},
biburl = {https://dblp.org/rec/conf/webi/KumarB0P20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-13304,
author = {Xiaoyun Fu and
Madhavan Rajagopal Padmanabhan and
Raj Gaurav Kumar and
Samik Basu and
Shawn F. Dorius and
Aduri Pavan},
title = {Measuring the Impact of Influence on Individuals: Roadmap to Quantifying
Attitude},
journal = {CoRR},
volume = {abs/2010.13304},
year = {2020},
url = {https://arxiv.org/abs/2010.13304},
eprinttype = {arXiv},
eprint = {2010.13304},
timestamp = {Tue, 23 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-13304.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/DixonGPV20,
author = {Peter Dixon and
Sutanu Gayen and
A. Pavan and
N. V. Vinodchandran},
title = {Perfect Zero Knowledge: New Upperbounds and Relativized Separations},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {768},
year = {2020},
url = {https://eprint.iacr.org/2020/768},
timestamp = {Tue, 30 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/DixonGPV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AshidaINPVW19,
author = {Ryo Ashida and
Tatsuya Imai and
Kotaro Nakagawa and
A. Pavan and
N. V. Vinodchandran and
Osamu Watanabe},
title = {A Sublinear-space and Polynomial-time Separator Algorithm for Planar
Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-091}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/091},
eprinttype = {ECCC},
eprint = {TR19-091},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AshidaINPVW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asunam/Kavassery-Parakkat18,
author = {Neeraj Kavassery{-}Parakkat and
Kiana Mousavi Hanjani and
A. Pavan},
editor = {Ulrik Brandes and
Chandan Reddy and
Andrea Tagarelli},
title = {Improved Triangle Counting in Graph Streams: Power of Multi-Sampling},
booktitle = {{IEEE/ACM} 2018 International Conference on Advances in Social Networks
Analysis and Mining, {ASONAM} 2018, Barcelona, Spain, August 28-31,
2018},
pages = {33--40},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/ASONAM.2018.8508789},
doi = {10.1109/ASONAM.2018.8508789},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/asunam/Kavassery-Parakkat18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/PadmanabhanSBP18,
author = {Madhavan R. Padmanabhan and
Naresh Somisetty and
Samik Basu and
A. Pavan},
editor = {Naoki Abe and
Huan Liu and
Calton Pu and
Xiaohua Hu and
Nesreen K. Ahmed and
Mu Qiao and
Yang Song and
Donald Kossmann and
Bing Liu and
Kisung Lee and
Jiliang Tang and
Jingrui He and
Jeffrey S. Saltz},
title = {Influence Maximization in Social Networks With Non-Target Constraints},
booktitle = {{IEEE} International Conference on Big Data {(IEEE} BigData 2018),
Seattle, WA, USA, December 10-13, 2018},
pages = {771--780},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/BigData.2018.8621973},
doi = {10.1109/BIGDATA.2018.8621973},
timestamp = {Fri, 19 Nov 2021 16:08:20 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/PadmanabhanSBP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DixonPV18,
author = {Peter Dixon and
Aduri Pavan and
N. V. Vinodchandran},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {On Pseudodeterministic Approximation Algorithms},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {61:1--61:11},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.61},
doi = {10.4230/LIPICS.MFCS.2018.61},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/DixonPV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/McGregorPTW16,
author = {Andrew McGregor and
A. Pavan and
Srikanta Tirthapura and
David P. Woodruff},
title = {Space-Efficient Estimation of Statistics Over Sub-Sampled Streams},
journal = {Algorithmica},
volume = {74},
number = {2},
pages = {787--811},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-9974-0},
doi = {10.1007/S00453-015-9974-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/McGregorPTW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HughesMPRS16,
author = {Andrew Hughes and
Debasis Mandal and
Aduri Pavan and
Nathan Russell and
Alan L. Selman},
title = {A thirty Year old conjecture about promise problems},
journal = {Comput. Complex.},
volume = {25},
number = {4},
pages = {883--919},
year = {2016},
url = {https://doi.org/10.1007/s00037-015-0107-6},
doi = {10.1007/S00037-015-0107-6},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HughesMPRS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bigdataconf/PavanQSVS16,
author = {Aduri Pavan and
Paul Quint and
Stephen D. Scott and
N. V. Vinodchandran and
J. Smith},
editor = {James Joshi and
George Karypis and
Ling Liu and
Xiaohua Hu and
Ronay Ak and
Yinglong Xia and
Weijia Xu and
Aki{-}Hiro Sato and
Sudarsan Rachuri and
Lyle H. Ungar and
Philip S. Yu and
Rama Govindaraju and
Toyotaro Suzumura},
title = {Computing triangle and open-wedge heavy-hitters in large networks},
booktitle = {2016 {IEEE} International Conference on Big Data {(IEEE} BigData 2016),
Washington DC, USA, December 5-8, 2016},
pages = {998--1005},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/BigData.2016.7840699},
doi = {10.1109/BIGDATA.2016.7840699},
timestamp = {Fri, 19 Nov 2021 16:08:20 +0100},
biburl = {https://dblp.org/rec/conf/bigdataconf/PavanQSVS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DixonMPV16,
author = {Peter Dixon and
Debasis Mandal and
Aduri Pavan and
N. V. Vinodchandran},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {A Note on the Advice Complexity of Multipass Randomized Logspace},
booktitle = {41st International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland},
series = {LIPIcs},
volume = {58},
pages = {31:1--31:7},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.31},
doi = {10.4230/LIPICS.MFCS.2016.31},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/DixonMPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigsoft/CohenPV16,
author = {Myra B. Cohen and
Aduri Pavan and
N. V. Vinodchandran},
editor = {Thomas Zimmermann and
Jane Cleland{-}Huang and
Zhendong Su},
title = {Budgeted testing through an algorithmic lens},
booktitle = {Proceedings of the 24th {ACM} {SIGSOFT} International Symposium on
Foundations of Software Engineering, {FSE} 2016, Seattle, WA, USA,
November 13-18, 2016},
pages = {948--951},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2950290.2983987},
doi = {10.1145/2950290.2983987},
timestamp = {Thu, 02 Dec 2021 11:46:17 +0100},
biburl = {https://dblp.org/rec/conf/sigsoft/CohenPV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HitchcockP15,
author = {John M. Hitchcock and
Aduri Pavan},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {On the NP-Completeness of the Minimum Circuit Size Problem},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {236--245},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.236},
doi = {10.4230/LIPICS.FSTTCS.2015.236},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/HitchcockP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MandalPV15,
author = {Debasis Mandal and
Aduri Pavan and
N. V. Vinodchandran},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {On Probabilistic Space-Bounded Machines with Multiple Access to Random
Tape},
booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {9235},
pages = {459--471},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_38},
doi = {10.1007/978-3-662-48054-0\_38},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MandalPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/HarkinsHP14,
author = {Ryan C. Harkins and
John M. Hitchcock and
Aduri Pavan},
title = {Strong Reductions and Isomorphism of Complete Sets},
journal = {Comput.},
volume = {3},
number = {2},
pages = {91--104},
year = {2014},
url = {https://doi.org/10.3233/COM-140028},
doi = {10.3233/COM-140028},
timestamp = {Thu, 24 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/computability/HarkinsHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GlasserHPT14,
author = {Christian Gla{\ss}er and
John M. Hitchcock and
Aduri Pavan and
Stephen D. Travers},
title = {Unions of Disjoint NP-Complete Sets},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {1},
pages = {3:1--3:10},
year = {2014},
url = {https://doi.org/10.1145/2591508},
doi = {10.1145/2591508},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GlasserHPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MandalPV14,
author = {Debasis Mandal and
Aduri Pavan and
Rajeswari Venugopalan},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Separating Cook Completeness from Karp-Levin Completeness Under a
Worst-Case Hardness Hypothesis},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {445--456},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.445},
doi = {10.4230/LIPICS.FSTTCS.2014.445},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/MandalPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChakrabortyPTVY14,
author = {Diptarka Chakraborty and
Aduri Pavan and
Raghunath Tewari and
N. V. Vinodchandran and
Lin F. Yang},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {New Time-Space Upperbounds for Directed Reachability in High-genus
and H-minor-free Graphs},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {585--595},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.585},
doi = {10.4230/LIPICS.FSTTCS.2014.585},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChakrabortyPTVY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChakrabortyPTVY14,
author = {Diptarka Chakraborty and
Aduri Pavan and
Raghunath Tewari and
N. Variyam Vinodchandran and
Lin F. Yang},
title = {New Time-Space Upperbounds for Directed Reachability in High-genus
and H-minor-free Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-035}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/035},
eprinttype = {ECCC},
eprint = {TR14-035},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChakrabortyPTVY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MandalPV14,
author = {Debasis Mandal and
Aduri Pavan and
Rajeswari Venugopalan},
title = {Separating Cook Completeness from Karp-Levin Completeness under a
Worst-Case Hardness Hypothesis},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-126}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/126},
eprinttype = {ECCC},
eprint = {TR14-126},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MandalPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/pvldb/PavanTTW13,
author = {A. Pavan and
Kanat Tangwongsan and
Srikanta Tirthapura and
Kun{-}Lung Wu},
title = {Counting and Sampling Triangles from a Graph Stream},
journal = {Proc. {VLDB} Endow.},
volume = {6},
number = {14},
pages = {1870--1881},
year = {2013},
url = {http://www.vldb.org/pvldb/vol6/p1870-aduri.pdf},
doi = {10.14778/2556549.2556569},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/pvldb/PavanTTW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cikm/TangwongsanPT13,
author = {Kanat Tangwongsan and
A. Pavan and
Srikanta Tirthapura},
editor = {Qi He and
Arun Iyengar and
Wolfgang Nejdl and
Jian Pei and
Rajeev Rastogi},
title = {Parallel triangle counting in massive streaming graphs},
booktitle = {22nd {ACM} International Conference on Information and Knowledge Management,
CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013},
pages = {781--786},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2505515.2505741},
doi = {10.1145/2505515.2505741},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cikm/TangwongsanPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ImaiNPVW13,
author = {Tatsuya Imai and
Kotaro Nakagawa and
Aduri Pavan and
N. V. Vinodchandran and
Osamu Watanabe},
title = {An O(n{\textonehalf}+{\(\sum\)})-Space and Polynomial-Time Algorithm
for Directed Planar Reachability},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {277--286},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.35},
doi = {10.1109/CCC.2013.35},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/ImaiNPVW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HitchcockP13,
author = {John M. Hitchcock and
Aduri Pavan},
editor = {Krishnendu Chatterjee and
Jir{\'{\i}} Sgall},
title = {Length-Increasing Reductions for PSPACE-Completeness},
booktitle = {Mathematical Foundations of Computer Science 2013 - 38th International
Symposium, {MFCS} 2013, Klosterneuburg, Austria, August 26-30, 2013.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8087},
pages = {540--550},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40313-2\_48},
doi = {10.1007/978-3-642-40313-2\_48},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HitchcockP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/TangwongsanPT13,
author = {Kanat Tangwongsan and
A. Pavan and
Srikanta Tirthapura},
title = {Parallel Triangle Counting in Massive Streaming Graphs},
journal = {CoRR},
volume = {abs/1308.2166},
year = {2013},
url = {http://arxiv.org/abs/1308.2166},
eprinttype = {arXiv},
eprint = {1308.2166},
timestamp = {Wed, 27 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/TangwongsanPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PavanTV12,
author = {Aduri Pavan and
Raghunath Tewari and
N. V. Vinodchandran},
title = {On the power of unambiguity in log-space},
journal = {Comput. Complex.},
volume = {21},
number = {4},
pages = {643--670},
year = {2012},
url = {https://doi.org/10.1007/s00037-012-0047-3},
doi = {10.1007/S00037-012-0047-3},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PavanTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GuHP12,
author = {Xiaoyang Gu and
John M. Hitchcock and
Aduri Pavan},
title = {Collapsing and Separating Completeness Notions Under Average-Case
and Worst-Case Hypotheses},
journal = {Theory Comput. Syst.},
volume = {51},
number = {2},
pages = {248--265},
year = {2012},
url = {https://doi.org/10.1007/s00224-011-9365-0},
doi = {10.1007/S00224-011-9365-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GuHP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HughesPRS12,
author = {Andrew Hughes and
Aduri Pavan and
Nathan Russell and
Alan L. Selman},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {A Thirty Year Old Conjecture about Promise Problems},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7391},
pages = {473--484},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31594-7\_40},
doi = {10.1007/978-3-642-31594-7\_40},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HughesPRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/McGregorPTW12,
author = {Andrew McGregor and
A. Pavan and
Srikanta Tirthapura and
David P. Woodruff},
editor = {Michael Benedikt and
Markus Kr{\"{o}}tzsch and
Maurizio Lenzerini},
title = {Space-efficient estimation of statistics over sub-sampled streams},
booktitle = {Proceedings of the 31st {ACM} {SIGMOD-SIGACT-SIGART} Symposium on
Principles of Database Systems, {PODS} 2012, Scottsdale, AZ, USA,
May 20-24, 2012},
pages = {273--282},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213556.2213594},
doi = {10.1145/2213556.2213594},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/McGregorPTW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GlasserPT11,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Stephen D. Travers},
title = {The fault tolerance of NP-hard problems},
journal = {Inf. Comput.},
volume = {209},
number = {3},
pages = {443--455},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.11.012},
doi = {10.1016/J.IC.2010.11.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GlasserPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FortnowHPVW11,
author = {Lance Fortnow and
John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran and
Fengming Wang},
title = {Extracting Kolmogorov complexity with applications to dimension zero-one
laws},
journal = {Inf. Comput.},
volume = {209},
number = {4},
pages = {627--636},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.09.006},
doi = {10.1016/J.IC.2010.09.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/FortnowHPVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/HitchcockPV11,
author = {John M. Hitchcock and
Aduri Pavan and
N. Variyam Vinodchandran},
title = {Kolmogorov Complexity in Randomness Extraction},
journal = {{ACM} Trans. Comput. Theory},
volume = {3},
number = {1},
pages = {1:1--1:12},
year = {2011},
url = {https://doi.org/10.1145/2003685.2003686},
doi = {10.1145/2003685.2003686},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/HitchcockPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GlasserHPT11,
author = {Christian Gla{\ss}er and
John M. Hitchcock and
Aduri Pavan and
Stephen D. Travers},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {Unions of Disjoint NP-Complete Sets},
booktitle = {Computing and Combinatorics - 17th Annual International Conference,
{COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {240--251},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_22},
doi = {10.1007/978-3-642-22685-4\_22},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GlasserHPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GuHP10,
author = {Xiaoyang Gu and
John M. Hitchcock and
Aduri Pavan},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {Collapsing and Separating Completeness Notions under Average-Case
and Worst-Case Hypotheses},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {429--440},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2462},
doi = {10.4230/LIPICS.STACS.2010.2462},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/GuHP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-0117,
author = {Xiaoyang Gu and
John M. Hitchcock and
Aduri Pavan},
title = {Collapsing and Separating Completeness Notions under Average-Case
and Worst-Case Hypotheses},
journal = {CoRR},
volume = {abs/1001.0117},
year = {2010},
url = {http://arxiv.org/abs/1001.0117},
eprinttype = {arXiv},
eprint = {1001.0117},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-0117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1001-2034,
author = {Aduri Pavan and
Raghunath Tewari and
N. V. Vinodchandran},
title = {On the Power of Unambiguity in Logspace},
journal = {CoRR},
volume = {abs/1001.2034},
year = {2010},
url = {http://arxiv.org/abs/1001.2034},
eprinttype = {arXiv},
eprint = {1001.2034},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1001-2034.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PavanTV10,
author = {Aduri Pavan and
Raghunath Tewari and
N. V. Vinodchandran},
title = {On the Power of Unambiguity in Logspace},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-009}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/009},
eprinttype = {ECCC},
eprint = {TR10-009},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/PavanTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HitchcockPV09,
author = {John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran},
editor = {Ravi Kannan and
K. Narayan Kumar},
title = {Kolmogorov Complexity in Randomness Extraction},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
{IIT} Kanpur, India},
series = {LIPIcs},
volume = {4},
pages = {215--226},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2320},
doi = {10.4230/LIPICS.FSTTCS.2009.2320},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/HitchcockPV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/GlasserPT09,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Stephen D. Travers},
editor = {Adrian{-}Horia Dediu and
Armand{-}Mihai Ionescu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {The Fault Tolerance of NP-Hard Problems},
booktitle = {Language and Automata Theory and Applications, Third International
Conference, {LATA} 2009, Tarragona, Spain, April 2-8, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5457},
pages = {374--385},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00982-2\_32},
doi = {10.1007/978-3-642-00982-2\_32},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/lata/GlasserPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HitchcockPV09,
author = {John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran},
title = {Kolmogorov Complexity in Randomness Extraction},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-071}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/071},
eprinttype = {ECCC},
eprint = {TR09-071},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HitchcockPV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HitchcockP08,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Hardness Hypotheses, Derandomization, and Circuit Complexity},
journal = {Comput. Complex.},
volume = {17},
number = {1},
pages = {119--146},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0241-5},
doi = {10.1007/S00037-008-0241-5},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HitchcockP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PavanV08,
author = {Aduri Pavan and
N. V. Vinodchandran},
title = {2-Local Random Reductions to 3-Valued Functions},
journal = {Comput. Complex.},
volume = {17},
number = {4},
pages = {501--514},
year = {2008},
url = {https://doi.org/10.1007/s00037-008-0245-1},
doi = {10.1007/S00037-008-0245-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/PavanV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FortnowPS08,
author = {Lance Fortnow and
Aduri Pavan and
Samik Sengupta},
title = {Proving {SAT} does not have small circuits with an application to
the two queries problem},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {3},
pages = {358--363},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.06.017},
doi = {10.1016/J.JCSS.2007.06.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FortnowPS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HitchcockPV08,
author = {John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran},
title = {Partial Bi-immunity, Scaled Dimension, and NP-Completeness},
journal = {Theory Comput. Syst.},
volume = {42},
number = {2},
pages = {131--142},
year = {2008},
url = {https://doi.org/10.1007/s00224-007-9000-2},
doi = {10.1007/S00224-007-9000-2},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HitchcockPV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/PavanV08,
author = {Aduri Pavan and
N. V. Vinodchandran},
title = {Relations between Average-Case and Worst-Case Complexity},
journal = {Theory Comput. Syst.},
volume = {42},
number = {4},
pages = {596--607},
year = {2008},
url = {https://doi.org/10.1007/s00224-007-9071-0},
doi = {10.1007/S00224-007-9071-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/PavanV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GlasserPSZ08,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
title = {Splitting NP-Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {5},
pages = {1517--1535},
year = {2008},
url = {https://doi.org/10.1137/060673886},
doi = {10.1137/060673886},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GlasserPSZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HitchcockP07,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Comparing reductions to NP-complete sets},
journal = {Inf. Comput.},
volume = {205},
number = {5},
pages = {694--706},
year = {2007},
url = {https://doi.org/10.1016/j.ic.2006.10.005},
doi = {10.1016/J.IC.2006.10.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HitchcockP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/PavanW07,
author = {Aduri Pavan and
Fengming Wang},
title = {Robustness of PSPACE-complete sets},
journal = {Inf. Process. Lett.},
volume = {103},
number = {3},
pages = {102--104},
year = {2007},
url = {https://doi.org/10.1016/j.ipl.2007.02.018},
doi = {10.1016/J.IPL.2007.02.018},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/PavanW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GlasserOPSZ07,
author = {Christian Gla{\ss}er and
Mitsunori Ogihara and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
title = {Autoreducibility, mitoticity, and immunity},
journal = {J. Comput. Syst. Sci.},
volume = {73},
number = {5},
pages = {735--754},
year = {2007},
url = {https://doi.org/10.1016/j.jcss.2006.10.020},
doi = {10.1016/J.JCSS.2006.10.020},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GlasserOPSZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PavanT07,
author = {A. Pavan and
Srikanta Tirthapura},
title = {Range-Efficient Counting of Distinct Elements in a Massive Data Stream},
journal = {{SIAM} J. Comput.},
volume = {37},
number = {2},
pages = {359--379},
year = {2007},
url = {https://doi.org/10.1137/050643672},
doi = {10.1137/050643672},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/PavanT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PavanSSV07,
author = {Aduri Pavan and
Alan L. Selman and
Samik Sengupta and
N. V. Vinodchandran},
title = {Polylogarithmic-round interactive proofs for coNP collapse the exponential
hierarchy},
journal = {Theor. Comput. Sci.},
volume = {385},
number = {1-3},
pages = {167--178},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.06.013},
doi = {10.1016/J.TCS.2007.06.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PavanSSV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HarkinsHP07,
author = {Ryan C. Harkins and
John M. Hitchcock and
Aduri Pavan},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {Strong Reductions and Isomorphism of Complete Sets},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {168--178},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_14},
doi = {10.1007/978-3-540-77050-3\_14},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HarkinsHP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GlasserPSS06,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
journal = {{SIAM} J. Comput.},
volume = {36},
number = {2},
pages = {516--542},
year = {2006},
url = {https://doi.org/10.1137/S009753970444421X},
doi = {10.1137/S009753970444421X},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GlasserPSS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/PavanSV06,
author = {Aduri Pavan and
Rahul Santhanam and
N. V. Vinodchandran},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {Some Results on Average-Case Hardness Within the Polynomial Hierarchy},
booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical
Computer Science, 26th International Conference, Kolkata, India, December
13-15, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4337},
pages = {188--199},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_19},
doi = {10.1007/11944836\_19},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/PavanSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FortnowHPVW06,
author = {Lance Fortnow and
John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran and
Fengming Wang},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Extracting Kolmogorov Complexity with Applications to Dimension Zero-One
Laws},
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 = {335--345},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_30},
doi = {10.1007/11786986\_30},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/FortnowHPVW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HitchcockP06,
author = {John M. Hitchcock and
Aduri Pavan},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Comparing Reductions to NP-Complete Sets},
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 = {465--476},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_41},
doi = {10.1007/11786986\_41},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HitchcockP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GlasserPSZ06,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Redundancy in Complete Sets},
booktitle = {{STACS} 2006, 23rd Annual Symposium on Theoretical Aspects of Computer
Science, Marseille, France, February 23-25, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3884},
pages = {444--454},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_36},
doi = {10.1007/11672142\_36},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GlasserPSZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GlasserPSZ06,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Angsheng Li},
title = {Mitosis in Computational Complexity},
booktitle = {Theory and Applications of Models of Computation, Third International
Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3959},
pages = {61--67},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11750321\_4},
doi = {10.1007/11750321\_4},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GlasserPSZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HitchcockP06,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Comparing Reductions to NP-Complete Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-039}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-039/index.html},
eprinttype = {ECCC},
eprint = {TR06-039},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HitchcockP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HitchcockP06a,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Hardness Hypotheses, Derandomization, and Circuit Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-071}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-071/index.html},
eprinttype = {ECCC},
eprint = {TR06-071},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HitchcockP06a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HitchcockP05,
author = {John M. Hitchcock and
Aduri Pavan},
title = {Resource-bounded strong dimension versus resource-bounded category},
journal = {Inf. Process. Lett.},
volume = {95},
number = {3},
pages = {377--381},
year = {2005},
url = {https://doi.org/10.1016/j.ipl.2005.05.001},
doi = {10.1016/J.IPL.2005.05.001},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HitchcockP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanFP05,
author = {Harry Buhrman and
Lance Fortnow and
Aduri Pavan},
title = {Some Results on Derandomization},
journal = {Theory Comput. Syst.},
volume = {38},
number = {2},
pages = {211--227},
year = {2005},
url = {https://doi.org/10.1007/s00224-004-1194-y},
doi = {10.1007/S00224-004-1194-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BuhrmanFP05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/PavanV05,
author = {Aduri Pavan and
N. V. Vinodchandran},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Relations Between Average-Case and Worst-Case Complexity},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {422--432},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_37},
doi = {10.1007/11537311\_37},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/PavanV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icde/TirthapuraA05,
author = {Aduri Pavan and
Srikanta Tirthapura},
editor = {Karl Aberer and
Michael J. Franklin and
Shojiro Nishio},
title = {Range Efficient Computation of F\({}_{\mbox{0}}\) over Massive Data
Streams},
booktitle = {Proceedings of the 21st International Conference on Data Engineering,
{ICDE} 2005, 5-8 April 2005, Tokyo, Japan},
pages = {32--43},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/ICDE.2005.118},
doi = {10.1109/ICDE.2005.118},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icde/TirthapuraA05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GlasserOPSZ05,
author = {Christian Gla{\ss}er and
Mitsunori Ogihara and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
editor = {Joanna Jedrzejowicz and
Andrzej Szepietowski},
title = {Autoreducibility, Mitoticity, and Immunity},
booktitle = {Mathematical Foundations of Computer Science 2005, 30th International
Symposium, {MFCS} 2005, Gdansk, Poland, August 29 - September 2, 2005,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3618},
pages = {387--398},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11549345\_34},
doi = {10.1007/11549345\_34},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GlasserOPSZ05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-011,
author = {Christian Gla{\ss}er and
Mitsunori Ogihara and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
title = {Autoreducibility, Mitoticity, and Immunity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-011}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-011/index.html},
eprinttype = {ECCC},
eprint = {TR05-011},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-011.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-062,
author = {Aduri Pavan and
N. V. Vinodchandran},
title = {2-Local Random Reductions to 3-Valued Functions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-062}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-062/index.html},
eprinttype = {ECCC},
eprint = {TR05-062},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-062.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-068,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Liyu Zhang},
title = {Redundancy in Complete Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-068}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-068/index.html},
eprinttype = {ECCC},
eprint = {TR05-068},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-068.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-105,
author = {Lance Fortnow and
John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran and
Fengming Wang},
title = {Extracting Kolmogorov Complexity with Applications to Dimension Zero-One
Laws},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-105}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-105/index.html},
eprinttype = {ECCC},
eprint = {TR05-105},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-105.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/PavanS04,
author = {Aduri Pavan and
Alan L. Selman},
title = {Bi-immunity separates strong NP-completeness notions},
journal = {Inf. Comput.},
volume = {188},
number = {1},
pages = {116--126},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2003.05.001},
doi = {10.1016/J.IC.2003.05.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/PavanS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/CaiCPS04,
author = {Jin{-}yi Cai and
Denis Charles and
Aduri Pavan and
Samik Sengupta},
title = {On Higher Arthur-Merlin Classes},
journal = {Int. J. Found. Comput. Sci.},
volume = {15},
number = {1},
pages = {3--19},
year = {2004},
url = {https://doi.org/10.1142/S0129054104002273},
doi = {10.1142/S0129054104002273},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/CaiCPS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GlasserPSS04,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {184--197},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313839},
doi = {10.1109/CCC.2004.1313839},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/GlasserPSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HitchcockPV04,
author = {John M. Hitchcock and
Aduri Pavan and
N. V. Vinodchandran},
title = {Partial Bi-immunity and NP-Completeness},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {198--203},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313842},
doi = {10.1109/CCC.2004.1313842},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HitchcockPV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HitchcockP04,
author = {John M. Hitchcock and
Aduri Pavan},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Hardness Hypotheses, Derandomization, and Circuit Complexity},
booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
Computer Science, 24th International Conference, Chennai, India, December
16-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3328},
pages = {336--347},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30538-5\_28},
doi = {10.1007/978-3-540-30538-5\_28},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HitchcockP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-019,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Alan L. Selman and
Samik Sengupta},
title = {Properties of NP-Complete Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-019}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-019/index.html},
eprinttype = {ECCC},
eprint = {TR04-019},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-025,
author = {John M. Hitchcock and
Aduri Pavan and
Pramodchandran N. Variyam},
title = {Partial Bi-Immunity and NP-Completeness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-025}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-025/index.html},
eprinttype = {ECCC},
eprint = {TR04-025},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-025.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-053,
author = {Aduri Pavan and
N. V. Vinodchandran},
title = {Polylogarithmic Round Arthur-Merlin Games and Random-Self-Reducibility},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-053}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-053/index.html},
eprinttype = {ECCC},
eprint = {TR04-053},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-053.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/FortnowPS03,
author = {Lance Fortnow and
Aduri Pavan and
Samik Sengupta},
title = {Proving {SAT} does not have Small Circuits with an Application to
the Two},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {347},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214433},
doi = {10.1109/CCC.2003.1214433},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FortnowPS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanFP03,
author = {Harry Buhrman and
Lance Fortnow and
Aduri Pavan},
editor = {Helmut Alt and
Michel Habib},
title = {Some Results on Derandomization},
booktitle = {{STACS} 2003, 20th Annual Symposium on Theoretical Aspects of Computer
Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2607},
pages = {212--222},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-36494-3\_20},
doi = {10.1007/3-540-36494-3\_20},
timestamp = {Thu, 14 Oct 2021 10:38:16 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanFP03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CaiCPS02,
author = {Jin{-}yi Cai and
Denis Charles and
Aduri Pavan and
Samik Sengupta},
editor = {Oscar H. Ibarra and
Louxin Zhang},
title = {On Higher Arthur-Merlin Classes},
booktitle = {Computing and Combinatorics, 8th Annual International Conference,
{COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2387},
pages = {18--27},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45655-4\_4},
doi = {10.1007/3-540-45655-4\_4},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/CaiCPS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/PavanS02,
author = {Aduri Pavan and
Alan L. Selman},
editor = {Helmut Alt and
Afonso Ferreira},
title = {Bi-Immunity Separates Strong NP-Completeness Notions},
booktitle = {{STACS} 2002, 19th Annual Symposium on Theoretical Aspects of Computer
Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2285},
pages = {408--418},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45841-7\_33},
doi = {10.1007/3-540-45841-7\_33},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/PavanS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-005,
author = {Aduri Pavan and
Alan L. Selman},
title = {Bi-Immunity Separates Strong NP-Completeness Notions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-005}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-005/index.html},
eprinttype = {ECCC},
eprint = {TR02-005},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-005.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FortnowPS01,
author = {Lance Fortnow and
Aduri Pavan and
Alan L. Selman},
title = {Distributionally Hard Languages},
journal = {Theory Comput. Syst.},
volume = {34},
number = {3},
pages = {245--261},
year = {2001},
url = {https://doi.org/10.1007/s00224-001-0003-0},
doi = {10.1007/S00224-001-0003-0},
timestamp = {Fri, 02 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FortnowPS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/PavanS01,
author = {Aduri Pavan and
Alan L. Selman},
title = {Separation of NP-Completeness Notions},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {3},
pages = {906--918},
year = {2001},
url = {https://doi.org/10.1137/S0097539701387039},
doi = {10.1137/S0097539701387039},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/PavanS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PavanS01,
author = {Aduri Pavan and
Alan L. Selman},
title = {Separation of NP-Completeness Notions},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {78--89},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933875},
doi = {10.1109/CCC.2001.933875},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PavanS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-032,
author = {Aduri Pavan and
Alan L. Selman},
title = {Separation of NP-completeness Notions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-032}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-032/index.html},
eprinttype = {ECCC},
eprint = {TR01-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/PavanS00,
author = {Aduri Pavan and
Alan L. Selman},
title = {Complete distributional problems, hard languages, and resource-bounded
measure},
journal = {Theor. Comput. Sci.},
volume = {234},
number = {1-2},
pages = {273--286},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00295-9},
doi = {10.1016/S0304-3975(99)00295-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/PavanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelangerPW99,
author = {Jay Belanger and
Aduri Pavan and
Jie Wang},
title = {Reductions Do Not Preserve Fast Convergence Rates in Average Time},
journal = {Algorithmica},
volume = {23},
number = {4},
pages = {363--373},
year = {1999},
url = {https://doi.org/10.1007/PL00009267},
doi = {10.1007/PL00009267},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelangerPW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/FortnowPS99,
author = {Lance Fortnow and
Aduri Pavan and
Alan L. Selman},
editor = {Takao Asano and
Hiroshi Imai and
D. T. Lee and
Shin{-}Ichi Nakano and
Takeshi Tokuyama},
title = {Distributionally-Hard Languages},
booktitle = {Computing and Combinatorics, 5th Annual International Conference,
{COCOON} '99, Tokyo, Japan, July 26-28, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1627},
pages = {184--193},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48686-0\_18},
doi = {10.1007/3-540-48686-0\_18},
timestamp = {Sat, 30 Sep 2023 09:37:25 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/FortnowPS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CaiPS99,
author = {Jin{-}yi Cai and
Aduri Pavan and
D. Sivakumar},
editor = {Christoph Meinel and
Sophie Tison},
title = {On the Hardness of Permanent},
booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer
Science, Trier, Germany, March 4-6, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1563},
pages = {90--99},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_8},
doi = {10.1007/3-540-49116-3\_8},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/CaiPS99.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-04-14 01:15 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:
