Manindra Agrawal - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

The isomorphism conjecture for constant depth reductionsManindra Agrawal. jcss, 77(1):3-13, 2011. [doi]

Theory and applications of models of computation (TAMC 2008)Manindra Agrawal, Angsheng Li. TCS, 412(18):1645, 2011. [doi]

On the Arithmetic Complexity of Euler FunctionManindra Agrawal. csr 2011: 43-49 [doi]

2010

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009)Manindra Agrawal, S. Barry Cooper, Angsheng Li. mscs, 20(5):705-706, 2010. [doi]

2009

One-Way Functions and the Berman-Hartmanis ConjectureManindra Agrawal, Osamu Watanabe. coco 2009: 194-202 [doi]

One-Way Functions and the Isomorphism ConjectureManindra Agrawal, Osamu Watanabe. eccc, 16:19, 2009. [doi]

2008

Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi an, China, April 25-29, 2008. ProceedingsManindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li, editors, Volume 4978 of Lecture Notes in Computer Science, Springer, 2008.

Arithmetic Circuits: A Chasm at Depth FourManindra Agrawal, V. Vinay. focs 2008: 67-75 [doi]

Arithmetic Circuits: A Chasm at Depth FourManindra Agrawal, V. Vinay. eccc, 15(062), 2008. [doi]

Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf, editors, Volume 07411 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008.

2007

2006

2005

Automorphisms of Finite Rings and Applications to Complexity of ProblemsManindra Agrawal, Nitin Saxena. STACS 2005: 1-17 [doi]

Proving Lower Bounds Via Pseudo-random GeneratorsManindra Agrawal. fsttcs 2005: 92-105 [doi]

The Discrete Time Behavior of Lazy Linear Hybrid AutomataManindra Agrawal, P. S. Thiagarajan. hybrid 2005: 55-69 [doi]

2004

Lazy Rectangular Hybrid AutomataManindra Agrawal, P. S. Thiagarajan. hybrid 2004: 1-15 [doi]

2003

Primality and identity testing via Chinese remainderingManindra Agrawal, Somenath Biswas. JACM, 50(4):429-443, 2003. [doi]

On Derandomizing Tests for Certain Polynomial IdentitiesManindra Agrawal. cocoon 2003: 355 [doi]

2002

For completeness, sublogarithmic space is no spaceManindra Agrawal. ipl, 82(6):321-325, 2002. [doi]

Pseudo-Random Generators and Structure of Complete DegreesManindra Agrawal. cocoon 2002: 139-147 [doi]

FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, ProceedingsManindra Agrawal, Anil Seth, editors, Volume 2556 of Lecture Notes in Computer Science, Springer, 2002.

2001

2000

On TC:::0:::, AC:::0:::, and Arithmetic CircuitsManindra Agrawal, Eric Allender, Samir Datta. jcss, 60(2):395-421, 2000.

Characterizing Small Depth and Small Space Classes by Operators of Higher TypeManindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. cjtcs, 2000, 2000. [doi]

The Formula Isomorphism ProblemManindra Agrawal, Thomas Thierauf. siamcomp, 30(3):990-1009, 2000. [doi]

1999

Reducing Randomness via Chinese RemainderingManindra Agrawal. eccc, 6(18), 1999. [doi]

Primality and Identity Testing via Chinese RemainderingManindra Agrawal, Somenath Biswas. focs 1999: 202-209 [doi]

1998

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap TheoremManindra Agrawal, Eric Allender, Steven Rudich. jcss, 57(2):127-143, 1998.

Characterizing Small Depth and Small Space Classes by Operators of Higher TypesManindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. eccc, 5(57), 1998. [doi]

The Satisfiability Problem for Probabilistic Ordered Branching ProgramsManindra Agrawal, Thomas Thierauf. cocoon 1998: 81 [doi]

1997

1996

Quasi-Linear Truth-Table Reductions to p-Selective SetsManindra Agrawal, Vikraman Arvind. TCS, 158(1&2):361-370, 1996. [doi]

Geometric Sets of Low Information ContentManindra Agrawal, Vikraman Arvind. TCS, 158(1&2):193-219, 1996. [doi]

An Isomorphism Theorem for Circuit ComplexityManindra Agrawal. eccc, 3(2), 1996. [doi]

Modulo Information from Nonadaptive Queries to NPManindra Agrawal, Richard Beigel. eccc, 3(1), 1996. [doi]

The Boolean Isomorphism ProblemManindra Agrawal, Thomas Thierauf. focs 1996: 422-430

On the Isomorphism Conjecture for 2-DFA ReductionsManindra Agrawal, Srinivasan Venkatesh. ijfcs, 7(4):339, 1996.

An Isomorphism Theorem for Circuit ComplexityManindra Agrawal, Eric Allender. cocoon 1996: 2-11 [doi]

Pinpointing Computation with Modular Queries in the Boolean HierarchyManindra Agrawal, Richard Beigel, Thomas Thierauf. fsttcs 1996: 322-334

The Boolean Isomorphism ProblemManindra Agrawal. eccc, 3(32), 1996. [doi]

NP-Creative Sets: A New Class of Creative Sets in NPManindra Agrawal, Somenath Biswas. mst, 29(5):487-505, 1996.

On the Isomorphism Conjecture for Weak ReducibilitiesManindra Agrawal. jcss, 53(2):267-282, 1996.

Polynomial-Time Isomorphism of 1-L-Complete SetsManindra Agrawal, Somenath Biswas. jcss, 53(2):155-160, 1996.

A Note on Decision versus Search for Graph AutomorphismManindra Agrawal, Vikraman Arvind. cocoon 1996: 272-277 [doi]

A Note on Decision versus Search for Graph AutomorphismManindra Agrawal, Vikraman Arvind. iandc, 131(2):179-189, 1996.

1995

Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse SetsManindra Agrawal, Vikraman Arvind. cocoon 1995: 264-276

DSPACE(n)=:::?:::NSPACE(n): A Degree Theoretic CharacterizationManindra Agrawal. cocoon 1995: 315-323

1994

Polynomial Time Truth-Table Reductions to P-Selective SetsManindra Agrawal, Vikraman Arvind. cocoon 1994: 24-30

On the Isomorphism Problem for Weak ReducibilitiesManindra Agrawal. cocoon 1994: 338-355

1993

Polynomial Isomorphism of 1-L-Complete SetsManindra Agrawal, Somenath Biswas. cocoon 1993: 75-80

1992

Universal RelationsManindra Agrawal, Somenath Biswas. coco 1992: 207-220

1991

NP-hard Sets and Creativeness over Constant Time LanguagesManindra Agrawal. fsttcs 1991: 224-241