The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Manindra Agrawal: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manindra Agrawal
    Towards Uniform AC0 - Isomorphisms. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:13-20 [Conf]
  2. Manindra Agrawal
    Pseudo-Random Generators and Structure of Complete Degrees. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:139-147 [Conf]
  3. Manindra Agrawal
    On Derandomizing Tests for Certain Polynomial Identities. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:355-0 [Conf]
  4. Manindra Agrawal
    On the Isomorphism Problem for Weak Reducibilities. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:338-355 [Conf]
  5. Manindra Agrawal
    DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:315-323 [Conf]
  6. Manindra Agrawal, Vikraman Arvind
    Polynomial Time Truth-Table Reductions to P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:24-30 [Conf]
  7. Manindra Agrawal, Vikraman Arvind
    Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1995, pp:264-276 [Conf]
  8. Manindra Agrawal, Eric Allender
    An Isomorphism Theorem for Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:2-11 [Conf]
  9. Manindra Agrawal, Vikraman Arvind
    A Note on Decision versus Search for Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1996, pp:272-277 [Conf]
  10. Manindra Agrawal, Eric Allender, Samir Datta
    On TC0, AC0, and Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:134-148 [Conf]
  11. Manindra Agrawal, Somenath Biswas
    Universal Relations. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:207-220 [Conf]
  12. Manindra Agrawal, Somenath Biswas
    Polynomial Isomorphism of 1-L-Complete Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1993, pp:75-80 [Conf]
  13. Manindra Agrawal, Thomas Thierauf
    The Satisfiability Problem for Probabilistic Ordered Branching Programs. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:81-0 [Conf]
  14. Manindra Agrawal, Somenath Biswas
    Primality and Identity Testing via Chinese Remaindering. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:202-209 [Conf]
  15. Manindra Agrawal, Thomas Thierauf
    The Boolean Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    FOCS, 1996, pp:422-430 [Conf]
  16. Manindra Agrawal
    Hard Sets and Pseudo-random Generators for Constant Depth Circuits. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:58-69 [Conf]
  17. Manindra Agrawal
    The First-Order Isomorphism Theorem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:70-82 [Conf]
  18. Manindra Agrawal
    Proving Lower Bounds Via Pseudo-random Generators. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:92-105 [Conf]
  19. Manindra Agrawal
    NP-hard Sets and Creativeness over Constant Time Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1991, pp:224-241 [Conf]
  20. Manindra Agrawal, Richard Beigel, Thomas Thierauf
    Pinpointing Computation with Modular Queries in the Boolean Hierarchy. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:322-334 [Conf]
  21. Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang
    Behavioural Approximations for Restricted Linear Differential Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    HSCC, 2006, pp:4-18 [Conf]
  22. Manindra Agrawal, P. S. Thiagarajan
    Lazy Rectangular Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    HSCC, 2004, pp:1-15 [Conf]
  23. Manindra Agrawal, P. S. Thiagarajan
    The Discrete Time Behavior of Lazy Linear Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    HSCC, 2005, pp:55-69 [Conf]
  24. Manindra Agrawal, Nitin Saxena
    Automorphisms of Finite Rings and Applications to Complexity of Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 2005, pp:1-17 [Conf]
  25. Manindra Agrawal, Nitin Saxena
    Equivalence of F-Algebras and Cubic Forms. [Citation Graph (0, 0)][DBLP]
    STACS, 2006, pp:115-126 [Conf]
  26. Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
    The Polynomially Bounded Perfect Matching Problem Is in NC 2. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:489-499 [Conf]
  27. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the Complexity of Reductions. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:730-738 [Conf]
  28. Manindra Agrawal
    Primality Tests Based on Fermat's Little Theorem. [Citation Graph (0, 0)][DBLP]
    ICDCN, 2006, pp:288-293 [Conf]
  29. Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
    Reducing the complexity of reductions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2001, v:10, n:2, pp:117-138 [Journal]
  30. Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
    Characterizing Small Depth and Small Space Classes by Operators of Higher Type. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
  31. Manindra Agrawal, Richard BeigelThomas Thierauf
    Modulo Information from Nonadaptive Queries to NP [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:1, pp:- [Journal]
  32. Manindra Agrawal, Eric Allender, Samir Datta
    On TC0, AC0, and Arithmetic Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:16, pp:- [Journal]
  33. Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
    Characterizing Small Depth and Small Space Classes by Operators of Higher Types [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:57, pp:- [Journal]
  34. Manindra Agrawal, Vikraman Arvind
    A Note on Decision versus Search for Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:131, n:2, pp:179-189 [Journal]
  35. Manindra Agrawal, Srinivasan Venkatesh
    On the Isomorphism Conjecture for 2-DFA Reductions. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1996, v:7, n:4, pp:339-0 [Journal]
  36. Manindra Agrawal
    For completeness, sublogarithmic space is no space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:6, pp:321-325 [Journal]
  37. Manindra Agrawal, Somenath Biswas
    Primality and identity testing via Chinese remaindering. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:4, pp:429-443 [Journal]
  38. Manindra Agrawal
    On the Isomorphism Conjecture for Weak Reducibilities. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:267-282 [Journal]
  39. Manindra Agrawal
    DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:383-392 [Journal]
  40. Manindra Agrawal, Eric Allender, Samir Datta
    On TC0, AC0, and Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:395-421 [Journal]
  41. Manindra Agrawal, Eric Allender, Steven Rudich
    Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1998, v:57, n:2, pp:127-143 [Journal]
  42. Manindra Agrawal, Somenath Biswas
    Polynomial-Time Isomorphism of 1-L-Complete Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:53, n:2, pp:155-160 [Journal]
  43. Manindra Agrawal, Somenath Biswas
    NP-Creative Sets: A New Class of Creative Sets in NP. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:5, pp:487-505 [Journal]
  44. Manindra Agrawal, Thomas Thierauf
    The Formula Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:3, pp:990-1009 [Journal]
  45. Manindra Agrawal, Vikraman Arvind
    Geometric Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:193-219 [Journal]
  46. Manindra Agrawal, Vikraman Arvind
    Quasi-Linear Truth-Table Reductions to p-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:158, n:1&2, pp:361-370 [Journal]

  47. One-Way Functions and the Berman-Hartmanis Conjecture. [Citation Graph (, )][DBLP]


  48. 07411 Executive Summary -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  49. 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. [Citation Graph (, )][DBLP]


  50. Arithmetic Circuits: A Chasm at Depth Four. [Citation Graph (, )][DBLP]


  51. Arithmetic Circuits: A Chasm at Depth Four. [Citation Graph (, )][DBLP]


  52. The polynomially bounded perfect matching problem is in NC^2. [Citation Graph (, )][DBLP]


Search in 1.717secs, Finished in 1.721secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002