The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David A. Mix Barrington: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David A. Mix Barrington, Neil Immerman, Howard Straubing
    On Uniformity within NC¹. [Citation Graph (12, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:41, n:3, pp:274-306 [Journal]
  2. David A. Mix Barrington, James C. Corbett
    On the Relative Complexity of Some Languages in NC. [Citation Graph (1, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:5, pp:251-256 [Journal]
  3. David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
    On the Complexity of Some Problems on Groups Input as Multiplication Tables. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:62-69 [Conf]
  4. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    On Monotone Planar Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:24-0 [Conf]
  5. David A. Mix Barrington, Howard Straubing
    Superlinear Lower Bounds for Bounded-Width Branching Programs. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:305-313 [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. David A. Mix Barrington
    Quasipolynomial Size Circuit Classes. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:86-93 [Conf]
  9. David A. Mix Barrington, Neil Immerman
    Time, Hardware, and Uniformity. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1994, pp:176-185 [Conf]
  10. 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]
  11. David A. Mix Barrington, Denis Thérien
    Non-Uniform Automata Over Groups. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:163-173 [Conf]
  12. Gábor Tardos, David A. Mix Barrington
    A Lower Bound on the Mod 6 Degree of the OR Function. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:52-56 [Conf]
  13. David A. Mix Barrington, Howard Straubing
    Complex Polynomials and Circuit Lower Bounds for Modular Counting. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:24-31 [Conf]
  14. David A. Mix Barrington, Howard Straubing
    Lower Bounds for Modular Counting by Circuits with Modular Gates. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:60-71 [Conf]
  15. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
    The Crane Beach Conjecture. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:187-196 [Conf]
  16. David A. Mix Barrington, Pierre McKenzie
    Oracle Branching Programs and Logspace versus P. [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:370-379 [Conf]
  17. Andris Ambainis, David A. Mix Barrington, Huong LeThanh
    On Counting AC0 Circuits with Negative Constants. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:409-417 [Conf]
  18. David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien
    Equation Satisfiability and Program Satisfiability for Finite Monoids. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:172-181 [Conf]
  19. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Searching Constant Width Mazes Captures the AC0 Hierarchy. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:73-83 [Conf]
  20. Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui
    Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:535-544 [Conf]
  21. David A. Mix Barrington
    Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ [Citation Graph (0, 0)][DBLP]
    STOC, 1986, pp:1-5 [Conf]
  22. David A. Mix Barrington, Richard Beigel, Steven Rudich
    Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1992, pp:455-461 [Conf]
  23. David A. Mix Barrington, Denis Thérien
    Finite Monoids and the Fine Structure of NC¹ [Citation Graph (0, 0)][DBLP]
    STOC, 1987, pp:101-109 [Conf]
  24. David A. Mix Barrington, Richard Beigel, Steven Rudich
    Representing Boolean Functions as Polynomials Modulo Composite Numbers. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:367-382 [Journal]
  25. David A. Mix Barrington, Howard Straubing
    Complex Polynomials and Circuit Lower Bounds for Modular Counting. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1994, v:4, n:, pp:325-338 [Journal]
  26. David A. Mix Barrington, Howard Straubing
    Lower bounds for modular counting by circuits with modular gates. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1999, v:8, n:3, pp:258-272 [Journal]
  27. Gábor Tardos, David A. Mix Barrington
    A Lower Bound on the Mod 6 Degree of the Or Function. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 1998, v:7, n:2, pp:99-108 [Journal]
  28. 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]
  29. 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]
  30. 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]
  31. David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Searching constant width mazes captures the AC0 hierarchy [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:44, pp:- [Journal]
  32. Andris Ambainis, David A. Mix Barrington, Huong LeThanh
    On Counting AC0 Circuits with Negative Constants [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:20, pp:- [Journal]
  33. 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]
  34. David A. Mix Barrington, Pierre McKenzie
    Oracle branching programs and Logspace versus P [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1991, v:95, n:1, pp:96-115 [Journal]
  35. David A. Mix Barrington, Howard Straubing, Denis Thérien
    Non-Uniform Automata Over Groups [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:89, n:2, pp:109-132 [Journal]
  36. David A. Mix Barrington, Denis Thérien
    Finite monoids and the fine structure of NC1. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1988, v:35, n:4, pp:941-952 [Journal]
  37. David A. Mix Barrington
    Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1989, v:38, n:1, pp:150-164 [Journal]
  38. David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
    Regular Languages in NC¹. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:44, n:3, pp:478-499 [Journal]
  39. David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien
    First-order expressibility of languages with neutral letters or: The Crane Beach conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2005, v:70, n:2, pp:101-127 [Journal]
  40. David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie
    On the Complexity of Some Problems on Groups Input as Multiplication Tables. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2001, v:63, n:2, pp:186-200 [Journal]
  41. David A. Mix Barrington, Howard Straubing
    Superlinear Lower Bounds for Bounded-Width Branching Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:3, pp:374-381 [Journal]
  42. 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]
  43. Neil Immerman, Jonathan F. Buss, David A. Mix Barrington
    Number of Variables Is Equivalent to Space. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 2001, v:66, n:3, pp:1217-1230 [Journal]
  44. David A. Mix Barrington
    Extensions of an Idea of McNaughton. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1990, v:23, n:3, pp:147-164 [Journal]
  45. Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington
    Some Results on Uniform Arithmetic Circuit Complexity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1994, v:27, n:2, pp:105-124 [Journal]
  46. David A. Mix Barrington, James C. Corbett
    A Note on Some Languages in Uniform ACC0. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:78, n:2, pp:357-362 [Journal]

Search in 0.216secs, Finished in 0.217secs
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