Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Jaikumar Radhakrishnan
@inproceedings{DBLP:conf/stoc/ChattopadhyayDM23,
author = {Arkadev Chattopadhyay and
Yogesh Dahiya and
Nikhil S. Mande and
Jaikumar Radhakrishnan and
Swagato Sanyal},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Randomized versus Deterministic Decision Tree Size},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {867--880},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585199},
doi = {10.1145/3564246.3585199},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChattopadhyayDM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/BhandariR22,
author = {Siddharth Bhandari and
Jaikumar Radhakrishnan},
title = {Bounds on the Zero-Error List-Decoding Capacity of the q/(q - 1) Channel},
journal = {{IEEE} Trans. Inf. Theory},
volume = {68},
number = {1},
pages = {238--247},
year = {2022},
url = {https://doi.org/10.1109/TIT.2021.3111455},
doi = {10.1109/TIT.2021.3111455},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/BhandariR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DhamapurkarPR22,
author = {Shyam Dhamapurkar and
Shubham Vivek Pawar and
Jaikumar Radhakrishnan},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Set Membership with Two Classical and Quantum Bit Probes},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {52:1--52:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.52},
doi = {10.4230/LIPICS.ICALP.2022.52},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/DhamapurkarPR22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayDM22,
author = {Arkadev Chattopadhyay and
Yogesh Dahiya and
Nikhil S. Mande and
Jaikumar Radhakrishnan and
Swagato Sanyal},
title = {Randomized versus Deterministic Decision Tree Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-185}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/185},
eprinttype = {ECCC},
eprint = {TR22-185},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayDM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RadhakrishnanS21,
author = {Jaikumar Radhakrishnan and
Aravind Srinivasan},
editor = {Mikolaj Bojanczyk and
Chandra Chekuri},
title = {Property {B:} Two-Coloring Non-Uniform Hypergraphs},
booktitle = {41st {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2021, December 15-17, 2021,
Virtual Conference},
series = {LIPIcs},
volume = {213},
pages = {31:1--31:8},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2021.31},
doi = {10.4230/LIPICS.FSTTCS.2021.31},
timestamp = {Tue, 30 Nov 2021 13:59:34 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/RadhakrishnanS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/GajjarVCR21,
author = {Kshitij Gajjar and
Girish Varma and
Prerona Chatterjee and
Jaikumar Radhakrishnan},
editor = {Cassio P. de Campos and
Marloes H. Maathuis and
Erik Quaeghebeur},
title = {Generalized parametric path problems},
booktitle = {Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial
Intelligence, {UAI} 2021, Virtual Event, 27-30 July 2021},
series = {Proceedings of Machine Learning Research},
volume = {161},
pages = {536--546},
publisher = {{AUAI} Press},
year = {2021},
url = {https://proceedings.mlr.press/v161/gajjar21a.html},
timestamp = {Fri, 17 Dec 2021 17:06:27 +0100},
biburl = {https://dblp.org/rec/conf/uai/GajjarVCR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2102-12886,
author = {Prerona Chatterjee and
Kshitij Gajjar and
Jaikumar Radhakrishnan and
Girish Varma},
title = {Generalized Parametric Path Problems},
journal = {CoRR},
volume = {abs/2102.12886},
year = {2021},
url = {https://arxiv.org/abs/2102.12886},
eprinttype = {arXiv},
eprint = {2102.12886},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2102-12886.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2112-14954,
author = {Shyam Dhamapurkar and
Shubham Vivek Pawar and
Jaikumar Radhakrishnan},
title = {Set membership with two classical and quantum bit probes},
journal = {CoRR},
volume = {abs/2112.14954},
year = {2021},
url = {https://arxiv.org/abs/2112.14954},
eprinttype = {arXiv},
eprint = {2112.14954},
timestamp = {Wed, 05 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2112-14954.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/DalaiGR20,
author = {Marco Dalai and
Venkatesan Guruswami and
Jaikumar Radhakrishnan},
title = {An Improved Bound on the Zero-Error List-Decoding Capacity of the
4/3 Channel},
journal = {{IEEE} Trans. Inf. Theory},
volume = {66},
number = {2},
pages = {749--756},
year = {2020},
url = {https://doi.org/10.1109/TIT.2019.2933424},
doi = {10.1109/TIT.2019.2933424},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/DalaiGR20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/DeyRV20,
author = {Palash Dey and
Jaikumar Radhakrishnan and
Santhoshini Velusamy},
editor = {Javier Esparza and
Daniel Kr{\'{a}}l'},
title = {Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting
Codes},
booktitle = {45th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2020, August 24-28, 2020, Prague, Czech Republic},
series = {LIPIcs},
volume = {170},
pages = {28:1--28:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2020.28},
doi = {10.4230/LIPICS.MFCS.2020.28},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/DeyRV20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GajjarR19,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
editor = {Ren{\'{e}} van Bevern and
Gregory Kucherov},
title = {Minimizing Branching Vertices in Distance-Preserving Subgraphs},
booktitle = {Computer Science - Theory and Applications - 14th International Computer
Science Symposium in Russia, {CSR} 2019, Novosibirsk, Russia, July
1-5, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11532},
pages = {131--142},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-19955-5\_12},
doi = {10.1007/978-3-030-19955-5\_12},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csr/GajjarR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GajjarR19,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
editor = {David Zuckerman},
title = {Parametric Shortest Paths in Planar Graphs},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {876--895},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00057},
doi = {10.1109/FOCS.2019.00057},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/GajjarR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/MukhopadhyayRS18,
author = {Sagnik Mukhopadhyay and
Jaikumar Radhakrishnan and
Swagato Sanyal},
title = {Separation Between Deterministic and Randomized Query Complexity},
journal = {{SIAM} J. Comput.},
volume = {47},
number = {4},
pages = {1644--1666},
year = {2018},
url = {https://doi.org/10.1137/17M1124115},
doi = {10.1137/17M1124115},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/MukhopadhyayRS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/BhandariR18,
author = {Siddharth Bhandari and
Jaikumar Radhakrishnan},
title = {Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel},
booktitle = {2018 {IEEE} International Symposium on Information Theory, {ISIT}
2018, Vail, CO, USA, June 17-22, 2018},
pages = {906--910},
publisher = {{IEEE}},
year = {2018},
url = {https://doi.org/10.1109/ISIT.2018.8437609},
doi = {10.1109/ISIT.2018.8437609},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/BhandariR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-08396,
author = {Siddharth Bhandari and
Jaikumar Radhakrishnan},
title = {Bounds on the Zero-Error List-Decoding Capacity of the q/(q-1) Channel},
journal = {CoRR},
volume = {abs/1802.08396},
year = {2018},
url = {http://arxiv.org/abs/1802.08396},
eprinttype = {arXiv},
eprint = {1802.08396},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-08396.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-11656,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
title = {Minimizing Branching Vertices in Distance-preserving Subgraphs},
journal = {CoRR},
volume = {abs/1810.11656},
year = {2018},
url = {http://arxiv.org/abs/1810.11656},
eprinttype = {arXiv},
eprint = {1810.11656},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-11656.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-05115,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
title = {Parametric Shortest Paths in Planar Graphs},
journal = {CoRR},
volume = {abs/1811.05115},
year = {2018},
url = {http://arxiv.org/abs/1811.05115},
eprinttype = {arXiv},
eprint = {1811.05115},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-05115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GajjarR18,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
title = {Parametric Shortest Paths in Planar Graphs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-211}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/211},
eprinttype = {ECCC},
eprint = {TR18-211},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GajjarR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GajjarR17,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Distance-Preserving Subgraphs of Interval Graphs},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {39:1--39:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.39},
doi = {10.4230/LIPICS.ESA.2017.39},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/GajjarR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isit/DalaiGR17,
author = {Marco Dalai and
Venkatesan Guruswami and
Jaikumar Radhakrishnan},
title = {An improved bound on the zero-error list-decoding capacity of the
4/3 channel},
booktitle = {2017 {IEEE} International Symposium on Information Theory, {ISIT}
2017, Aachen, Germany, June 25-30, 2017},
pages = {1658--1662},
publisher = {{IEEE}},
year = {2017},
url = {https://doi.org/10.1109/ISIT.2017.8006811},
doi = {10.1109/ISIT.2017.8006811},
timestamp = {Wed, 16 Oct 2019 14:14:48 +0200},
biburl = {https://dblp.org/rec/conf/isit/DalaiGR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/0003R17,
author = {Mohit Garg and
Jaikumar Radhakrishnan},
editor = {Heribert Vollmer and
Brigitte Vall{\'{e}}e},
title = {Set Membership with Non-Adaptive Bit Probes},
booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
2017, March 8-11, 2017, Hannover, Germany},
series = {LIPIcs},
volume = {66},
pages = {38:1--38:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.STACS.2017.38},
doi = {10.4230/LIPICS.STACS.2017.38},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/0003R17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-03081,
author = {Kshitij Gajjar and
Jaikumar Radhakrishnan},
title = {Distance-preserving Subgraphs of Interval Graphs},
journal = {CoRR},
volume = {abs/1708.03081},
year = {2017},
url = {http://arxiv.org/abs/1708.03081},
eprinttype = {arXiv},
eprint = {1708.03081},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-03081.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/RadhakrishnanSW16,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Naqueeb Ahmad Warsi},
title = {One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel},
journal = {{IEEE} Trans. Inf. Theory},
volume = {62},
number = {5},
pages = {2836--2848},
year = {2016},
url = {https://doi.org/10.1109/TIT.2016.2531795},
doi = {10.1109/TIT.2016.2531795},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tit/RadhakrishnanSW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GuruswamiR16,
author = {Venkatesan Guruswami and
Jaikumar Radhakrishnan},
editor = {Ran Raz},
title = {Tight Bounds for Communication-Assisted Agreement Distillation},
booktitle = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
June 1, 2016, Tokyo, Japan},
series = {LIPIcs},
volume = {50},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CCC.2016.6},
doi = {10.4230/LIPICS.CCC.2016.6},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/GuruswamiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RadhakrishnanS16,
author = {Jaikumar Radhakrishnan and
Swagato Sanyal},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {The Zero-Error Randomized Query Complexity of the Pointer Function},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {16:1--16:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.16},
doi = {10.4230/LIPICS.FSTTCS.2016.16},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/RadhakrishnanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Harsha0R16,
author = {Prahladh Harsha and
Rahul Jain and
Jaikumar Radhakrishnan},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Partition Bound Is Quadratically Tight for Product Distributions},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {135:1--135:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.135},
doi = {10.4230/LIPICS.ICALP.2016.135},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Harsha0R16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/CummingsLRRW16,
author = {Rachel Cummings and
Katrina Ligett and
Jaikumar Radhakrishnan and
Aaron Roth and
Zhiwei Steven Wu},
editor = {Madhu Sudan},
title = {Coordination Complexity: Small Information Coordinating Large Populations},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, Cambridge, MA, USA, January 14-16, 2016},
pages = {281--290},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2840728.2840767},
doi = {10.1145/2840728.2840767},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/CummingsLRRW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RadhakrishnanS16,
author = {Jaikumar Radhakrishnan and
Swagato Sanyal},
title = {The zero-error randomized query complexity of the pointer function},
journal = {CoRR},
volume = {abs/1607.01684},
year = {2016},
url = {http://arxiv.org/abs/1607.01684},
eprinttype = {arXiv},
eprint = {1607.01684},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RadhakrishnanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0003R16e,
author = {Mohit Garg and
Jaikumar Radhakrishnan},
title = {Set membership with non-adaptive bit probes},
journal = {CoRR},
volume = {abs/1612.09388},
year = {2016},
url = {http://arxiv.org/abs/1612.09388},
eprinttype = {arXiv},
eprint = {1612.09388},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0003R16e.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GuruswamiR16,
author = {Venkatesan Guruswami and
Jaikumar Radhakrishnan},
title = {Tight bounds for communication assisted agreement distillation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-033}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/033},
eprinttype = {ECCC},
eprint = {TR16-033},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GuruswamiR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RadhakrishnanS16,
author = {Jaikumar Radhakrishnan and
Swagato Sanyal},
title = {The zero-error randomized query complexity of the pointer function},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-103}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/103},
eprinttype = {ECCC},
eprint = {TR16-103},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/RadhakrishnanS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GargR15,
author = {Mohit Garg and
Jaikumar Radhakrishnan},
editor = {Piotr Indyk},
title = {Set membership with a few bit probes},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {776--784},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.53},
doi = {10.1137/1.9781611973730.53},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/GargR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DuttaKMR15,
author = {Chinmoy Dutta and
Yashodhan Kanoria and
D. Manjunath and
Jaikumar Radhakrishnan},
title = {How Hard is Computing Parity with Noisy Communications?},
journal = {CoRR},
volume = {abs/1502.02290},
year = {2015},
url = {http://arxiv.org/abs/1502.02290},
eprinttype = {arXiv},
eprint = {1502.02290},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DuttaKMR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DuttaR15,
author = {Chinmoy Dutta and
Jaikumar Radhakrishnan},
title = {A Sampling Technique of Proving Lower Bounds for Noisy Computations},
journal = {CoRR},
volume = {abs/1503.00321},
year = {2015},
url = {http://arxiv.org/abs/1503.00321},
eprinttype = {arXiv},
eprint = {1503.00321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DuttaR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/0003R15a,
author = {Mohit Garg and
Jaikumar Radhakrishnan},
title = {Set Membership with a Few Bit Probes},
journal = {CoRR},
volume = {abs/1504.02035},
year = {2015},
url = {http://arxiv.org/abs/1504.02035},
eprinttype = {arXiv},
eprint = {1504.02035},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/0003R15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CummingsLRRW15,
author = {Rachel Cummings and
Katrina Ligett and
Jaikumar Radhakrishnan and
Aaron Roth and
Zhiwei Steven Wu},
title = {Coordination Complexity: Small Information Coordinating Large Populations},
journal = {CoRR},
volume = {abs/1508.03735},
year = {2015},
url = {http://arxiv.org/abs/1508.03735},
eprinttype = {arXiv},
eprint = {1508.03735},
timestamp = {Tue, 08 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CummingsLRRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/HarshaJR15,
author = {Prahladh Harsha and
Rahul Jain and
Jaikumar Radhakrishnan},
title = {Relaxed partition bound is quadratically tight for product distributions},
journal = {CoRR},
volume = {abs/1512.01968},
year = {2015},
url = {http://arxiv.org/abs/1512.01968},
eprinttype = {arXiv},
eprint = {1512.01968},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/HarshaJR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RadhakrishnanSV15,
author = {Jaikumar Radhakrishnan and
Saswata Shannigrahi and
Rakesh Venkat},
title = {Hypergraph Two-Coloring in the Streaming Model},
journal = {CoRR},
volume = {abs/1512.04188},
year = {2015},
url = {http://arxiv.org/abs/1512.04188},
eprinttype = {arXiv},
eprint = {1512.04188},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RadhakrishnanSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HarshaJR15,
author = {Prahladh Harsha and
Rahul Jain and
Jaikumar Radhakrishnan},
title = {Relaxed partition bound is quadratically tight for product distributions},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-199}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/199},
eprinttype = {ECCC},
eprint = {TR15-199},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HarshaJR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChattopadhyayRR14,
author = {Arkadev Chattopadhyay and
Jaikumar Radhakrishnan and
Atri Rudra},
title = {Topology Matters in Communication},
booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2014, Philadelphia, PA, USA, October 18-21, 2014},
pages = {631--640},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/FOCS.2014.73},
doi = {10.1109/FOCS.2014.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChattopadhyayRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/RadhakrishnanSW14,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Naqueeb Warsi},
title = {One-shot Marton inner bound for classical-quantum broadcast channel},
journal = {CoRR},
volume = {abs/1410.3248},
year = {2014},
url = {http://arxiv.org/abs/1410.3248},
eprinttype = {arXiv},
eprint = {1410.3248},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/RadhakrishnanSW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChattopadhyayRR14,
author = {Arkadev Chattopadhyay and
Jaikumar Radhakrishnan and
Atri Rudra},
title = {Topology matters in communication},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-074}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/074},
eprinttype = {ECCC},
eprint = {TR14-074},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChattopadhyayRR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BabuLRV13,
author = {Ajesh Babu and
Nutan Limaye and
Jaikumar Radhakrishnan and
Girish Varma},
title = {Streaming algorithms for language recognition problems},
journal = {Theor. Comput. Sci.},
volume = {494},
pages = {13--23},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.12.028},
doi = {10.1016/J.TCS.2012.12.028},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BabuLRV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/EmekHMPRR12,
author = {Yuval Emek and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Yishay Mansour and
Boaz Patt{-}Shamir and
Jaikumar Radhakrishnan and
Dror Rawitz},
title = {Online Set Packing},
journal = {{SIAM} J. Comput.},
volume = {41},
number = {4},
pages = {728--746},
year = {2012},
url = {https://doi.org/10.1137/110820774},
doi = {10.1137/110820774},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/EmekHMPRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/PanconesiR12,
author = {Alessandro Panconesi and
Jaikumar Radhakrishnan},
title = {Expansion properties of (secure) wireless networks},
journal = {{ACM} Trans. Algorithms},
volume = {8},
number = {3},
pages = {21:1--21:9},
year = {2012},
url = {https://doi.org/10.1145/2229163.2229165},
doi = {10.1145/2229163.2229165},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/PanconesiR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuschDRRS12,
author = {Costas Busch and
Chinmoy Dutta and
Jaikumar Radhakrishnan and
Rajmohan Rajaraman and
Srinivasagopalan Srivathsan},
title = {Split and Join: Strong Partitions and Universal Steiner Trees for
Graphs},
booktitle = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2012, New Brunswick, NJ, USA, October 20-23, 2012},
pages = {81--90},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/FOCS.2012.45},
doi = {10.1109/FOCS.2012.45},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BuschDRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/DuttaR12,
author = {Chinmoy Dutta and
Jaikumar Radhakrishnan},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {More on a Problem of Zarankiewicz},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {257--266},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_29},
doi = {10.1007/978-3-642-35261-4\_29},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/DuttaR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2012,
editor = {Deepak D'Souza and
Telikepalli Kavitha and
Jaikumar Radhakrishnan},
title = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2012, December 15-17, 2012,
Hyderabad, India},
series = {LIPIcs},
volume = {18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {http://drops.dagstuhl.de/portals/extern/index.php?semnr=12014},
isbn = {978-3-939897-47-7},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-1377,
author = {Chinmoy Dutta and
Jaikumar Radhakrishnan},
title = {More on a Problem of Zarankiewicz},
journal = {CoRR},
volume = {abs/1201.1377},
year = {2012},
url = {http://arxiv.org/abs/1201.1377},
eprinttype = {arXiv},
eprint = {1201.1377},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-1377.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/RadhakrishnanS11,
author = {Jaikumar Radhakrishnan and
Saswata Shannigrahi},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Streaming Algorithms for 2-Coloring Uniform Hypergraphs},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {667--678},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_57},
doi = {10.1007/978-3-642-22300-6\_57},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/RadhakrishnanS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-0848,
author = {Ajesh Babu and
Nutan Limaye and
Jaikumar Radhakrishnan and
Girish Varma},
title = {Streaming algorithms for language recognition problems},
journal = {CoRR},
volume = {abs/1104.0848},
year = {2011},
url = {http://arxiv.org/abs/1104.0848},
eprinttype = {arXiv},
eprint = {1104.0848},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-0848.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-4766,
author = {Costas Busch and
Chinmoy Dutta and
Jaikumar Radhakrishnan and
Rajmohan Rajaraman and
Srinivasagopalan Srivathsan},
title = {Split and Join: Strong Partitions and Universal Steiner Trees for
Graphs},
journal = {CoRR},
volume = {abs/1111.4766},
year = {2011},
url = {http://arxiv.org/abs/1111.4766},
eprinttype = {arXiv},
eprint = {1111.4766},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-4766.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/Ben-SassonKR10,
author = {Eli Ben{-}Sasson and
Swastik Kopparty and
Jaikumar Radhakrishnan},
title = {Subspace polynomials and limits to list decoding of Reed-Solomon codes},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {1},
pages = {113--120},
year = {2010},
url = {https://doi.org/10.1109/TIT.2009.2034780},
doi = {10.1109/TIT.2009.2034780},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/Ben-SassonKR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tit/HarshaJMR10,
author = {Prahladh Harsha and
Rahul Jain and
David A. McAllester and
Jaikumar Radhakrishnan},
title = {The communication complexity of correlation},
journal = {{IEEE} Trans. Inf. Theory},
volume = {56},
number = {1},
pages = {438--449},
year = {2010},
url = {https://doi.org/10.1109/TIT.2009.2034824},
doi = {10.1109/TIT.2009.2034824},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tit/HarshaJMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RadhakrishnanSS10,
author = {Jaikumar Radhakrishnan and
Smit Shah and
Saswata Shannigrahi},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Data Structures for Storing Small Sets in the Bitprobe Model},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {6347},
pages = {159--170},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15781-3\_14},
doi = {10.1007/978-3-642-15781-3\_14},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/RadhakrishnanSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/EmekHMPRR10,
author = {Yuval Emek and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Yishay Mansour and
Boaz Patt{-}Shamir and
Jaikumar Radhakrishnan and
Dror Rawitz},
editor = {Andr{\'{e}}a W. Richa and
Rachid Guerraoui},
title = {Online set packing and competitive scheduling of multi-part tasks},
booktitle = {Proceedings of the 29th Annual {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2010, Zurich, Switzerland, July 25-28, 2010},
pages = {440--449},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1835698.1835800},
doi = {10.1145/1835698.1835800},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/EmekHMPRR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-1058,
author = {Ajesh Babu and
Jaikumar Radhakrishnan},
title = {An entropy based proof of the Moore bound for irregular graphs},
journal = {CoRR},
volume = {abs/1011.1058},
year = {2010},
url = {http://arxiv.org/abs/1011.1058},
eprinttype = {arXiv},
eprint = {1011.1058},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-1058.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RadhakrishnanRS09,
author = {Jaikumar Radhakrishnan and
Martin R{\"{o}}tteler and
Pranab Sen},
title = {Random Measurement Bases, Quantum State Distinction and Applications
to the Hidden Subgroup Problem},
journal = {Algorithmica},
volume = {55},
number = {3},
pages = {490--516},
year = {2009},
url = {https://doi.org/10.1007/s00453-008-9231-x},
doi = {10.1007/S00453-008-9231-X},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RadhakrishnanRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/JainRS09,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {A property of quantum relative entropy with an application to privacy
in quantum communication},
journal = {J. {ACM}},
volume = {56},
number = {6},
pages = {33:1--33:32},
year = {2009},
url = {https://doi.org/10.1145/1568318.1568323},
doi = {10.1145/1568318.1568323},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/JainRS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GopalanR09,
author = {Parikshit Gopalan and
Jaikumar Radhakrishnan},
editor = {Claire Mathieu},
title = {Finding duplicates in a data stream},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {402--411},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.45},
doi = {10.1137/1.9781611973068.45},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/GopalanR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tissec/PietroMMPR08,
author = {Roberto Di Pietro and
Luigi V. Mancini and
Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan},
title = {Redoubtable Sensor Networks},
journal = {{ACM} Trans. Inf. Syst. Secur.},
volume = {11},
number = {3},
pages = {13:1--13:22},
year = {2008},
url = {https://doi.org/10.1145/1341731.1341734},
doi = {10.1145/1341731.1341734},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tissec/PietroMMPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/DuttaR08,
author = {Chinmoy Dutta and
Jaikumar Radhakrishnan},
title = {Lower Bounds for Noisy Wireless Networks using Sampling Algorithms},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {394--402},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.72},
doi = {10.1109/FOCS.2008.72},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/DuttaR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/securecomm/MeiPR08,
author = {Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan},
editor = {Albert Levi and
Peng Liu and
Refik Molva},
title = {Unassailable sensor networks},
booktitle = {4th International {ICST} Conference on Security and Privacy in Communication
Networks, {SECURECOMM} 2008, Istanbul, Turkey, September 22-25, 2008},
pages = {26},
publisher = {{ACM}},
year = {2008},
url = {https://doi.org/10.1145/1460877.1460911},
doi = {10.1145/1460877.1460911},
timestamp = {Tue, 06 Nov 2018 16:58:12 +0100},
biburl = {https://dblp.org/rec/conf/securecomm/MeiPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HarshaHNRR08,
author = {Prahladh Harsha and
Thomas P. Hayes and
Hariharan Narayanan and
Harald R{\"{a}}cke and
Jaikumar Radhakrishnan},
editor = {Shang{-}Hua Teng},
title = {Minimizing average latency in oblivious routing},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {200--207},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347105},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HarshaHNRR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DuttaKMR08,
author = {Chinmoy Dutta and
Yashodhan Kanoria and
D. Manjunath and
Jaikumar Radhakrishnan},
editor = {Shang{-}Hua Teng},
title = {A tight lower bound for parity in noisy communication networks},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {1056--1065},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347198},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DuttaKMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0807-1267,
author = {Rahul Jain and
Pranab Sen and
Jaikumar Radhakrishnan},
title = {Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical
Communication Complexity},
journal = {CoRR},
volume = {abs/0807.1267},
year = {2008},
url = {http://arxiv.org/abs/0807.1267},
eprinttype = {arXiv},
eprint = {0807.1267},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0807-1267.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HalldorssonKRS07,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Guy Kortsarz and
Jaikumar Radhakrishnan and
Sivaramakrishnan Sivasubramanian},
title = {Complete partitions of graphs},
journal = {Comb.},
volume = {27},
number = {5},
pages = {519--550},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2169-9},
doi = {10.1007/S00493-007-2169-9},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HalldorssonKRS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HarshaJMR07,
author = {Prahladh Harsha and
Rahul Jain and
David A. McAllester and
Jaikumar Radhakrishnan},
title = {The Communication Complexity of Correlation},
booktitle = {22nd Annual {IEEE} Conference on Computational Complexity {(CCC} 2007),
13-16 June 2007, San Diego, California, {USA}},
pages = {10--23},
publisher = {{IEEE} Computer Society},
year = {2007},
url = {https://doi.org/10.1109/CCC.2007.32},
doi = {10.1109/CCC.2007.32},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HarshaJMR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Ben-SassonKR06,
author = {Eli Ben{-}Sasson and
Swastik Kopparty and
Jaikumar Radhakrishnan},
title = {Subspace Polynomials and List Decoding of Reed-Solomon Codes},
booktitle = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
pages = {207--216},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/FOCS.2006.73},
doi = {10.1109/FOCS.2006.73},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/Ben-SassonKR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/ChakrabortyRRS06,
author = {Sourav Chakraborty and
Jaikumar Radhakrishnan and
Nandakumar Raghunathan and
Prashant Sasatte},
editor = {S. Arun{-}Kumar and
Naveen Garg},
title = {Zero Error List-Decoding Capacity of the \emph{q}/(\emph{q}-1) Channel},
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 = {129--138},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11944836\_14},
doi = {10.1007/11944836\_14},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/ChakrabortyRRS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Radhakrishnan06,
author = {Jaikumar Radhakrishnan},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
title = {Gap Amplification in PCPs Using Lazy Random Walks},
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 = {96--107},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_10},
doi = {10.1007/11786986\_10},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Radhakrishnan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/securecomm/PietroMMPR06,
author = {Roberto Di Pietro and
Luigi V. Mancini and
Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan},
title = {Sensor Networks that Are Provably Resilient},
booktitle = {Second International Conference on Security and Privacy in Communication
Networks and the Workshops, SecureComm 2006, Baltimore, MD, USA, August
2, 2006 - September 1, 2006},
pages = {1--10},
publisher = {{IEEE}},
year = {2006},
url = {https://doi.org/10.1109/SECCOMW.2006.359569},
doi = {10.1109/SECCOMW.2006.359569},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/securecomm/PietroMMPR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DuttaR06,
author = {Chinmoy Dutta and
Jaikumar Radhakrishnan},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Tradeoffs in Depth-Two Superconcentrators},
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 = {372--383},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_30},
doi = {10.1007/11672142\_30},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DuttaR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HarshaJMR06,
author = {Prahladh Harsha and
Rahul Jain and
David A. McAllester and
Jaikumar Radhakrishnan},
title = {The communication complexity of correlation},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-151}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-151/index.html},
eprinttype = {ECCC},
eprint = {TR06-151},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/HarshaJMR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/DubhashiMPRS05,
author = {Devdatt P. Dubhashi and
Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan and
Aravind Srinivasan},
title = {Fast distributed algorithms for (weakly) connected dominating sets
and linear-size skeletons},
journal = {J. Comput. Syst. Sci.},
volume = {71},
number = {4},
pages = {467--479},
year = {2005},
url = {https://doi.org/10.1016/j.jcss.2005.04.002},
doi = {10.1016/J.JCSS.2005.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/DubhashiMPRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LinialR05,
author = {Nathan Linial and
Jaikumar Radhakrishnan},
title = {Essential covers of the cube by hyperplanes},
journal = {J. Comb. Theory, Ser. {A}},
volume = {109},
number = {2},
pages = {331--338},
year = {2005},
url = {https://doi.org/10.1016/j.jcta.2004.07.012},
doi = {10.1016/J.JCTA.2004.07.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LinialR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DeshpandeJKLR05,
author = {Amit Deshpande and
Rahul Jain and
Telikepalli Kavitha and
Satyanarayana V. Lokam and
Jaikumar Radhakrishnan},
title = {Lower bounds for adaptive locally decodable codes},
journal = {Random Struct. Algorithms},
volume = {27},
number = {3},
pages = {358--378},
year = {2005},
url = {https://doi.org/10.1002/rsa.20069},
doi = {10.1002/RSA.20069},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DeshpandeJKLR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MiltersenRW05,
author = {Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Ingo Wegener},
title = {On converting {CNF} to {DNF}},
journal = {Theor. Comput. Sci.},
volume = {347},
number = {1-2},
pages = {325--335},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.07.029},
doi = {10.1016/J.TCS.2005.07.029},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MiltersenRW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChakrabortyRR05,
author = {Sourav Chakraborty and
Jaikumar Radhakrishnan and
Nandakumar Raghunathan},
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Luca Trevisan},
title = {Bounds for Error Reduction with Few Quantum Queries},
booktitle = {Approximation, Randomization and Combinatorial Optimization, Algorithms
and Techniques, 8th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2005 and 9th InternationalWorkshop
on Randomization and Computation, {RANDOM} 2005, Berkeley, CA, USA,
August 22-24, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3624},
pages = {245--256},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11538462\_21},
doi = {10.1007/11538462\_21},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChakrabortyRR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/JainRS05,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {Prior Entanglement, Message Compression and Privacy in Quantum Communication},
booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
11-15 June 2005, San Jose, CA, {USA}},
pages = {285--296},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.24},
doi = {10.1109/CCC.2005.24},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/JainRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/RadhakrishnanRS05,
author = {Jaikumar Radhakrishnan and
Martin R{\"{o}}tteler and
Pranab Sen},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {On the Power of Random Bases in Fourier Sampling: Hidden Subgroup
Problem in the Heisenberg Group},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1399--1411},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_113},
doi = {10.1007/11523468\_113},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/RadhakrishnanRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KortsarzRS05,
author = {Guy Kortsarz and
Jaikumar Radhakrishnan and
Sivaramakrishnan Sivasubramanian},
title = {Complete partitions of graphs},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {860--869},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070553},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KortsarzRS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/GroverR05,
author = {Lov K. Grover and
Jaikumar Radhakrishnan},
editor = {Phillip B. Gibbons and
Paul G. Spirakis},
title = {Is partial quantum search of a database any easier?},
booktitle = {{SPAA} 2005: Proceedings of the 17th Annual {ACM} Symposium on Parallelism
in Algorithms and Architectures, July 18-20, 2005, Las Vegas, Nevada,
{USA}},
pages = {186--194},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1073970.1073997},
doi = {10.1145/1073970.1073997},
timestamp = {Wed, 21 Nov 2018 11:12:26 +0100},
biburl = {https://dblp.org/rec/conf/spaa/GroverR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sasn/PietroMMPR04,
author = {Roberto Di Pietro and
Luigi V. Mancini and
Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan},
editor = {Sanjeev Setia and
Vipin Swarup},
title = {Connectivity properties of secure wireless sensor networks},
booktitle = {Proceedings of the 2nd {ACM} Workshop on Security of ad hoc and Sensor
Networks, {SASN} 2004, Washington, DC, USA, October 25, 2004},
pages = {53--58},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1029102.1029112},
doi = {10.1145/1029102.1029112},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sasn/PietroMMPR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/PanconesiR04,
author = {Alessandro Panconesi and
Jaikumar Radhakrishnan},
editor = {Phillip B. Gibbons and
Micah Adler},
title = {Expansion properties of (secure) wireless networks},
booktitle = {{SPAA} 2004: Proceedings of the Sixteenth Annual {ACM} Symposium on
Parallelism in Algorithms and Architectures, June 27-30, 2004, Barcelona,
Spain},
pages = {281--285},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1007912.1007959},
doi = {10.1145/1007912.1007959},
timestamp = {Wed, 21 Nov 2018 11:11:51 +0100},
biburl = {https://dblp.org/rec/conf/spaa/PanconesiR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Radhakrishnan03,
author = {Jaikumar Radhakrishnan},
title = {A note on scrambling permutations},
journal = {Random Struct. Algorithms},
volume = {22},
number = {4},
pages = {435--439},
year = {2003},
url = {https://doi.org/10.1002/rsa.10082},
doi = {10.1002/RSA.10082},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Radhakrishnan03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JainRS03,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {A Lower Bound for the Bounded Round Quantum Communication Complexity
of Set Disjointness},
booktitle = {44th Symposium on Foundations of Computer Science {(FOCS} 2003), 11-14
October 2003, Cambridge, MA, USA, Proceedings},
pages = {220--229},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/SFCS.2003.1238196},
doi = {10.1109/SFCS.2003.1238196},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JainRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/JainRS03,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
editor = {Jos C. M. Baeten and
Jan Karel Lenstra and
Joachim Parrow and
Gerhard J. Woeginger},
title = {A Direct Sum Theorem in Communication Complexity via Message Compression},
booktitle = {Automata, Languages and Programming, 30th International Colloquium,
{ICALP} 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2719},
pages = {300--315},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/3-540-45061-0\_26},
doi = {10.1007/3-540-45061-0\_26},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/JainRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/MiltersenRW03,
author = {Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Ingo Wegener},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {On Converting {CNF} to {DNF}},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {612--621},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_55},
doi = {10.1007/978-3-540-45138-9\_55},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/MiltersenRW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DubhashiMPRS03,
author = {Devdatt P. Dubhashi and
Alessandro Mei and
Alessandro Panconesi and
Jaikumar Radhakrishnan and
Aravind Srinivasan},
title = {Fast distributed algorithms for (weakly) connected dominating sets
and linear-size skeletons},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {717--724},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644226},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/DubhashiMPRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2003,
editor = {Paritosh K. Pandya and
Jaikumar Radhakrishnan},
title = {{FST} {TCS} 2003: Foundations of Software Technology and Theoretical
Computer Science, 23rd Conference, Mumbai, India, December 15-17,
2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2914},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/b94618},
doi = {10.1007/B94618},
isbn = {3-540-20680-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-CC-0304020,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {A direct sum theorem in communication complexity via message compression},
journal = {CoRR},
volume = {cs.CC/0304020},
year = {2003},
url = {http://arxiv.org/abs/cs/0304020},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-CC-0304020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-017,
author = {Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Ingo Wegener},
title = {On Converting {CNF} to {DNF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-017}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-017/index.html},
eprinttype = {ECCC},
eprint = {TR03-017},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RadhakrishnanSV02,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Srinivasan Venkatesh},
title = {The Quantum Complexity of Set Membership},
journal = {Algorithmica},
volume = {34},
number = {4},
pages = {462--479},
year = {2002},
url = {https://doi.org/10.1007/s00453-002-0979-0},
doi = {10.1007/S00453-002-0979-0},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/RadhakrishnanSV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuhrmanMRV02,
author = {Harry Buhrman and
Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
title = {Are Bitvectors Optimal?},
journal = {{SIAM} J. Comput.},
volume = {31},
number = {6},
pages = {1723--1744},
year = {2002},
url = {https://doi.org/10.1137/S0097539702405292},
doi = {10.1137/S0097539702405292},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BuhrmanMRV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DeshpandeJKRL02,
author = {Amit Deshpande and
Rahul Jain and
Telikepalli Kavitha and
Jaikumar Radhakrishnan and
Satyanarayana V. Lokam},
title = {Better Lower Bounds for Locally Decodable Codes},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {184--193},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004354},
doi = {10.1109/CCC.2002.1004354},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DeshpandeJKRL02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JainRS02,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
title = {Privacy and Interaction in Quantum Communication Complexity and a
Theorem about the Relative Entropy of Quantum States},
booktitle = {43rd Symposium on Foundations of Computer Science {(FOCS} 2002), 16-19
November 2002, Vancouver, BC, Canada, Proceedings},
pages = {429--438},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/SFCS.2002.1181967},
doi = {10.1109/SFCS.2002.1181967},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JainRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/JainRS02,
author = {Rahul Jain and
Jaikumar Radhakrishnan and
Pranab Sen},
editor = {Manindra Agrawal and
Anil Seth},
title = {The Quantum Communication Complexity of the Pointer Chasing Problem:
The Bit Version},
booktitle = {{FST} {TCS} 2002: Foundations of Software Technology and Theoretical
Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2556},
pages = {218--229},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36206-1\_20},
doi = {10.1007/3-540-36206-1\_20},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/JainRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/MishraRS02,
author = {S. Mishra and
Jaikumar Radhakrishnan and
Sivaramakrishnan Sivasubramanian},
editor = {Manindra Agrawal and
Anil Seth},
title = {On the Hardness of Approximating Minimum Monopoly Problems},
booktitle = {{FST} {TCS} 2002: Foundations of Software Technology and Theoretical
Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2556},
pages = {277--288},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36206-1\_25},
doi = {10.1007/3-540-36206-1\_25},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/MishraRS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RadhakrishnanR01,
author = {Jaikumar Radhakrishnan and
Venkatesh Raman},
title = {A tradeoff between search and update in dictionaries},
journal = {Inf. Process. Lett.},
volume = {80},
number = {5},
pages = {243--247},
year = {2001},
url = {https://doi.org/10.1016/S0020-0190(01)00173-9},
doi = {10.1016/S0020-0190(01)00173-9},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RadhakrishnanR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/PonzioRV01,
author = {Stephen Ponzio and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
title = {The Communication Complexity of Pointer Chasing},
journal = {J. Comput. Syst. Sci.},
volume = {62},
number = {2},
pages = {323--355},
year = {2001},
url = {https://doi.org/10.1006/jcss.2000.1731},
doi = {10.1006/JCSS.2000.1731},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/PonzioRV01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RadhakrishnanRR01,
author = {Jaikumar Radhakrishnan and
Venkatesh Raman and
S. Srinivasa Rao},
editor = {Friedhelm Meyer auf der Heide},
title = {Explicit Deterministic Constructions for Membership in the Bitprobe
Model},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {290--299},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_24},
doi = {10.1007/3-540-44676-1\_24},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/RadhakrishnanRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/cs-DM-0110031,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Sundar Vishwanathan},
title = {Depth-3 Arithmetic Circuits for S{\^{}}2{\_}n(X) and Extensions of
the Graham-Pollack Theorem},
journal = {CoRR},
volume = {cs.DM/0110031},
year = {2001},
url = {https://arxiv.org/abs/cs/0110031},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/cs-DM-0110031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RadhakrishnanS00,
author = {Jaikumar Radhakrishnan and
Aravind Srinivasan},
title = {Improved bounds and algorithms for hypergraph 2-coloring},
journal = {Random Struct. Algorithms},
volume = {16},
number = {1},
pages = {4--32},
year = {2000},
url = {https://doi.org/10.1002/(SICI)1098-2418(200001)16:1\&\#60;4::AID-RSA2\&\#62;3.0.CO;2-2},
doi = {10.1002/(SICI)1098-2418(200001)16:1\&\#60;4::AID-RSA2\&\#62;3.0.CO;2-2},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RadhakrishnanS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RadhakrishnanT00,
author = {Jaikumar Radhakrishnan and
Amnon Ta{-}Shma},
title = {Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators},
journal = {{SIAM} J. Discret. Math.},
volume = {13},
number = {1},
pages = {2--24},
year = {2000},
url = {https://doi.org/10.1137/S0895480197329508},
doi = {10.1137/S0895480197329508},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RadhakrishnanT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RadhakrishnanSV00,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Srinivasan Venkatesh},
title = {The Quantum Complexity of Set Membership},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {554--562},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892143},
doi = {10.1109/SFCS.2000.892143},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RadhakrishnanSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/RadhakrishnanSV00,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Sundar Vishwanathan},
editor = {Sanjiv Kapoor and
Sanjiva Prasad},
title = {Depth-3 Arithmetic Circuits for S\({}_{\mbox{n}}\)\({}^{\mbox{2}}\)(X)
and Extensions of the Graham-Pollack Theorem},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
20th Conference, {FST} {TCS} 2000 New Delhi, India, December 13-15,
2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1974},
pages = {176--187},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44450-5\_14},
doi = {10.1007/3-540-44450-5\_14},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/RadhakrishnanSV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuhrmanMRV00,
author = {Harry Buhrman and
Peter Bro Miltersen and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {Are bitvectors optimal?},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {449--458},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335357},
doi = {10.1145/335305.335357},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/BuhrmanMRV00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/quant-ph-0007021,
author = {Jaikumar Radhakrishnan and
Pranab Sen and
Srinivasan Venkatesh},
title = {The Quantum Complexity of Set Membership},
journal = {CoRR},
volume = {quant-ph/0007021},
year = {2000},
url = {http://arxiv.org/abs/quant-ph/0007021},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/quant-ph-0007021.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/PonzioRV99,
author = {Stephen Ponzio and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
title = {The Communication Complexity of Pointer Chasing Applications of Entropy
and Sampling (Abstract)},
booktitle = {Proceedings of the 14th Annual {IEEE} Conference on Computational
Complexity, Atlanta, Georgia, USA, May 4-6, 1999},
pages = {7},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/CCC.1999.766256},
doi = {10.1109/CCC.1999.766256},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/PonzioRV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/PonzioRV99,
author = {Stephen Ponzio and
Jaikumar Radhakrishnan and
Srinivasan Venkatesh},
editor = {Jeffrey Scott Vitter and
Lawrence L. Larmore and
Frank Thomson Leighton},
title = {The Communication Complexity of Pointer Chasing: Applications of Entropy
and Sampling},
booktitle = {Proceedings of the Thirty-First Annual {ACM} Symposium on Theory of
Computing, May 1-4, 1999, Atlanta, Georgia, {USA}},
pages = {602--611},
publisher = {{ACM}},
year = {1999},
url = {https://doi.org/10.1145/301250.301413},
doi = {10.1145/301250.301413},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/PonzioRV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/asian/MukundKRS98,
author = {Madhavan Mukund and
K. Narayan Kumar and
Jaikumar Radhakrishnan and
Milind A. Sohoni},
editor = {Jieh Hsiang and
Atsushi Ohori},
title = {Towards a Characterisation of Finite-State Message-Passing Systems},
booktitle = {Advances in Computing Science - {ASIAN} '98, 4th Asian Computing Science
Conference, Manila, The Philippines, December 8-10, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1538},
pages = {282--299},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-49366-2\_21},
doi = {10.1007/3-540-49366-2\_21},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/asian/MukundKRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RadhakrishnanS98,
author = {Jaikumar Radhakrishnan and
Aravind Srinivasan},
title = {Improved Bounds and Algorithms for Hypergraph Two-Coloring},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {684--693},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743519},
doi = {10.1109/SFCS.1998.743519},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RadhakrishnanS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/MukundKRS98,
author = {Madhavan Mukund and
K. Narayan Kumar and
Jaikumar Radhakrishnan and
Milind A. Sohoni},
editor = {Kim Guldstrand Larsen and
Sven Skyum and
Glynn Winskel},
title = {Robust Asynchronous Protocols Are Finite-State},
booktitle = {Automata, Languages and Programming, 25th International Colloquium,
ICALP'98, Aalborg, Denmark, July 13-17, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1443},
pages = {188--199},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055052},
doi = {10.1007/BFB0055052},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/MukundKRS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HalldorssonR97,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan},
title = {Greed is Good: Approximating Independent Sets in Sparse and Bounded-Degree
Graphs},
journal = {Algorithmica},
volume = {18},
number = {1},
pages = {145--163},
year = {1997},
url = {https://doi.org/10.1007/BF02523693},
doi = {10.1007/BF02523693},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HalldorssonR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ChaudhuriR97,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {The Complexity of Parallel Prefix Problems on Small Domains},
journal = {Inf. Comput.},
volume = {138},
number = {1},
pages = {1--22},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2654},
doi = {10.1006/INCO.1997.2654},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ChaudhuriR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Radhakrishnan97,
author = {Jaikumar Radhakrishnan},
title = {Better Lower Bounds for Monotone Threshold Formulas},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {2},
pages = {221--226},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1287},
doi = {10.1006/JCSS.1997.1287},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Radhakrishnan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Radhakrishnan97,
author = {Jaikumar Radhakrishnan},
title = {An Entropy Proof of Bregman's Theorem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {77},
number = {1},
pages = {161--164},
year = {1997},
url = {https://doi.org/10.1006/jcta.1996.2727},
doi = {10.1006/JCTA.1996.2727},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Radhakrishnan97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/RadhakrishnanT97,
author = {Jaikumar Radhakrishnan and
Amnon Ta{-}Shma},
title = {Tight Bounds for Depth-two Superconcentrators},
booktitle = {38th Annual Symposium on Foundations of Computer Science, {FOCS} '97,
Miami Beach, Florida, USA, October 19-22, 1997},
pages = {585--594},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/SFCS.1997.646148},
doi = {10.1109/SFCS.1997.646148},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/RadhakrishnanT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Radhakrishnan96,
author = {Jaikumar Radhakrishnan},
title = {Pi-Sigma-Pi Threshold Formulas},
journal = {Math. Syst. Theory},
volume = {29},
number = {4},
pages = {357--374},
year = {1996},
url = {https://doi.org/10.1007/bf01192692},
doi = {10.1007/BF01192692},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Radhakrishnan96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BrodalCR96,
author = {Gerth St{\o}lting Brodal and
Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {The Randomized Complexity of Maintaining the Minimum},
journal = {Nord. J. Comput.},
volume = {3},
number = {4},
pages = {337--351},
year = {1996},
timestamp = {Mon, 24 Jul 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/BrodalCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ChaudhuriR96,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
editor = {Gary L. Miller},
title = {Deterministic Restrictions in Circuit Complexity},
booktitle = {Proceedings of the Twenty-Eighth Annual {ACM} Symposium on the Theory
of Computing, Philadelphia, Pennsylvania, USA, May 22-24, 1996},
pages = {30--36},
publisher = {{ACM}},
year = {1996},
url = {https://doi.org/10.1145/237814.237824},
doi = {10.1145/237814.237824},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ChaudhuriR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BrodalCR96,
author = {Gerth St{\o}lting Brodal and
Shiva Chaudhuri and
Jaikumar Radhakrishnan},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {The Randomized Complexity of Maintaining the Minimum},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {4--15},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_116},
doi = {10.1007/3-540-61422-2\_116},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BrodalCR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-004,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {Deterministic Restrictions in Circuit Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-004}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-004/index.html},
eprinttype = {ECCC},
eprint = {TR96-004},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-004.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ieicet/NishinoR95,
author = {Tetsuro Nishino and
Jaikumar Radhakrishnan},
title = {On the Number of Negations Needed to Compute Parity Functions},
journal = {{IEICE} Trans. Inf. Syst.},
volume = {78-D},
number = {1},
pages = {90--91},
year = {1995},
url = {http://search.ieice.org/bin/summary.php?id=e78-d\_1\_90},
timestamp = {Sat, 11 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ieicet/NishinoR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Radhakrishnan94,
author = {Jaikumar Radhakrishnan},
title = {Sigma Pi Sigma Threshold Formulas},
journal = {Comb.},
volume = {14},
number = {3},
pages = {345--374},
year = {1994},
url = {https://doi.org/10.1007/BF01212982},
doi = {10.1007/BF01212982},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Radhakrishnan94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/RadhakrishnanS94,
author = {Jaikumar Radhakrishnan and
K. V. Subrahmanyam},
title = {Directed Monotone Contact Networks for Threshold Functions},
journal = {Inf. Process. Lett.},
volume = {50},
number = {4},
pages = {199--203},
year = {1994},
url = {https://doi.org/10.1016/0020-0190(94)00037-9},
doi = {10.1016/0020-0190(94)00037-9},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/RadhakrishnanS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/HalldorssonR94,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan},
title = {Improved Approximations of Independent Sets in Bounded-Degree Graphs
via Subgraph Removal},
journal = {Nord. J. Comput.},
volume = {1},
number = {4},
pages = {475--492},
year = {1994},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/HalldorssonR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HalldorssonR94,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Greed is good: approximating independent sets in sparse and bounded-degree
graphs},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {439--448},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195221},
doi = {10.1145/195058.195221},
timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HalldorssonR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HalldorssonR94,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan},
editor = {Erik Meineche Schmidt and
Sven Skyum},
title = {Improved Approximations of Independent Sets in Bounded-Degree Graphs},
booktitle = {Algorithm Theory - {SWAT} '94, 4th Scandinavian Workshop on Algorithm
Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {824},
pages = {195--206},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58218-5\_18},
doi = {10.1007/3-540-58218-5\_18},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HalldorssonR94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/HalldorssonRS93,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan and
K. V. Subrahmanyam},
title = {Directed vs. Undirected Monotone Contact Networks for Threshold Functions},
booktitle = {34th Annual Symposium on Foundations of Computer Science, Palo Alto,
California, USA, 3-5 November 1993},
pages = {604--613},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SFCS.1993.366826},
doi = {10.1109/SFCS.1993.366826},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/HalldorssonRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HalldorssonRS93,
author = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Jaikumar Radhakrishnan and
K. V. Subrahmanyam},
editor = {R. K. Shyamasundar},
title = {On Some Communication Complexity Problems Related to THreshold Functions},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
13th Conference, Bombay, India, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {761},
pages = {248--259},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57529-4\_58},
doi = {10.1007/3-540-57529-4\_58},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HalldorssonRS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Radhakrishnan92,
author = {Jaikumar Radhakrishnan},
title = {Improved Bounds for Covering Complete Uniform Hypergraphs},
journal = {Inf. Process. Lett.},
volume = {41},
number = {4},
pages = {203--207},
year = {1992},
url = {https://doi.org/10.1016/0020-0190(92)90181-T},
doi = {10.1016/0020-0190(92)90181-T},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Radhakrishnan92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChaudhuriR92,
author = {Shiva Chaudhuri and
Jaikumar Radhakrishnan},
title = {The Complexity of Parallel Prefix Problems on Small Domains},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {638--647},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267787},
doi = {10.1109/SFCS.1992.267787},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChaudhuriR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/Radhakrishnan91,
author = {Jaikumar Radhakrishnan},
title = {Better Bounds for Threshold Formulas},
booktitle = {32nd Annual Symposium on Foundations of Computer Science, San Juan,
Puerto Rico, 1-4 October 1991},
pages = {314--323},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/SFCS.1991.185384},
doi = {10.1109/SFCS.1991.185384},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/Radhakrishnan91.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 2023-11-13 23:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
