Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: N. V. Vinodchandran
@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/siamcomp/BhattacharyyaGPTV23,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Eric Price and
Vincent Y. F. Tan and
N. V. Vinodchandran},
title = {Near-Optimal Learning of Tree-Structured Distributions by Chow and
Liu},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {3},
pages = {761--793},
year = {2023},
url = {https://doi.org/10.1137/22m1489678},
doi = {10.1137/22M1489678},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BhattacharyyaGPTV23.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/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-2301-10191,
author = {Sourav Chakraborty and
N. V. Vinodchandran and
Kuldeep S. Meel},
title = {Distinct Elements in Streams: An Algorithm for the (Text) Book},
journal = {CoRR},
volume = {abs/2301.10191},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10191},
doi = {10.48550/ARXIV.2301.10191},
eprinttype = {arXiv},
eprint = {2301.10191},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10191.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/aistats/0001G0RV22,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Saravanan Kandasamy and
Vedant Raval and
N. Variyam Vinodchandran},
editor = {Gustau Camps{-}Valls and
Francisco J. R. Ruiz and
Isabel Valera},
title = {Efficient interventional distribution learning in the {PAC} framework},
booktitle = {International Conference on Artificial Intelligence and Statistics,
{AISTATS} 2022, 28-30 March 2022, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {151},
pages = {7531--7549},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v151/bhattacharyya22a.html},
timestamp = {Sat, 30 Sep 2023 09:34:08 +0200},
biburl = {https://dblp.org/rec/conf/aistats/0001G0RV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/0001VM22,
author = {Sourav Chakraborty and
N. V. Vinodchandran and
Kuldeep S. Meel},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {Distinct Elements in Streams: An Algorithm for the (Text) Book},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {34:1--34:6},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.34},
doi = {10.4230/LIPICS.ESA.2022.34},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/0001VM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icse/Baranov0LMV22,
author = {Eduard Baranov and
Sourav Chakraborty and
Axel Legay and
Kuldeep S. Meel and
N. Variyam Vinodchandran},
title = {A Scalable t-wise Coverage Estimator},
booktitle = {44th {IEEE/ACM} 44th International Conference on Software Engineering,
{ICSE} 2022, Pittsburgh, PA, USA, May 25-27, 2022},
pages = {36--47},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3510003.3510218},
doi = {10.1145/3510003.3510218},
timestamp = {Mon, 18 Jul 2022 16:47:42 +0200},
biburl = {https://dblp.org/rec/conf/icse/Baranov0LMV22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/Meel0V22,
author = {Kuldeep S. Meel and
Sourav Chakraborty and
N. V. Vinodchandran},
editor = {Leonid Libkin and
Pablo Barcel{\'{o}}},
title = {Estimation of the Size of Union of Delphic Sets: Achieving Independence
from Stream Size},
booktitle = {{PODS} '22: International Conference on Management of Data, Philadelphia,
PA, USA, June 12 - 17, 2022},
pages = {41--52},
publisher = {{ACM}},
year = {2022},
url = {https://doi.org/10.1145/3517804.3526222},
doi = {10.1145/3517804.3526222},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/Meel0V22.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}
}
@inproceedings{DBLP:conf/alt/0001G0V21,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Saravanan Kandasamy and
N. V. Vinodchandran},
editor = {Vitaly Feldman and
Katrina Ligett and
Sivan Sabato},
title = {Testing Product Distributions: {A} Closer Look},
booktitle = {Algorithmic Learning Theory, 16-19 March 2021, Virtual Conference,
Worldwide},
series = {Proceedings of Machine Learning Research},
volume = {132},
pages = {367--396},
publisher = {{PMLR}},
year = {2021},
url = {http://proceedings.mlr.press/v132/bhattacharyya21a.html},
timestamp = {Fri, 26 Mar 2021 15:45:50 +0100},
biburl = {https://dblp.org/rec/conf/alt/0001G0V21.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/MeelV021,
author = {Kuldeep S. Meel and
N. V. Vinodchandran and
Sourav Chakraborty},
editor = {Leonid Libkin and
Reinhard Pichler and
Paolo Guagliardo},
title = {Estimating the Size of Union of Sets in Streaming Models},
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 = {126--137},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452021.3458333},
doi = {10.1145/3452021.3458333},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pods/MeelV021.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}
}
@inproceedings{DBLP:conf/stoc/0001GPV21,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Eric Price and
N. V. Vinodchandran},
editor = {Samir Khuller and
Virginia Vassilevska Williams},
title = {Near-optimal learning of tree-structured distributions by Chow-Liu},
booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
Virtual Event, Italy, June 21-25, 2021},
pages = {147--160},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3406325.3451066},
doi = {10.1145/3406325.3451066},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/0001GPV21.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/corr/abs-2107-11712,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Saravanan Kandasamy and
Vedant Raval and
N. V. Vinodchandran},
title = {Efficient inference of interventional distributions},
journal = {CoRR},
volume = {abs/2107.11712},
year = {2021},
url = {https://arxiv.org/abs/2107.11712},
eprinttype = {arXiv},
eprint = {2107.11712},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-11712.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/icml/0001G0MV20,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Saravanan Kandasamy and
Ashwin Maran and
N. Variyam Vinodchandran},
title = {Learning and Sampling of Atomic Interventions from Observations},
booktitle = {Proceedings of the 37th International Conference on Machine Learning,
{ICML} 2020, 13-18 July 2020, Virtual Event},
series = {Proceedings of Machine Learning Research},
volume = {119},
pages = {842--853},
publisher = {{PMLR}},
year = {2020},
url = {http://proceedings.mlr.press/v119/bhattacharyya20a.html},
timestamp = {Tue, 15 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icml/0001G0MV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/nips/0001GMV20,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Kuldeep S. Meel and
N. V. Vinodchandran},
editor = {Hugo Larochelle and
Marc'Aurelio Ranzato and
Raia Hadsell and
Maria{-}Florina Balcan and
Hsuan{-}Tien Lin},
title = {Efficient Distance Approximation for Structured High-Dimensional Distributions
via Learning},
booktitle = {Advances in Neural Information Processing Systems 33: Annual Conference
on Neural Information Processing Systems 2020, NeurIPS 2020, December
6-12, 2020, virtual},
year = {2020},
url = {https://proceedings.neurips.cc/paper/2020/hash/a8acc28734d4fe90ea24353d901ae678-Abstract.html},
timestamp = {Tue, 19 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/nips/0001GMV20.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}
}
@article{DBLP:journals/corr/abs-2002-04232,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Saravanan Kandasamy and
Ashwin Maran and
N. V. Vinodchandran},
title = {Efficiently Learning and Sampling Interventional Distributions from
Observations},
journal = {CoRR},
volume = {abs/2002.04232},
year = {2020},
url = {https://arxiv.org/abs/2002.04232},
eprinttype = {arXiv},
eprint = {2002.04232},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-04232.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-05378,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Kuldeep S. Meel and
N. V. Vinodchandran},
title = {Efficient Distance Approximation for Structured High-Dimensional Distributions
via Learning},
journal = {CoRR},
volume = {abs/2002.05378},
year = {2020},
url = {https://arxiv.org/abs/2002.05378},
eprinttype = {arXiv},
eprint = {2002.05378},
timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-05378.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-04144,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Eric Price and
N. V. Vinodchandran},
title = {Near-Optimal Learning of Tree-Structured Distributions by Chow-Liu},
journal = {CoRR},
volume = {abs/2011.04144},
year = {2020},
url = {https://arxiv.org/abs/2011.04144},
eprinttype = {arXiv},
eprint = {2011.04144},
timestamp = {Mon, 25 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2011-04144.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-14632,
author = {Arnab Bhattacharyya and
Sutanu Gayen and
Saravanan Kandasamy and
N. V. Vinodchandran},
title = {Testing Product Distributions: {A} Closer Look},
journal = {CoRR},
volume = {abs/2012.14632},
year = {2020},
url = {https://arxiv.org/abs/2012.14632},
eprinttype = {arXiv},
eprint = {2012.14632},
timestamp = {Fri, 08 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-14632.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}
}
@article{DBLP:journals/algorithmica/BravermanLSVY18,
author = {Vladimir Braverman and
Zaoxing Liu and
Tejasvam Singh and
N. V. Vinodchandran and
Lin F. Yang},
title = {New Bounds for the {CLIQUE-GAP} Problem Using Graph Decomposition
Theory},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {652--667},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0277-5},
doi = {10.1007/S00453-017-0277-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BravermanLSVY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bcb/BeheraGDV18,
author = {Sairam Behera and
Sutanu Gayen and
Jitender S. Deogun and
N. V. Vinodchandran},
editor = {Amarda Shehu and
Cathy H. Wu and
Christina Boucher and
Jing Li and
Hongfang Liu and
Mihai Pop},
title = {KmerEstimate: {A} Streaming Algorithm for Estimating k-mer Counts
with Optimal Space Usage},
booktitle = {Proceedings of the 2018 {ACM} International Conference on Bioinformatics,
Computational Biology, and Health Informatics, {BCB} 2018, Washington,
DC, USA, August 29 - September 01, 2018},
pages = {438--447},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3233547.3233587},
doi = {10.1145/3233547.3233587},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/bcb/BeheraGDV18.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}
}
@inproceedings{DBLP:conf/swat/GayenV18,
author = {Sutanu Gayen and
N. V. Vinodchandran},
editor = {David Eppstein},
title = {New Algorithms for Distributed Sliding Windows},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {22:1--22:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.22},
doi = {10.4230/LIPICS.SWAT.2018.22},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/swat/GayenV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/bhi/SpanglerVSG17,
author = {Taylor Spangler and
N. V. Vinodchandran and
Ashok Samal and
Jordan R. Green},
title = {Fractal features for automatic detection of dysarthria},
booktitle = {2017 {IEEE} {EMBS} International Conference on Biomedical {\&}
Health Informatics, {BHI} 2017, Orland, FL, USA, February 16-19, 2017},
pages = {437--440},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/BHI.2017.7897299},
doi = {10.1109/BHI.2017.7897299},
timestamp = {Wed, 16 Oct 2019 14:14:51 +0200},
biburl = {https://dblp.org/rec/conf/bhi/SpanglerVSG17.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/cocoon/GayenV16,
author = {Sutanu Gayen and
N. V. Vinodchandran},
editor = {Thang N. Dinh and
My T. Thai},
title = {Algorithms for k-median Clustering over Distributed Streams},
booktitle = {Computing and Combinatorics - 22nd International Conference, {COCOON}
2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9797},
pages = {535--546},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-42634-1\_43},
doi = {10.1007/978-3-319-42634-1\_43},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GayenV16.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/sdm/QuintSVW16,
author = {Paul Quint and
Stephen D. Scott and
N. V. Vinodchandran and
Bradley Worley},
editor = {Sanjay Chawla Venkatasubramanian and
Wagner Meira Jr.},
title = {Constrained Group Testing to Predict Binding Response of Candidate
Compounds},
booktitle = {Proceedings of the 2016 {SIAM} International Conference on Data Mining,
Miami, Florida, USA, May 5-7, 2016},
pages = {756--764},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974348.85},
doi = {10.1137/1.9781611974348.85},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sdm/QuintSVW16.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}
}
@article{DBLP:journals/mst/VinodchandranZ15,
author = {N. V. Vinodchandran and
Marius Zimand},
title = {On Optimal Language Compression for Sets in PSPACE/poly},
journal = {Theory Comput. Syst.},
volume = {56},
number = {3},
pages = {581--590},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9535-y},
doi = {10.1007/S00224-014-9535-Y},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/VinodchandranZ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BravermanLSVY15,
author = {Vladimir Braverman and
Zaoxing Liu and
Tejasvam Singh and
N. V. Vinodchandran and
Lin F. Yang},
editor = {Giuseppe F. Italiano and
Giovanni Pighizzini and
Donald Sannella},
title = {New Bounds for the {CLIQUE-GAP} Problem Using Graph Decomposition
Theory},
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 = {151--162},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48054-0\_13},
doi = {10.1007/978-3-662-48054-0\_13},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BravermanLSVY15.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 = {Thu, 25 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MandalPV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GarvinSTV14,
author = {Brady Garvin and
Derrick Stolee and
Raghunath Tewari and
N. V. Vinodchandran},
title = {ReachFewL = ReachUL},
journal = {Comput. Complex.},
volume = {23},
number = {1},
pages = {85--98},
year = {2014},
url = {https://doi.org/10.1007/s00037-012-0050-8},
doi = {10.1007/S00037-012-0050-8},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GarvinSTV14.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/Variyam14,
author = {N. Variyam Vinodchandran},
title = {Space Complexity of the Directed Reachability Problem over Surface-Embedded
Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-008}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/008},
eprinttype = {ECCC},
eprint = {TR14-008},
timestamp = {Thu, 05 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Variyam14.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}
}
@article{DBLP:journals/corr/abs-1304-1005,
author = {N. V. Vinodchandran and
Marius Zimand},
title = {On optimal language compression for sets in PSPACE/poly},
journal = {CoRR},
volume = {abs/1304.1005},
year = {2013},
url = {http://arxiv.org/abs/1304.1005},
eprinttype = {arXiv},
eprint = {1304.1005},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-1005.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/iandc/TewariV12,
author = {Raghunath Tewari and
N. V. Vinodchandran},
title = {Green's theorem and isolation in planar graphs},
journal = {Inf. Comput.},
volume = {215},
pages = {1--7},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2012.03.002},
doi = {10.1016/J.IC.2012.03.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/TewariV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DattaKTV12,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Space complexity of perfect matching in bounded genus bipartite graphs},
journal = {J. Comput. Syst. Sci.},
volume = {78},
number = {3},
pages = {765--779},
year = {2012},
url = {https://doi.org/10.1016/j.jcss.2011.11.002},
doi = {10.1016/J.JCSS.2011.11.002},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/DattaKTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StoleeV12,
author = {Derrick Stolee and
N. V. Vinodchandran},
title = {Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs},
booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
2012, Porto, Portugal, June 26-29, 2012},
pages = {326--333},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/CCC.2012.15},
doi = {10.1109/CCC.2012.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StoleeV12.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/GarvinSTV11,
author = {Brady Garvin and
Derrick Stolee and
Raghunath Tewari and
N. V. Vinodchandran},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {ReachFewL = ReachUL},
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 = {252--258},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_23},
doi = {10.1007/978-3-642-22685-4\_23},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GarvinSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DattaKTV11,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. Variyam Vinodchandran},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {579--590},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.579},
doi = {10.4230/LIPICS.STACS.2011.579},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DattaKTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GarvinSTV11,
author = {Brady Garvin and
Derrick Stolee and
Raghunath Tewari and
N. V. Vinodchandran},
title = {ReachFewL = ReachUL},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-060}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/060},
eprinttype = {ECCC},
eprint = {TR11-060},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GarvinSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/StoleeBV10,
author = {Derrick Stolee and
Chris Bourke and
N. V. Vinodchandran},
title = {A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs
with Few Sources},
booktitle = {Proceedings of the 25th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2010, Cambridge, Massachusetts, USA, June 9-12,
2010},
pages = {131--138},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/CCC.2010.36},
doi = {10.1109/CCC.2010.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StoleeBV10.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/corr/abs-1004-5080,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
journal = {CoRR},
volume = {abs/1004.5080},
year = {2010},
url = {http://arxiv.org/abs/1004.5080},
eprinttype = {arXiv},
eprint = {1004.5080},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1004-5080.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1010-5470,
author = {Ricard Gavald{\`{a}} and
Mar{\'{\i}}a L{\'{o}}pez{-}Vald{\'{e}}s and
Elvira Mayordomo and
N. V. Vinodchandran},
title = {Resource-bounded Dimension in Computational Learning Theory},
journal = {CoRR},
volume = {abs/1010.5470},
year = {2010},
url = {http://arxiv.org/abs/1010.5470},
eprinttype = {arXiv},
eprint = {1010.5470},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1010-5470.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DattaKTV10,
author = {Samir Datta and
Raghav Kulkarni and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-079}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/079},
eprinttype = {ECCC},
eprint = {TR10-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaKTV10.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}
}
@article{DBLP:journals/eccc/StoleeV10,
author = {Derrick Stolee and
N. V. Vinodchandran},
title = {Space-Efficient Algorithms for Reachability in Surface-Embedded Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-154}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/154},
eprinttype = {ECCC},
eprint = {TR10-154},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/StoleeV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/TewariV10,
author = {Raghunath Tewari and
N. V. Vinodchandran},
title = {Green's Theorem and Isolation in Planar Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-151}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/151},
eprinttype = {ECCC},
eprint = {TR10-151},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/TewariV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BourkeTV09,
author = {Chris Bourke and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Directed Planar Reachability Is in Unambiguous Log-Space},
journal = {{ACM} Trans. Comput. Theory},
volume = {1},
number = {1},
pages = {4:1--4:17},
year = {2009},
url = {https://doi.org/10.1145/1490270.1490274},
doi = {10.1145/1490270.1490274},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BourkeTV09.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}
}
@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/eccc/StoleeSBV09,
author = {Derrick Stolee and
Chris Bourke and
N. V. Vinodchandran},
title = {A log-space algorithm for reachability in planar DAGs with few sources},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-049}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/049},
eprinttype = {ECCC},
eprint = {TR09-049},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/StoleeSBV09.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/ml/BourkeDSSV08,
author = {Chris Bourke and
Kun Deng and
Stephen D. Scott and
Robert E. Schapire and
N. V. Vinodchandran},
title = {On reoptimizing multi-class classifiers},
journal = {Mach. Learn.},
volume = {71},
number = {2-3},
pages = {219--242},
year = {2008},
url = {https://doi.org/10.1007/s10994-008-5056-8},
doi = {10.1007/S10994-008-5056-8},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ml/BourkeDSSV08.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/pami/TaoSVOM08,
author = {Qingping Tao and
Stephen D. Scott and
N. V. Vinodchandran and
Thomas Takeo Osugi and
Brandon Mueller},
title = {Kernels for Generalized Multiple-Instance Learning},
journal = {{IEEE} Trans. Pattern Anal. Mach. Intell.},
volume = {30},
number = {12},
pages = {2084--2098},
year = {2008},
url = {https://doi.org/10.1109/TPAMI.2007.70846},
doi = {10.1109/TPAMI.2007.70846},
timestamp = {Wed, 12 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/pami/TaoSVOM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/wicomm/BalachandranZRTV08,
author = {Ravi K. Balachandran and
Xukai Zou and
Byrav Ramamurthy and
Amandeep Thukral and
N. Variyam Vinodchandran},
title = {An efficient and attack-resistant key agreement scheme for secure
group communications in mobile ad-hoc networks},
journal = {Wirel. Commun. Mob. Comput.},
volume = {8},
number = {10},
pages = {1297--1312},
year = {2008},
url = {https://doi.org/10.1002/wcm.575},
doi = {10.1002/WCM.575},
timestamp = {Thu, 06 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/wicomm/BalachandranZRTV08.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/coco/BourkeTV07,
author = {Chris Bourke and
Raghunath Tewari and
N. V. Vinodchandran},
title = {Directed Planar Reachability is in Unambiguous Log-Space},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {217--221},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.9},
doi = {10.1109/CCC.2007.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BourkeTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/HitchcockV06,
author = {John M. Hitchcock and
N. V. Vinodchandran},
title = {Dimension, entropy rates, and compression},
journal = {J. Comput. Syst. Sci.},
volume = {72},
number = {4},
pages = {760--782},
year = {2006},
url = {https://doi.org/10.1016/j.jcss.2005.10.002},
doi = {10.1016/J.JCSS.2005.10.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/HitchcockV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AntunesFMV06,
author = {Luis Antunes and
Lance Fortnow and
Dieter van Melkebeek and
N. V. Vinodchandran},
title = {Computational depth: Concept and applications},
journal = {Theor. Comput. Sci.},
volume = {354},
number = {3},
pages = {391--404},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2005.11.033},
doi = {10.1016/J.TCS.2005.11.033},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AntunesFMV06.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/icc/DeshpandeTBRZV06,
author = {Sarang Deshpande and
Ajay Kumar Todimala and
Ravi K. Balachandran and
Byrav Ramamurthy and
Xukai Zou and
N. V. Vinodchandran},
title = {A New Cryptographic Scheme for Securing Dynamic Conferences in Data
Networks},
booktitle = {Proceedings of {IEEE} International Conference on Communications,
{ICC} 2006, Istanbul, Turkey, 11-15 June 2006},
pages = {2310--2315},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/ICC.2006.255114},
doi = {10.1109/ICC.2006.255114},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/icc/DeshpandeTBRZV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/MiltersenV05,
author = {Peter Bro Miltersen and
N. V. Vinodchandran},
title = {Derandomizing Arthur-Merlin Games using Hitting Sets},
journal = {Comput. Complex.},
volume = {14},
number = {3},
pages = {256--279},
year = {2005},
url = {https://doi.org/10.1007/s00037-005-0197-7},
doi = {10.1007/S00037-005-0197-7},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/MiltersenV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Vinodchandran05,
author = {N. Variyam Vinodchandran},
title = {Nondeterministic circuit minimization problem and derandomizing Arthur-Merlin
games},
journal = {Int. J. Found. Comput. Sci.},
volume = {16},
number = {6},
pages = {1297--1308},
year = {2005},
url = {https://doi.org/10.1142/S0129054105003819},
doi = {10.1142/S0129054105003819},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Vinodchandran05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Vinodchandran05,
author = {N. V. Vinodchandran},
title = {A note on the circuit complexity of {PP}},
journal = {Theor. Comput. Sci.},
volume = {347},
number = {1-2},
pages = {415--418},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.07.032},
doi = {10.1016/J.TCS.2005.07.032},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Vinodchandran05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BourkeHV05,
author = {Chris Bourke and
John M. Hitchcock and
N. V. Vinodchandran},
title = {Entropy rates and finite-state dimension},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {3},
pages = {392--406},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.040},
doi = {10.1016/J.TCS.2005.09.040},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BourkeHV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/broadnets/TodimalaRV05,
author = {Ajay Kumar Todimala and
Byrav Ramamurthy and
N. V. Vinodchandran},
title = {On computing disjoint paths with dependent cost structure in optical
networks},
booktitle = {2nd International Conference on Broadband Networks {(BROADNETS} 2005),
3-7 October 2005, Boston, Massachusetts, {USA}},
pages = {155--166},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ICBN.2005.1589610},
doi = {10.1109/ICBN.2005.1589610},
timestamp = {Wed, 16 Oct 2019 14:14:56 +0200},
biburl = {https://dblp.org/rec/conf/broadnets/TodimalaRV05.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/icc/BalachandranRZV05,
author = {Ravi K. Balachandran and
Byrav Ramamurthy and
Xukai Zou and
N. Variyam Vinodchandran},
title = {{CRTDH:} an efficient key agreement scheme for secure group communications
in wireless ad hoc networks},
booktitle = {Proceedings of {IEEE} International Conference on Communications,
{ICC} 2005, Seoul, Korea, 16-20 May 2005},
pages = {1123--1127},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ICC.2005.1494522},
doi = {10.1109/ICC.2005.1494522},
timestamp = {Wed, 16 Oct 2019 14:14:50 +0200},
biburl = {https://dblp.org/rec/conf/icc/BalachandranRZV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icccn/HaoVRZ05,
author = {Geng Hao and
N. V. Vinodchandran and
Byrav Ramamurthy and
Xukai Zou},
title = {A balanced key tree approach for dynamic secure group communication},
booktitle = {Proceedings of the 14th International Conference On Computer Communications
and Networks, {ICCCN} 2005, October 17-19, 2005, San Diego, California,
{USA}},
pages = {345--350},
publisher = {{IEEE}},
year = {2005},
url = {https://doi.org/10.1109/ICCCN.2005.1523882},
doi = {10.1109/ICCCN.2005.1523882},
timestamp = {Wed, 16 Oct 2019 14:14:49 +0200},
biburl = {https://dblp.org/rec/conf/icccn/HaoVRZ05.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-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/ipl/Vinodchandran04,
author = {N. V. Vinodchandran},
title = {AM\({}_{\mbox{exp}}\)[nsube](NP[cap]coNP)/poly},
journal = {Inf. Process. Lett.},
volume = {89},
number = {1},
pages = {43--47},
year = {2004},
url = {https://doi.org/10.1016/j.ipl.2003.09.011},
doi = {10.1016/J.IPL.2003.09.011},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Vinodchandran04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Vinodchandran04,
author = {N. V. Vinodchandran},
title = {Counting Complexity of Solvable Black-Box Group Problems},
journal = {{SIAM} J. Comput.},
volume = {33},
number = {4},
pages = {852--869},
year = {2004},
url = {https://doi.org/10.1137/S0097539703420651},
doi = {10.1137/S0097539703420651},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Vinodchandran04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HitchcockV04,
author = {John M. Hitchcock and
N. V. Vinodchandran},
title = {Dimension, Entropy Rates, and Compression},
booktitle = {19th Annual {IEEE} Conference on Computational Complexity {(CCC} 2004),
21-24 June 2004, Amherst, MA, {USA}},
pages = {174--183},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/CCC.2004.1313835},
doi = {10.1109/CCC.2004.1313835},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HitchcockV04.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/cocoon/Vinodchandran04,
author = {N. V. Vinodchandran},
editor = {Kyung{-}Yong Chwa and
J. Ian Munro},
title = {Learning DNFs and Circuits Using Teaching Assistants},
booktitle = {Computing and Combinatorics, 10th Annual International Conference,
{COCOON} 2004, Jeju Island, Korea, August 17-20, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3106},
pages = {188--197},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-27798-9\_22},
doi = {10.1007/978-3-540-27798-9\_22},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Vinodchandran04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icml/TaoSVO04,
author = {Qingping Tao and
Stephen Donald Scott and
N. V. Vinodchandran and
Thomas Takeo Osugi},
editor = {Carla E. Brodley},
title = {SVM-based generalized multiple-instance learning via approximate box
counting},
booktitle = {Machine Learning, Proceedings of the Twenty-first International Conference
{(ICML} 2004), Banff, Alberta, Canada, July 4-8, 2004},
series = {{ACM} International Conference Proceeding Series},
volume = {69},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1015330.1015405},
doi = {10.1145/1015330.1015405},
timestamp = {Fri, 23 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icml/TaoSVO04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ictai/TaoSVOM04,
author = {Qingping Tao and
Stephen Scott and
N. V. Vinodchandran and
Thomas Takeo Osugi and
Brandon Mueller},
title = {An Extended Kernel for Generalized Multiple-Instance Learning},
booktitle = {16th {IEEE} International Conference on Tools with Artificial Intelligence
{(ICTAI} 2004), 15-17 November 2004, Boca Raton, FL, {USA}},
pages = {272--277},
publisher = {{IEEE} Computer Society},
year = {2004},
url = {https://doi.org/10.1109/ICTAI.2004.29},
doi = {10.1109/ICTAI.2004.29},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ictai/TaoSVOM04.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}
}
@article{DBLP:journals/eccc/ECCC-TR04-056,
author = {N. V. Vinodchandran},
title = {A note on the circuit complexity of {PP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-056}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-056/index.html},
eprinttype = {ECCC},
eprint = {TR04-056},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-056.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AntunesFV03,
author = {Luis Antunes and
Lance Fortnow and
N. V. Vinodchandran},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Using Depth to Capture Average-Case Complexity},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {303--310},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_28},
doi = {10.1007/978-3-540-45077-1\_28},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/AntunesFV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/ArvindSV02,
author = {Vikraman Arvind and
K. V. Subrahmanyam and
N. V. Vinodchandran},
title = {The Query Complexity of Program Checking by Constant-Depth Circuits},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2002},
year = {2002},
url = {http://cjtcs.cs.uchicago.edu/articles/2002/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/ArvindSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArvindV00,
author = {Vikraman Arvind and
N. V. Vinodchandran},
title = {Exact learning via teaching assistants},
journal = {Theor. Comput. Sci.},
volume = {241},
number = {1-2},
pages = {51--81},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(99)00266-2},
doi = {10.1016/S0304-3975(99)00266-2},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArvindV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArvindV00a,
author = {Vikraman Arvind and
N. V. Vinodchandran},
title = {The counting complexity of group-definable languages},
journal = {Theor. Comput. Sci.},
volume = {242},
number = {1-2},
pages = {199--218},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00218-7},
doi = {10.1016/S0304-3975(98)00218-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArvindV00a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MiltersenVW99,
author = {Peter Bro Miltersen and
N. V. Vinodchandran and
Osamu Watanabe},
editor = {Takao Asano and
Hiroshi Imai and
D. T. Lee and
Shin{-}Ichi Nakano and
Takeshi Tokuyama},
title = {Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential
Hierarchy},
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 = {210--220},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48686-0\_21},
doi = {10.1007/3-540-48686-0\_21},
timestamp = {Sat, 30 Sep 2023 09:37:25 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/MiltersenVW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/MiltersenV99,
author = {Peter Bro Miltersen and
N. V. Vinodchandran},
title = {Derandomizing Arthur-Merlin Games Using Hitting Sets},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {71--80},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814579},
doi = {10.1109/SFFCS.1999.814579},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/MiltersenV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ArvindSV99,
author = {Vikraman Arvind and
K. V. Subrahmanyam and
N. V. Vinodchandran},
editor = {Alok Aggarwal and
C. Pandu Rangan},
title = {The Query Complexity of Program Checking by Constant-Depth Circuits},
booktitle = {Algorithms and Computation, 10th International Symposium, {ISAAC}
'99, Chennai, India, December 16-18, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1741},
pages = {123--132},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46632-0\_13},
doi = {10.1007/3-540-46632-0\_13},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ArvindSV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-078,
author = {Vikraman Arvind and
K. V. Subrahmanyam and
N. V. Vinodchandran},
title = {The Query Complexity of Program Checking by Constant-Depth Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-078}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-078/index.html},
eprinttype = {ECCC},
eprint = {TR98-078},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-078.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ArvindV97,
author = {Vikraman Arvind and
N. V. Vinodchandran},
title = {Solvable Black-Box Group Problems are Low for {PP}},
journal = {Theor. Comput. Sci.},
volume = {180},
number = {1-2},
pages = {17--45},
year = {1997},
url = {https://doi.org/10.1016/S0304-3975(96)00100-4},
doi = {10.1016/S0304-3975(96)00100-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ArvindV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/ArvindV97,
author = {Vikraman Arvind and
N. V. Vinodchandran},
editor = {Ming Li and
Akira Maruoka},
title = {Exact Learning via Teaching Assistants (Extended Abstract)},
booktitle = {Algorithmic Learning Theory, 8th International Conference, {ALT} '97,
Sendai, Japan, October 6-8, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1316},
pages = {291--306},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63577-7\_50},
doi = {10.1007/3-540-63577-7\_50},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/alt/ArvindV97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Vinodchandran97,
author = {N. V. Vinodchandran},
editor = {S. Ramesh and
G. Sivakumar},
title = {Improved Lowness Results for Solvable Black-box Group Problems},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
17th Conference, Kharagpur, India, December 18-20, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1346},
pages = {220--234},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0058033},
doi = {10.1007/BFB0058033},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Vinodchandran97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/ArvindV96,
author = {Vikraman Arvind and
N. V. Vinodchandran},
editor = {Setsuo Arikawa and
Arun Sharma},
title = {The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract)},
booktitle = {Algorithmic Learning Theory, 7th International Workshop, {ALT} '96,
Sydney, Australia, October 23-25, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1160},
pages = {100--112},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61863-5\_38},
doi = {10.1007/3-540-61863-5\_38},
timestamp = {Wed, 22 Apr 2020 13:23:35 +0200},
biburl = {https://dblp.org/rec/conf/alt/ArvindV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ArvindV96,
author = {Vikraman Arvind and
N. V. Vinodchandran},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
title = {Solvable Black-Box Group Problems Are Low for {PP}},
booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
Science, Grenoble, France, February 22-24, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {99--110},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_9},
doi = {10.1007/3-540-60922-9\_9},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ArvindV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahajanV95,
author = {Meena Mahajan and
N. V. Vinodchandran},
title = {A Note on Mod and Generalised Mod Classes},
journal = {Inf. Process. Lett.},
volume = {55},
number = {1},
pages = {27--31},
year = {1995},
url = {https://doi.org/10.1016/0020-0190(95)00026-9},
doi = {10.1016/0020-0190(95)00026-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahajanV95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/MahajanTV94,
author = {Meena Mahajan and
Thomas Thierauf and
N. V. Vinodchandran},
title = {A Note on SpanP Functions},
journal = {Inf. Process. Lett.},
volume = {51},
number = {1},
pages = {7--10},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00068-9},
doi = {10.1016/0020-0190(94)00068-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/MahajanTV94.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-25 01:31 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:
