Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Manindra Agrawal
@inproceedings{DBLP:conf/cdc/AgrawalKV21,
author = {Manindra Agrawal and
Madhuri Kanitkar and
Mathukumalli Vidyasagar},
title = {{SUTRA:} An Approach to Modelling Pandemics with Undetected (Asymptomatic)
Patients, and Applications to {COVID-19}},
booktitle = {2021 60th {IEEE} Conference on Decision and Control (CDC), Austin,
TX, USA, December 14-17, 2021},
pages = {3531},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/CDC45484.2021.9683063},
doi = {10.1109/CDC45484.2021.9683063},
timestamp = {Tue, 17 May 2022 15:53:17 +0200},
biburl = {https://dblp.org/rec/conf/cdc/AgrawalKV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGT20,
author = {Manindra Agrawal and
Rohit Gurjar and
Thomas Thierauf},
title = {Impossibility of Derandomizing the Isolation Lemma for all Families},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-098}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/098},
eprinttype = {ECCC},
eprint = {TR20-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/AfshaniADDLM19,
author = {Peyman Afshani and
Manindra Agrawal and
Benjamin Doerr and
Carola Doerr and
Kasper Green Larsen and
Kurt Mehlhorn},
title = {The query complexity of a permutation-based variant of Mastermind},
journal = {Discret. Appl. Math.},
volume = {260},
pages = {28--50},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.01.007},
doi = {10.1016/J.DAM.2019.01.007},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/AfshaniADDLM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aaecc/AonoASW18,
author = {Yoshinori Aono and
Manindra Agrawal and
Takakazu Satoh and
Osamu Watanabe},
title = {On the optimality of lattices for the coppersmith technique},
journal = {Appl. Algebra Eng. Commun. Comput.},
volume = {29},
number = {2},
pages = {169--195},
year = {2018},
url = {https://doi.org/10.1007/s00200-017-0336-9},
doi = {10.1007/S00200-017-0336-9},
timestamp = {Fri, 02 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aaecc/AonoASW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalG018,
author = {Manindra Agrawal and
Sumanta Ghosh and
Nitin Saxena},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Bootstrapping variables in algebraic circuits},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {1166--1179},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188762},
doi = {10.1145/3188745.3188762},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalG018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-08480,
author = {Peyman Afshani and
Manindra Agrawal and
Benjamin Doerr and
Carola Doerr and
Kasper Green Larsen and
Kurt Mehlhorn},
title = {The Query Complexity of a Permutation-Based Variant of Mastermind},
journal = {CoRR},
volume = {abs/1812.08480},
year = {2018},
url = {http://arxiv.org/abs/1812.08480},
eprinttype = {arXiv},
eprint = {1812.08480},
timestamp = {Wed, 02 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-08480.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGS18,
author = {Manindra Agrawal and
Sumanta Ghosh and
Nitin Saxena},
title = {Bootstrapping variables in algebraic circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-035}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/035},
eprinttype = {ECCC},
eprint = {TR18-035},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/computability/AgrawalCDN17,
author = {Manindra Agrawal and
Diptarka Chakraborty and
Debarati Das and
Satyadev Nandakumar},
title = {Dimension, pseudorandomness and extraction of pseudorandomness},
journal = {Comput.},
volume = {6},
number = {3},
pages = {277--305},
year = {2017},
url = {https://doi.org/10.3233/COM-160066},
doi = {10.3233/COM-160066},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/computability/AgrawalCDN17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgrawalFGS17,
author = {Manindra Agrawal and
Michael A. Forbes and
Sumanta Ghosh and
Nitin Saxena},
title = {Small hitting-sets for tiny arithmetic circuits or: How to turn bad
designs into good},
journal = {CoRR},
volume = {abs/1702.07180},
year = {2017},
url = {http://arxiv.org/abs/1702.07180},
eprinttype = {arXiv},
eprint = {1702.07180},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AgrawalFGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalFGS17,
author = {Manindra Agrawal and
Michael A. Forbes and
Sumanta Ghosh and
Nitin Saxena},
title = {Small hitting-sets for tiny arithmetic circuits or: How to turn bad
designs into good},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-035}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/035},
eprinttype = {ECCC},
eprint = {TR17-035},
timestamp = {Wed, 31 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalFGS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgrawalSSS16,
author = {Manindra Agrawal and
Chandan Saha and
Ramprasad Saptharishi and
Nitin Saxena},
title = {Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k
Formulas and Depth-3 Transcendence Degree-k Circuits},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {4},
pages = {1533--1562},
year = {2016},
url = {https://doi.org/10.1137/130910725},
doi = {10.1137/130910725},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgrawalSSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/AgrawalSS16,
author = {Manindra Agrawal and
Nitin Saxena and
Shubham Sahai Srivastava},
editor = {Piotr Faliszewski and
Anca Muscholl and
Rolf Niedermeier},
title = {Integer Factoring Using Small Algebraic Dependencies},
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 = {6:1--6:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.6},
doi = {10.4230/LIPICS.MFCS.2016.6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/AgrawalSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgrawalAGT15,
author = {Manindra Agrawal and
S. Akshay and
Blaise Genest and
P. S. Thiagarajan},
title = {Approximate Verification of the Symbolic Dynamics of Markov Chains},
journal = {J. {ACM}},
volume = {62},
number = {1},
pages = {2:1--2:34},
year = {2015},
url = {https://doi.org/10.1145/2629417},
doi = {10.1145/2629417},
timestamp = {Tue, 30 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AgrawalAGT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgrawalGKS15,
author = {Manindra Agrawal and
Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
title = {Hitting-Sets for {ROABP} and Sum of Set-Multilinear Circuits},
journal = {{SIAM} J. Comput.},
volume = {44},
number = {3},
pages = {669--697},
year = {2015},
url = {https://doi.org/10.1137/140975103},
doi = {10.1137/140975103},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgrawalGKS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalCDN15,
author = {Manindra Agrawal and
Diptarka Chakraborty and
Debarati Das and
Satyadev Nandakumar},
editor = {Prahladh Harsha and
G. Ramalingam},
title = {Dimension, Pseudorandomness and Extraction of Pseudorandomness},
booktitle = {35th {IARCS} Annual Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2015, December 16-18, 2015,
Bangalore, India},
series = {LIPIcs},
volume = {45},
pages = {221--235},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2015.221},
doi = {10.4230/LIPICS.FSTTCS.2015.221},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalCDN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BarmpaliasAC14,
author = {George Barmpalias and
Manindra Agrawal and
S. Barry Cooper},
title = {Theory and Applications of Models of Computation at the Turing Centenary
in China},
journal = {Theor. Comput. Sci.},
volume = {560},
pages = {107},
year = {2014},
url = {https://doi.org/10.1016/j.tcs.2014.11.020},
doi = {10.1016/J.TCS.2014.11.020},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BarmpaliasAC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/GopalALC14,
author = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {A Roadmap for {TAMC}},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {1--6},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_1},
doi = {10.1007/978-3-319-06089-7\_1},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/GopalALC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2014,
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7},
doi = {10.1007/978-3-319-06089-7},
isbn = {978-3-319-06088-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgrawalGKS14,
author = {Manindra Agrawal and
Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
title = {Hitting-sets for {ROABP} and Sum of Set-Multilinear circuits},
journal = {CoRR},
volume = {abs/1406.7535},
year = {2014},
url = {http://arxiv.org/abs/1406.7535},
eprinttype = {arXiv},
eprint = {1406.7535},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AgrawalGKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AgrawalKTU14,
author = {Manindra Agrawal and
Valentine Kabanets and
Thomas Thierauf and
Christopher Umans},
title = {Algebra in Computational Complexity (Dagstuhl Seminar 14391)},
journal = {Dagstuhl Reports},
volume = {4},
number = {9},
pages = {85--105},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.9.85},
doi = {10.4230/DAGREP.4.9.85},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalKTU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalCDN14,
author = {Manindra Agrawal and
Diptarka Chakraborty and
Debarati Das and
Satyadev Nandakumar},
title = {Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-057}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/057},
eprinttype = {ECCC},
eprint = {TR14-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalCDN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGKS14,
author = {Manindra Agrawal and
Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
title = {Hitting-sets for {ROABP} and Sum of Set-Multilinear circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-085}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/085},
eprinttype = {ECCC},
eprint = {TR14-085},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/AfshaniADDLM13,
author = {Peyman Afshani and
Manindra Agrawal and
Benjamin Doerr and
Carola Doerr and
Kasper Green Larsen and
Kurt Mehlhorn},
editor = {Andrej Brodnik and
Alejandro L{\'{o}}pez{-}Ortiz and
Venkatesh Raman and
Alfredo Viola},
title = {The Query Complexity of Finding a Hidden Permutation},
booktitle = {Space-Efficient Data Structures, Streams, and Algorithms - Papers
in Honor of J. Ian Munro on the Occasion of His 66th Birthday},
series = {Lecture Notes in Computer Science},
volume = {8066},
pages = {1--11},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40273-9\_1},
doi = {10.1007/978-3-642-40273-9\_1},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/birthday/AfshaniADDLM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalSS13,
author = {Manindra Agrawal and
Chandan Saha and
Nitin Saxena},
editor = {Dan Boneh and
Tim Roughgarden and
Joan Feigenbaum},
title = {Quasi-polynomial hitting-set for set-depth-{\(\Delta\)} formulas},
booktitle = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
USA, June 1-4, 2013},
pages = {321--330},
publisher = {{ACM}},
year = {2013},
url = {https://doi.org/10.1145/2488608.2488649},
doi = {10.1145/2488608.2488649},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AgrawalGKS13,
author = {Manindra Agrawal and
Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
title = {Hitting-sets for low-distance multilinear depth-3},
journal = {CoRR},
volume = {abs/1312.1826},
year = {2013},
url = {http://arxiv.org/abs/1312.1826},
eprinttype = {arXiv},
eprint = {1312.1826},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AgrawalGKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGKS13,
author = {Manindra Agrawal and
Rohit Gurjar and
Arpita Korwar and
Nitin Saxena},
title = {Hitting-sets for low-distance multilinear depth-3},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-174}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/174},
eprinttype = {ECCC},
eprint = {TR13-174},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGKS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acisp/AonoASW12,
author = {Yoshinori Aono and
Manindra Agrawal and
Takakazu Satoh and
Osamu Watanabe},
editor = {Willy Susilo and
Yi Mu and
Jennifer Seberry},
title = {On the Optimality of Lattices for the Coppersmith Technique},
booktitle = {Information Security and Privacy - 17th Australasian Conference, {ACISP}
2012, Wollongong, NSW, Australia, July 9-11, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7372},
pages = {376--389},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31448-3\_28},
doi = {10.1007/978-3-642-31448-3\_28},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/acisp/AonoASW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AgrawalAGT12,
author = {Manindra Agrawal and
S. Akshay and
Blaise Genest and
P. S. Thiagarajan},
title = {Approximate Verification of the Symbolic Dynamics of Markov Chains},
booktitle = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012},
pages = {55--64},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/LICS.2012.17},
doi = {10.1109/LICS.2012.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AgrawalAGT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalSSS12,
author = {Manindra Agrawal and
Chandan Saha and
Ramprasad Saptharishi and
Nitin Saxena},
editor = {Howard J. Karloff and
Toniann Pitassi},
title = {Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k
formulas {\&} depth-3 transcendence degree-k circuits},
booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference,
{STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
pages = {599--614},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2213977.2214033},
doi = {10.1145/2213977.2214033},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalSSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/ws/automata2012/AgrawalSTY12,
author = {Manindra Agrawal and
Frank Stephan and
P. S. Thiagarajan and
Shaofa Yang},
editor = {Deepak D'Souza and
Priti Shankar},
title = {The Discrete Time Behaviour of Restricted Linear Hybrid Automata},
booktitle = {Modern Applications of Automata Theory},
series = {IISc Research Monographs Series},
volume = {2},
pages = {437--456},
publisher = {World Scientific},
year = {2012},
url = {https://doi.org/10.1142/9789814271059\_0014},
doi = {10.1142/9789814271059\_0014},
timestamp = {Sat, 03 Aug 2019 22:52:51 +0200},
biburl = {https://dblp.org/rec/books/ws/automata2012/AgrawalSTY12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2012,
editor = {Manindra Agrawal and
S. Barry Cooper and
Angsheng Li},
title = {Theory and Applications of Models of Computation - 9th Annual Conference,
{TAMC} 2012, Beijing, China, May 16-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7287},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29952-0},
doi = {10.1007/978-3-642-29952-0},
isbn = {978-3-642-29951-3},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/2012.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1209-2333,
author = {Manindra Agrawal and
Chandan Saha and
Nitin Saxena},
title = {Quasi-polynomial Hitting-set for Set-depth-Delta Formulas},
journal = {CoRR},
volume = {abs/1209.2333},
year = {2012},
url = {http://arxiv.org/abs/1209.2333},
eprinttype = {arXiv},
eprint = {1209.2333},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1209-2333.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AgrawalTU12,
author = {Manindra Agrawal and
Thomas Thierauf and
Christopher Umans},
title = {Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl
Seminar 12421)},
journal = {Dagstuhl Reports},
volume = {2},
number = {10},
pages = {60--78},
year = {2012},
url = {https://doi.org/10.4230/DagRep.2.10.60},
doi = {10.4230/DAGREP.2.10.60},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalTU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AfshaniADCLM12,
author = {Peyman Afshani and
Manindra Agrawal and
Benjamin Doerr and
Carola Winzen and
Kasper Green Larsen and
Kurt Mehlhorn},
title = {The Deterministic and Randomized Query Complexity of a Simple Guessing
Game},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-087}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/087},
eprinttype = {ECCC},
eprint = {TR12-087},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AfshaniADCLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalSS12,
author = {Manindra Agrawal and
Chandan Saha and
Nitin Saxena},
title = {Quasi-polynomial Hitting-set for Set-depth-{\textdollar}{\textbackslash}Delta{\textdollar}
Formulas},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-113}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/113},
eprinttype = {ECCC},
eprint = {TR12-113},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalSS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iacr/AonoASW12,
author = {Yoshinori Aono and
Manindra Agrawal and
Takakazu Satoh and
Osamu Watanabe},
title = {On the Optimality of Lattices for the Coppersmith Technique},
journal = {{IACR} Cryptol. ePrint Arch.},
pages = {108},
year = {2012},
url = {http://eprint.iacr.org/2012/108},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iacr/AonoASW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Agrawal11,
author = {Manindra Agrawal},
title = {The isomorphism conjecture for constant depth reductions},
journal = {J. Comput. Syst. Sci.},
volume = {77},
number = {1},
pages = {3--13},
year = {2011},
url = {https://doi.org/10.1016/j.jcss.2010.06.003},
doi = {10.1016/J.JCSS.2010.06.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Agrawal11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalL11,
author = {Manindra Agrawal and
Angsheng Li},
title = {Theory and applications of models of computation {(TAMC} 2008)},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {18},
pages = {1645},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.12.039},
doi = {10.1016/J.TCS.2010.12.039},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Agrawal11,
author = {Manindra Agrawal},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {On the Arithmetic Complexity of Euler Function},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {43--49},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_4},
doi = {10.1007/978-3-642-20712-9\_4},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/Agrawal11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1111-0582,
author = {Manindra Agrawal and
Chandan Saha and
Ramprasad Saptharishi and
Nitin Saxena},
title = {Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k
formulas {\&} depth-3 transcendence degree-k circuits},
journal = {CoRR},
volume = {abs/1111.0582},
year = {2011},
url = {http://arxiv.org/abs/1111.0582},
eprinttype = {arXiv},
eprint = {1111.0582},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1111-0582.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalSSS11,
author = {Manindra Agrawal and
Chandan Saha and
Ramprasad Saptharishi and
Nitin Saxena},
title = {Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k
formulas {\&} depth-3 transcendence degree-k circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-143}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/143},
eprinttype = {ECCC},
eprint = {TR11-143},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalSSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mscs/AgrawalCL10,
author = {Manindra Agrawal and
S. Barry Cooper and
Angsheng Li},
title = {Preface to Special Issue: Theory and Applications of Models of Computation
{(TAMC} 2008-2009)},
journal = {Math. Struct. Comput. Sci.},
volume = {20},
number = {5},
pages = {705--706},
year = {2010},
url = {https://doi.org/10.1017/S0960129510000277},
doi = {10.1017/S0960129510000277},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mscs/AgrawalCL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalW09,
author = {Manindra Agrawal and
Osamu Watanabe},
title = {One-Way Functions and the Berman-Hartmanis Conjecture},
booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
pages = {194--202},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.17},
doi = {10.1109/CCC.2009.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9421,
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/portals/09421/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09,
author = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {09421 Abstracts Collection - Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2418/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalFTU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09a,
author = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {09421 Executive Summary - Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2410/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalFTU09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalW09,
author = {Manindra Agrawal and
Osamu Watanabe},
title = {One-Way Functions and the Isomorphism Conjecture},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-019}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/019},
eprinttype = {ECCC},
eprint = {TR09-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgrawalV08,
author = {Manindra Agrawal and
V. Vinay},
title = {Arithmetic Circuits: {A} Chasm at Depth Four},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {67--75},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.32},
doi = {10.1109/FOCS.2008.32},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgrawalV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7411,
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2008},
url = {http://drops.dagstuhl.de/portals/07411/},
timestamp = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7411.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tamc/2008,
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4},
doi = {10.1007/978-3-540-79228-4},
isbn = {978-3-540-79227-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/2008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalV08,
author = {Manindra Agrawal and
V. Vinay},
title = {Arithmetic Circuits: {A} Chasm at Depth Four},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-062}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-062/index.html},
eprinttype = {ECCC},
eprint = {TR08-062},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AgrawalHT07,
author = {Manindra Agrawal and
Thanh Minh Hoang and
Thomas Thierauf},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {The Polynomially Bounded Perfect Matching Problem Is in {NC} \({}^{\mbox{2}}\)},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {489--499},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_42},
doi = {10.1007/978-3-540-70918-3\_42},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AgrawalHT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07,
author = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {07411 Executive Summary -- Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1306},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalBFT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07a,
author = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
title = {07411 Abstracts Collection -- Algebraic Methods in Computational Complexity},
booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1307},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalBFT07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hybrid/AgrawalSTY06,
author = {Manindra Agrawal and
Frank Stephan and
P. S. Thiagarajan and
Shaofa Yang},
editor = {Jo{\~{a}}o P. Hespanha and
Ashish Tiwari},
title = {Behavioural Approximations for Restricted Linear Differential Hybrid
Automata},
booktitle = {Hybrid Systems: Computation and Control, 9th International Workshop,
{HSCC} 2006, Santa Barbara, CA, USA, March 29-31, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3927},
pages = {4--18},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11730637\_4},
doi = {10.1007/11730637\_4},
timestamp = {Wed, 30 Aug 2023 16:03:58 +0200},
biburl = {https://dblp.org/rec/conf/hybrid/AgrawalSTY06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdcn/Agrawal06,
author = {Manindra Agrawal},
editor = {Soma Chaudhuri and
Samir R. Das and
Himadri S. Paul and
Srikanta Tirthapura},
title = {Primality Tests Based on Fermat's Little Theorem},
booktitle = {Distributed Computing and Networking, 8th International Conference,
{ICDCN} 2006, Guwahati, India, December 27-30, 2006},
series = {Lecture Notes in Computer Science},
volume = {4308},
pages = {288--293},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11947950\_32},
doi = {10.1007/11947950\_32},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/icdcn/Agrawal06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AgrawalS06,
author = {Manindra Agrawal and
Nitin Saxena},
editor = {Bruno Durand and
Wolfgang Thomas},
title = {Equivalence of F-Algebras and Cubic Forms},
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 = {115--126},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11672142\_8},
doi = {10.1007/11672142\_8},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AgrawalS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalHT06,
author = {Manindra Agrawal and
Thanh Minh Hoang and
Thomas Thierauf},
title = {The polynomially bounded perfect matching problem is in NC{\^{}}2},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-129}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-129/index.html},
eprinttype = {ECCC},
eprint = {TR06-129},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalHT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Agrawal05,
author = {Manindra Agrawal},
editor = {Ramaswamy Ramanujam and
Sandeep Sen},
title = {Proving Lower Bounds Via Pseudo-random Generators},
booktitle = {{FSTTCS} 2005: Foundations of Software Technology and Theoretical
Computer Science, 25th International Conference, Hyderabad, India,
December 15-18, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3821},
pages = {92--105},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11590156\_6},
doi = {10.1007/11590156\_6},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Agrawal05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hybrid/AgrawalT05,
author = {Manindra Agrawal and
P. S. Thiagarajan},
editor = {Manfred Morari and
Lothar Thiele},
title = {The Discrete Time Behavior of Lazy Linear Hybrid Automata},
booktitle = {Hybrid Systems: Computation and Control, 8th International Workshop,
{HSCC} 2005, Zurich, Switzerland, March 9-11, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3414},
pages = {55--69},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31954-2\_4},
doi = {10.1007/978-3-540-31954-2\_4},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/hybrid/AgrawalT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AgrawalS05,
author = {Manindra Agrawal and
Nitin Saxena},
editor = {Volker Diekert and
Bruno Durand},
title = {Automorphisms of Finite Rings and Applications to Complexity of Problems},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {1--17},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_1},
doi = {10.1007/978-3-540-31856-9\_1},
timestamp = {Wed, 19 May 2021 12:05:43 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AgrawalS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/hybrid/AgrawalT04,
author = {Manindra Agrawal and
P. S. Thiagarajan},
editor = {Rajeev Alur and
George J. Pappas},
title = {Lazy Rectangular Hybrid Automata},
booktitle = {Hybrid Systems: Computation and Control, 7th International Workshop,
{HSCC} 2004, Philadelphia, PA, USA, March 25-27, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2993},
pages = {1--15},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24743-2\_1},
doi = {10.1007/978-3-540-24743-2\_1},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/hybrid/AgrawalT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AgrawalB03,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Primality and identity testing via Chinese remaindering},
journal = {J. {ACM}},
volume = {50},
number = {4},
pages = {429--443},
year = {2003},
url = {https://doi.org/10.1145/792538.792540},
doi = {10.1145/792538.792540},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AgrawalB03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal03,
author = {Manindra Agrawal},
title = {On Derandomizing Tests for Certain Polynomial Identities},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {355},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214434},
doi = {10.1109/CCC.2003.1214434},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Agrawal02,
author = {Manindra Agrawal},
title = {For completeness, sublogarithmic space is no space},
journal = {Inf. Process. Lett.},
volume = {82},
number = {6},
pages = {321--325},
year = {2002},
url = {https://doi.org/10.1016/S0020-0190(01)00296-4},
doi = {10.1016/S0020-0190(01)00296-4},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Agrawal02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal02,
author = {Manindra Agrawal},
title = {Pseudo-Random Generators and Structure of Complete Degrees},
booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational
Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24,
2002},
pages = {139--147},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/CCC.2002.1004349},
doi = {10.1109/CCC.2002.1004349},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2002,
editor = {Manindra Agrawal and
Anil Seth},
title = {{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},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36206-1},
doi = {10.1007/3-540-36206-1},
isbn = {3-540-00225-1},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/2002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/AgrawalAIPR01,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
title = {Reducing the complexity of reductions},
journal = {Comput. Complex.},
volume = {10},
number = {2},
pages = {117--138},
year = {2001},
url = {https://doi.org/10.1007/s00037-001-8191-1},
doi = {10.1007/S00037-001-8191-1},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/AgrawalAIPR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal01,
author = {Manindra Agrawal},
title = {Towards Uniform AC\({}^{\mbox{0}}\) - Isomorphisms},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {13--20},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933866},
doi = {10.1109/CCC.2001.933866},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Agrawal01,
author = {Manindra Agrawal},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {Hard Sets and Pseudo-random Generators for Constant Depth Circuits},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {58--69},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_6},
doi = {10.1007/3-540-45294-X\_6},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Agrawal01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Agrawal01a,
author = {Manindra Agrawal},
editor = {Ramesh Hariharan and
Madhavan Mukund and
V. Vinay},
title = {The First-Order Isomorphism Theorem},
booktitle = {{FST} {TCS} 2001: Foundations of Software Technology and Theoretical
Computer Science, 21st Conference, Bangalore, India, December 13-15,
2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2245},
pages = {70--82},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45294-X\_7},
doi = {10.1007/3-540-45294-X\_7},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Agrawal01a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/AgrawalADVW00,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta and
Heribert Vollmer and
Klaus W. Wagner},
title = {Characterizing Small Depth and Small Space Classes by Operators of
Higher Type},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {2000},
year = {2000},
url = {http://cjtcs.cs.uchicago.edu/articles/2000/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/AgrawalADVW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AgrawalAD00,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
journal = {J. Comput. Syst. Sci.},
volume = {60},
number = {2},
pages = {395--421},
year = {2000},
url = {https://doi.org/10.1006/jcss.1999.1675},
doi = {10.1006/JCSS.1999.1675},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/AgrawalAD00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AgrawalT00,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Formula Isomorphism Problem},
journal = {{SIAM} J. Comput.},
volume = {30},
number = {3},
pages = {990--1009},
year = {2000},
url = {https://doi.org/10.1137/S0097539798343647},
doi = {10.1137/S0097539798343647},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AgrawalT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgrawalB99,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Primality and Identity Testing via Chinese Remaindering},
booktitle = {40th Annual Symposium on Foundations of Computer Science, {FOCS} '99,
17-18 October, 1999, New York, NY, {USA}},
pages = {202--209},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/SFFCS.1999.814592},
doi = {10.1109/SFFCS.1999.814592},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgrawalB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR99-018,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Reducing Randomness via Chinese Remaindering},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR99-018}},
year = {1999},
url = {https://eccc.weizmann.ac.il/eccc-reports/1999/TR99-018/index.html},
eprinttype = {ECCC},
eprint = {TR99-018},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR99-018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AgrawalAR98,
author = {Manindra Agrawal and
Eric Allender and
Steven Rudich},
title = {Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap
Theorem},
journal = {J. Comput. Syst. Sci.},
volume = {57},
number = {2},
pages = {127--143},
year = {1998},
url = {https://doi.org/10.1006/jcss.1998.1583},
doi = {10.1006/JCSS.1998.1583},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AgrawalAR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalT98,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
Complexity, Buffalo, New York, USA, June 15-18, 1998},
pages = {81},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694593},
doi = {10.1109/CCC.1998.694593},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR98-057,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta and
Heribert Vollmer and
Klaus W. Wagner},
title = {Characterizing Small Depth and Small Space Classes by Operators of
Higher Types},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR98-057}},
year = {1998},
url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-057/index.html},
eprinttype = {ECCC},
eprint = {TR98-057},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-057.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Agrawal97,
author = {Manindra Agrawal},
title = {DSPACE(n) = NSPACE(n): {A} Degree Theoretic Characterization},
journal = {J. Comput. Syst. Sci.},
volume = {54},
number = {3},
pages = {383--392},
year = {1997},
url = {https://doi.org/10.1006/jcss.1997.1483},
doi = {10.1006/JCSS.1997.1483},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Agrawal97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalAD97,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
booktitle = {Proceedings of the Twelfth Annual {IEEE} Conference on Computational
Complexity, Ulm, Germany, June 24-27, 1997},
pages = {134--148},
publisher = {{IEEE} Computer Society},
year = {1997},
url = {https://doi.org/10.1109/CCC.1997.612309},
doi = {10.1109/CCC.1997.612309},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalAD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AgrawalAIPR97,
author = {Manindra Agrawal and
Eric Allender and
Russell Impagliazzo and
Toniann Pitassi and
Steven Rudich},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {Reducing the Complexity of Reductions},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {730--738},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258671},
doi = {10.1145/258533.258671},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/AgrawalAIPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-016,
author = {Manindra Agrawal and
Eric Allender and
Samir Datta},
title = {On TC\({}^{\mbox{0}}\), AC\({}^{\mbox{0}}\), and Arithmetic Circuits},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-016}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-016/index.html},
eprinttype = {ECCC},
eprint = {TR97-016},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-060,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-060}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-060/index.html},
eprinttype = {ECCC},
eprint = {TR97-060},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-060.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AgrawalA96,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {A Note on Decision versus Search for Graph Automorphism},
journal = {Inf. Comput.},
volume = {131},
number = {2},
pages = {179--189},
year = {1996},
url = {https://doi.org/10.1006/inco.1996.0097},
doi = {10.1006/INCO.1996.0097},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AgrawalA96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/AgrawalV96,
author = {Manindra Agrawal and
Srinivasan Venkatesh},
title = {On the Isomorphism Conjecture for 2-DFA Reductions},
journal = {Int. J. Found. Comput. Sci.},
volume = {7},
number = {4},
pages = {339--352},
year = {1996},
url = {https://doi.org/10.1142/S0129054196000245},
doi = {10.1142/S0129054196000245},
timestamp = {Thu, 21 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/AgrawalV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AgrawalB96,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Polynomial-Time Isomorphism of 1-L-Complete Sets},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {155--160},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0057},
doi = {10.1006/JCSS.1996.0057},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AgrawalB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Agrawal96,
author = {Manindra Agrawal},
title = {On the Isomorphism Conjecture for Weak Reducibilities},
journal = {J. Comput. Syst. Sci.},
volume = {53},
number = {2},
pages = {267--282},
year = {1996},
url = {https://doi.org/10.1006/jcss.1996.0068},
doi = {10.1006/JCSS.1996.0068},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/Agrawal96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AgrawalB96,
author = {Manindra Agrawal and
Somenath Biswas},
title = {NP-Creative Sets: {A} New Class of Creative Sets in {NP}},
journal = {Math. Syst. Theory},
volume = {29},
number = {5},
pages = {487--505},
year = {1996},
url = {https://doi.org/10.1007/BF01184812},
doi = {10.1007/BF01184812},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AgrawalB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalA96,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Geometric Sets of Low Information Content},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {193--219},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00073-9},
doi = {10.1016/0304-3975(95)00073-9},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalA96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AgrawalA96a,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Quasi-Linear Truth-Table Reductions to p-Selective Sets},
journal = {Theor. Comput. Sci.},
volume = {158},
number = {1{\&}2},
pages = {361--370},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00167-0},
doi = {10.1016/0304-3975(95)00167-0},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AgrawalA96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA96,
author = {Manindra Agrawal and
Eric Allender},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {An Isomorphism Theorem for Circuit Complexity},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {2--11},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507663},
doi = {10.1109/CCC.1996.507663},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA96a,
author = {Manindra Agrawal and
Vikraman Arvind},
editor = {Steven Homer and
Jin{-}Yi Cai},
title = {A Note on Decision versus Search for Graph Automorphism},
booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
pages = {272--277},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507689},
doi = {10.1109/CCC.1996.507689},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgrawalT96,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Boolean Isomorphism Problem},
booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
Burlington, Vermont, USA, 14-16 October, 1996},
pages = {422--430},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548501},
doi = {10.1109/SFCS.1996.548501},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgrawalT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalBT96,
author = {Manindra Agrawal and
Richard Beigel and
Thomas Thierauf},
editor = {Vijay Chandru and
V. Vinay},
title = {Pinpointing Computation with Modular Queries in the Boolean Hierarchy},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1180},
pages = {322--334},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62034-6\_60},
doi = {10.1007/3-540-62034-6\_60},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalBT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-001,
author = {Manindra Agrawal and
Richard Beigel and
Thomas Thierauf},
title = {Modulo Information from Nonadaptive Queries to {NP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-001}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-001/index.html},
eprinttype = {ECCC},
eprint = {TR96-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-002,
author = {Manindra Agrawal and
Eric Allender},
title = {An Isomorphism Theorem for Circuit Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-002}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-002/index.html},
eprinttype = {ECCC},
eprint = {TR96-002},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-002.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-032,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Boolean Isomorphism Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-032}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-032/index.html},
eprinttype = {ECCC},
eprint = {TR96-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA95,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit
Classes, and Sparse Sets},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {264--276},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514865},
doi = {10.1109/SCT.1995.514865},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal95,
author = {Manindra Agrawal},
title = {DSPACE(n)=\({}^{\mbox{?}}\)NSPACE(n): {A} Degree Theoretic Characterization},
booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
Minneapolis, Minnesota, USA, June 19-22, 1995},
pages = {315--323},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514869},
doi = {10.1109/SCT.1995.514869},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalA94,
author = {Manindra Agrawal and
Vikraman Arvind},
title = {Polynomial Time Truth-Table Reductions to P-Selective Sets},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {24--30},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315821},
doi = {10.1109/SCT.1994.315821},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalA94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Agrawal94,
author = {Manindra Agrawal},
title = {On the Isomorphism Problem for Weak Reducibilities},
booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
Amsterdam, The Netherlands, June 28 - July 1, 1994},
pages = {338--355},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315790},
doi = {10.1109/SCT.1994.315790},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Agrawal94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalB93,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Polynomial Isomorphism of 1-L-Complete Sets},
booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
San Diego, CA, USA, May 18-21, 1993},
pages = {75--80},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336539},
doi = {10.1109/SCT.1993.336539},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalB93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalB92,
author = {Manindra Agrawal and
Somenath Biswas},
title = {Universal Relations},
booktitle = {Proceedings of the Seventh Annual Structure in Complexity Theory Conference,
Boston, Massachusetts, USA, June 22-25, 1992},
pages = {207--220},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SCT.1992.215395},
doi = {10.1109/SCT.1992.215395},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Agrawal91,
author = {Manindra Agrawal},
editor = {Somenath Biswas and
Kesav V. Nori},
title = {NP-hard Sets and Creativeness over Constant Time Languages},
booktitle = {Foundations of Software Technology and Theoretical Computer Science,
11th Conference, New Delhi, India, December 17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {560},
pages = {224--241},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54967-6\_71},
doi = {10.1007/3-540-54967-6\_71},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Agrawal91.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-21 17:24 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:
