The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Eric Allender: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Eric Allender
    The Complexity of Sparse Sets in P. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:1-11 [Conf]
  4. Eric Allender
    Isomorphisms and 1-L Reductions. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1986, pp:12-22 [Conf]
  5. Eric Allender
    The Generalized Kolmogorov Complexity of Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1989, pp:186-194 [Conf]
  6. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
    Grid Graph Reachability Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:299-313 [Conf]
  7. Eric Allender, David A. Mix Barrington, William Hesse
    Uniform Circuits for Division: Consequences and Problems. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:150-159 [Conf]
  8. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
    On the Complexity of Numerical Analysis. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:331-339 [Conf]
  9. Eric Allender, Samir Datta, Sambuddha Roy
    Topology Inside NC¹. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:298-307 [Conf]
  10. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC0d Circuits Given a Truth Table. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2006, pp:237-251 [Conf]
  11. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:220-229 [Conf]
  12. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy
    Derandomization and Distinguishing Complexity. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2003, pp:209-220 [Conf]
  13. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
    Time-Space Tradeoffs in the Counting Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:295-302 [Conf]
  14. Eric Allender, Mitsunori Ogihara
    Relationships Among PL, #L, and the Determinant. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:267-278 [Conf]
  15. Eric Allender, Klaus Reinhardt
    Isolation, Matching, and Counting. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1998, pp:92-100 [Conf]
  16. Eric Allender, Michael E. Saks, Igor Shparlinski
    A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:10-14 [Conf]
  17. Eric Allender, Christopher B. Wilson
    Width-Bounded Reducibility and Binary Search over Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:122-129 [Conf]
  18. Eric Allender
    A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:127-135 [Conf]
  19. Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra
    On Generating Solved Instances of Computational Problems. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1988, pp:297-310 [Conf]
  20. Eric Allender, Vivek Gore
    On Strong Separations from AC0 (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:1-15 [Conf]
  21. Eric Allender
    A Note on the Power of Threshold Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1989, pp:580-584 [Conf]
  22. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
    Power from Random Strings. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:669-678 [Conf]
  23. Eric Allender, Martin Strauss
    Measure on Small Complexity Classes, with Applications for BPP [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:807-818 [Conf]
  24. Klaus Reinhardt, Eric Allender
    Making Nondeterminism Unambiguous. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:244-253 [Conf]
  25. Eric Allender
    When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:1-15 [Conf]
  26. Eric Allender
    Circuit Complexity before the Dawn of the New Millennium. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1996, pp:1-18 [Conf]
  27. Eric Allender, Samir Datta, Sambuddha Roy
    The Directed Planar Reachability Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:238-249 [Conf]
  28. Eric Allender
    Characterizations on PUNC and Precomputation (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:1-10 [Conf]
  29. Eric Allender
    Limitations of the Upward Separation Technique (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:18-30 [Conf]
  30. Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
    Bounded Depth Arithmetic Circuits: Counting and Closure. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:149-158 [Conf]
  31. Eric Allender, Lane A. Hemachandra
    Lower Bounds for the Low Hierarchy (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1989, pp:31-45 [Conf]
  32. Eric Allender, Klaus-Jörn Lange
    StUSPACE(log n) <= DSPACE(log²n / log log n). [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:193-202 [Conf]
  33. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
    The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:71-82 [Conf]
  34. Eric Allender, Ulrich Hertrampf
    On the Power of Uniform Families of Constant Depth Treshold Circuits. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:158-164 [Conf]
  35. Eric Allender, Martin Strauss
    Measure on P: Robustness of the Notion. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:129-138 [Conf]
  36. Martin Mundhenk, Judy Goldsmith, Eric Allender
    The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:129-138 [Conf]
  37. Eric Allender, Sanjeev Arora, Michael S. Kearns, Cristopher Moore, Alexander Russell
    A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. [Citation Graph (0, 0)][DBLP]
    NIPS, 2002, pp:431-437 [Conf]
  38. Eric Allender
    Oracles versus Proof Techniques that Do Not Relativize. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:39-52 [Conf]
  39. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
    A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:1-11 [Conf]
  40. Eric Allender, José L. Balcázar, Neil Immerman
    A First-Order Isomorphism Theorem. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:163-174 [Conf]
  41. Eric Allender, Harry Buhrman, Michal Koucký
    What Can be Efficiently Reduced to the K-Random Strings? [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:584-595 [Conf]
  42. Eric Allender, Meena Mahajan
    The Complexity of Planarity Testing. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:87-98 [Conf]
  43. Eric Allender
    Some Consequences of the Existence of Pseudorandom Generators [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:151-159 [Conf]
  44. Eric Allender, Robert Beals, Mitsunori Ogihara
    The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:161-167 [Conf]
  45. Eric Allender, Jia Jiao
    Depth reduction for noncommutative arithmetic circuits. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:515-522 [Conf]
  46. 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]
  47. Eric Allender, Harry Buhrman, Michal Koucký
    What can be efficiently reduced to the Kolmogorov-random strings? [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 2006, v:138, n:1-3, pp:2-19 [Journal]
  48. 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]
  49. Eric Allender
    Special issue "Conference on Computational Complexity 2004" Guest Editor's foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:2, pp:89- [Journal]
  50. Eric Allender
    Special issue, final part "Conference on Computational Complexity 2004 " Guest Editor's foreword. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2005, v:14, n:3, pp:185- [Journal]
  51. Eric Allender, Anna Bernasconi, Carsten Damm, Joachim von zur Gathen, Michael E. Saks, Igor Shparlinski
    Complexity of some arithmetic problems for binary polynomials. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2003, v:12, n:1-2, pp:23-47 [Journal]
  52. Eric Allender, Robert Beals, Mitsunori Ogihara
    The Complexity of Matrix Rank and Feasible Systems of Linear Equations. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:2, pp:99-126 [Journal]
  53. Eric Allender, Danilo Bruschi, Giovanni Pighizzini
    The Complexity of Computing Maximal Word Functions. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1993, v:3, n:, pp:368-391 [Journal]
  54. 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]
  55. Eric Allender
    The Permanent Requires Large Uniform Threshold Circuits. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  56. Eric Allender
    The Division Breakthroughs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2001, v:74, n:, pp:61-77 [Journal]
  57. Eric Allender
    News from the Isomorphism Front. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1998, v:66, n:, pp:73- [Journal]
  58. Eric Allender, Klaus W. Wagner
    Counting Hierarchies: Polynomial Time and Constant. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:182-194 [Journal]
  59. Eric Allender, David A. Mix Barrington
    Uniform Circuits for Division: Consequences and Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:65, pp:- [Journal]
  60. Eric Allender, David A. Mix Barrington, William Hesse
    Uniform Circuits for Division: Consequences and Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:33, pp:- [Journal]
  61. Eric Allender, Michal Koucký, Detlef Ronneburger, Sambuddha Roy, V. Vinay
    Time-Space Tradeoffs in the Counting Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:41, pp:- [Journal]
  62. Eric Allender, Harry Buhrman, Michal Koucký, Detlef Ronneburger, Dieter van Melkebeek
    Power from Random Strings [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:028, pp:- [Journal]
  63. Eric Allender, Harry Buhrman, Michal Koucký
    What Can be Efficiently Reduced to the Kolmogorov-Random Strings? [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:044, pp:- [Journal]
  64. Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer
    The Complexity of Satisfiability Problems: Refining Schaefer's Theorem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:100, pp:- [Journal]
  65. Eric Allender, Samir Datta, Sambuddha Roy
    Topology inside NC1 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:108, pp:- [Journal]
  66. Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen
    On the Complexity of Numerical Analysis [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:037, pp:- [Journal]
  67. Eric Allender, Lisa Hellerstein, Paul McCabe, Toniann Pitassi, Michael E. Saks
    Minimizing DNF Formulas and AC0 Circuits Given a Truth Table [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:126, pp:- [Journal]
  68. Eric Allender, Samir Datta, Sambuddha Roy
    The Directed Planar Reachability Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:148, pp:- [Journal]
  69. Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
    Grid Graph Reachability Problems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:149, pp:- [Journal]
  70. Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
    Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:43, pp:- [Journal]
  71. Eric Allender
    A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:23, pp:- [Journal]
  72. Eric Allender, Robert Beals, Mitsunori Ogihara
    The complexity of matrix rank and feasible systems of linear equations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:24, pp:- [Journal]
  73. Klaus Reinhardt, Eric Allender
    Making Nondeterminism Unambiguous [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:14, pp:- [Journal]
  74. 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]
  75. Eric Allender, Shiyu Zhou
    Uniform Inclusions in Nondeterministic Logspace [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:23, pp:- [Journal]
  76. 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]
  77. Eric Allender, Vikraman Arvind, Meena Mahajan
    Arithmetic Complexity, Kleene Closure, and Formal Power Series [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:8, pp:- [Journal]
  78. Eric Allender, Igor Shparlinski, Michael E. Saks
    A Lower Bound for Primality [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:10, pp:- [Journal]
  79. Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
    Bounded Depth Arithmetic Circuits: Counting and Closure [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:12, pp:- [Journal]
  80. Eric Allender
    NL-printable sets and Nondeterministic Kolmogorov Complexity. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:84, n:, pp:- [Journal]
  81. Eric Allender, Ulrich Hertrampf
    Depth Reduction for Circuits of Unbounded Fan-In [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:2, pp:217-238 [Journal]
  82. Eric Allender, Meena Mahajan
    The complexity of planarity testing. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:189, n:1, pp:117-134 [Journal]
  83. Eric Allender, Osamu Watanabe
    Kolmogorov Complexity and Degrees of Tally Sets [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:2, pp:160-178 [Journal]
  84. Eric Allender, Vivek Gore
    Rudimentary Reductions Revisited. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:40, n:2, pp:89-95 [Journal]
  85. Eric Allender, Mitsunori Ogihara
    Relationships Among PL, #L, and the Determinant. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:1, pp:1-21 [Journal]
  86. Eric Allender
    P-uniform circuit complexity. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:4, pp:912-928 [Journal]
  87. Eric Allender, Lane A. Hemachandra
    Lower Bounds for the Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:1, pp:234-251 [Journal]
  88. Martin Mundhenk, Judy Goldsmith, Christopher Lusena, Eric Allender
    Complexity of finite-horizon Markov decision process problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2000, v:47, n:4, pp:681-720 [Journal]
  89. Eric Allender, Klaus Reinhardt, Shiyu Zhou
    Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:2, pp:164-181 [Journal]
  90. Eric Allender, Michael E. Saks, Igor Shparlinski
    A Lower Bound for Primality. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:62, n:2, pp:356-366 [Journal]
  91. 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]
  92. 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]
  93. Eric Allender
    Isomorphisms and 1-L Reductions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1988, v:36, n:3, pp:336-350 [Journal]
  94. Eric Allender
    Some Consequences of the Existence of Pseudorandom Generators. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:39, n:1, pp:101-124 [Journal]
  95. William Hesse, Eric Allender, David A. Mix Barrington
    Uniform constant-depth threshold circuits for division and iterated multiplication. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:4, pp:695-716 [Journal]
  96. Eric Allender
    Limitations of the Upward Separation Technique. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:1, pp:53-67 [Journal]
  97. Eric Allender, Vikraman Arvind, Meena Mahajan
    Arithmetic Complexity, Kleene Closure, and Formal Power Series. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:4, pp:303-328 [Journal]
  98. Eric Allender, Klaus-Jörn Lange
    RUSPACE(log n) $\subseteq$ DSPACE (log2 n / log log n). [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1998, v:31, n:5, pp:539-550 [Journal]
  99. Eric Allender, José L. Balcázar, Neil Immerman
    A First-Order Isomorphism Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:2, pp:557-567 [Journal]
  100. Eric Allender, Harry Buhrman, Michal Koucký, Dieter van Melkebeek, Detlef Ronneburger
    Power from Random Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:35, n:6, pp:1467-1493 [Journal]
  101. Eric Allender, Vivek Gore
    A Uniform Circuit Lower Bound for the Permanent. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:5, pp:1026-1049 [Journal]
  102. Eric Allender, Lane A. Hemachandra, Mitsunori Ogiwara, Osamu Watanabe
    Relating Equivalence and Reducibility to Sparse Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1992, v:21, n:3, pp:521-539 [Journal]
  103. Eric Allender, Roy S. Rubinstein
    P-Printable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:6, pp:1193-1202 [Journal]
  104. Klaus Reinhardt, Eric Allender
    Making Nondeterminism Unambiguous. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:29, n:4, pp:1118-1131 [Journal]
  105. Eric Allender
    NL-printable sets and nondeterministic Kolmogorov complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:2, pp:127-138 [Journal]
  106. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
    Almost-Everywhere Complexity Hierarchies for Nondeterministic Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:115, n:2, pp:225-241 [Journal]
  107. Eric Allender, Jia Jiao, Meena Mahajan, V. Vinay
    Non-Commutative Arithmetic Circuits: Depth Reduction and Size Lower Bounds. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:47-86 [Journal]
  108. Eric Allender, Maria M. Klawe
    Improved Lower Bounds for the Cycle Detection Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:231-237 [Journal]
  109. Eric Allender, Christopher B. Wilson
    Downward Translations of Equality. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:75, n:3, pp:335-346 [Journal]
  110. Eric Allender
    Reachability Problems: An Update. [Citation Graph (0, 0)][DBLP]
    CiE, 2007, pp:25-27 [Conf]

  111. Uniform Derandomization from Pathetic Lower Bounds. [Citation Graph (, )][DBLP]


  112. Chipping Away at P vs NP: How Far Are We from Proving Circuit Size Lower Bounds? [Citation Graph (, )][DBLP]


  113. Avoiding Simplicity Is Complex. [Citation Graph (, )][DBLP]


  114. Amplifying Lower Bounds by Means of Self-Reducibility. [Citation Graph (, )][DBLP]


  115. Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata. [Citation Graph (, )][DBLP]


  116. Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds. [Citation Graph (, )][DBLP]


  117. On the Complexity of Numerical Analysis. [Citation Graph (, )][DBLP]


  118. A Status Report on the P Versus NP Question. [Citation Graph (, )][DBLP]


  119. Amplifying Lower Bounds by Means of Self-Reducibility. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.014secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002