Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "David A. Mix Barrington" ( http://dblp.L3S.de/Authors/David_A._Mix_Barrington )

URL (Homepage):  http://www.cs.umass.edu/~barring/  Author page on DBLP  Author page in RDF  Community of David A. Mix Barrington in ASPL-2

Publication years (Num. hits)
1986-1992 (17) 1993-1999 (17) 2000-2009 (13)
Publication types (Num. hits)
article(26) inproceedings(21)
Venues (Conferences, Journals, ...)
J. Comput. Syst. Sci.(7) Electronic Colloquium on Compu...(6) Computational Complexity(4) IEEE Conference on Computation...(4) MFCS(3) STOC(3) Structure in Complexity Theory...(3) ICALP(2) Inf. Comput.(2) LATIN(2) Mathematical Systems Theory(2) STACS(2) Inf. Process. Lett.(1) ISTCS(1) J. ACM(1) J. Symb. Log.(1) More (+10 of total 19)
Authors
David A. Mix Barrington(47) Eric Allender(9) Howard Straubing(9) Denis Thérien(8) Neil Immerman(5) Pierre McKenzie(5) Samir Datta(5) Andris Ambainis(4) Huong LeThanh(4) Chi-Jen Lu(3) Peter Bro Miltersen(3) Sambuddha Roy(3) Sven Skyum(3) Tanmoy Chakraborty(3) William Hesse(3) Clemens Lautemann(2) More (+10 of total 31)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 9 keywords
Results
Found 47 publication records. Showing 47 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy Planar and Grid Graph Reachability Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Logspace, Algorithms, Planar graphs, Reachability, Complexity theory, Circuit complexity, Grid graphs
1Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy Grid Graph Reachability Problems. Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy Grid Graph Reachability Problems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2005 DBLP  BibTeX  RDF
1David 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. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1William Hesse, Eric Allender, David A. Mix Barrington Uniform constant-depth threshold circuits for division and iterated multiplication. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Eric Allender, David A. Mix Barrington, William Hesse Uniform Circuits for Division: Consequences and Problems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2001 DBLP  BibTeX  RDF
1Neil Immerman, Jonathan F. Buss, David A. Mix Barrington Number of Variables Is Equivalent to Space. Search on Bibsonomy J. Symb. Log. The full citation details ... 2001 DBLP  BibTeX  RDF
1David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie On the Complexity of Some Problems on Groups Input as Multiplication Tables. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Neil Immerman, Clemens Lautemann, Nicole Schweikardt, Denis Thérien The Crane Beach Conjecture. Search on Bibsonomy LICS The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Eric Allender, David A. Mix Barrington, William Hesse Uniform Circuits for Division: Consequences and Problems. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Eric Allender, David A. Mix Barrington Uniform Circuits for Division: Consequences and Problems Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 2000 DBLP  BibTeX  RDF
1David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thérien Equation Satisfiability and Program Satisfiability for Finite Monoids. Search on Bibsonomy MFCS The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Peter Kadau, Klaus-Jörn Lange, Pierre McKenzie On the Complexity of Some Problems on Groups Input as Multiplication Tables. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 2000 DBLP  DOI  BibTeX  RDF logic, circuit complexity, group membership, integer arithmetic
1Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh Bounded Depth Arithmetic Circuits: Counting and Closure Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1999 DBLP  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing Lower bounds for modular counting by circuits with modular gates. Search on Bibsonomy Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh Bounded Depth Arithmetic Circuits: Counting and Closure. Search on Bibsonomy ICALP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum On Monotone Planar Circuits. (PDF / PS) Search on Bibsonomy IEEE Conference on Computational Complexity The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, David A. Mix Barrington, Huong LeThanh On Counting AC0 Circuits with Negative Constants Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1998 DBLP  BibTeX  RDF
1Gábor Tardos, David A. Mix Barrington A Lower Bound on the Mod 6 Degree of the Or Function. Search on Bibsonomy Computational Complexity The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Andris Ambainis, David A. Mix Barrington, Huong LeThanh On Counting AC0 Circuits with Negative Constants. Search on Bibsonomy MFCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum Searching Constant Width Mazes Captures the AC0 Hierarchy. Search on Bibsonomy STACS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum Searching constant width mazes captures the AC0 hierarchy Search on Bibsonomy Electronic Colloquium on Computational Complexity (ECCC) The full citation details ... 1997 DBLP  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing Superlinear Lower Bounds for Bounded-Width Branching Programs. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing Lower Bounds for Modular Counting by Circuits with Modular Gates. Search on Bibsonomy LATIN The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Gábor Tardos, David A. Mix Barrington A Lower Bound on the Mod 6 Degree of the OR Function. Search on Bibsonomy ISTCS The full citation details ... 1995 DBLP  BibTeX  RDF
1David A. Mix Barrington, Richard Beigel, Steven Rudich Representing Boolean Functions as Polynomials Modulo Composite Numbers. Search on Bibsonomy Computational Complexity The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing Complex Polynomials and Circuit Lower Bounds for Modular Counting. Search on Bibsonomy Computational Complexity The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Gudmund Skovbjerg Frandsen, Mark Valence, David A. Mix Barrington Some Results on Uniform Arithmetic Circuit Complexity. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Neil Immerman Time, Hardware, and Uniformity. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1994 DBLP  BibTeX  RDF
1Zhi-Li Zhang, David A. Mix Barrington, Jun Tarui Computing Symmetric Functions with AND/OR Circuits and a Single MAJORITY Gate. Search on Bibsonomy STACS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien Regular Languages in NC¹. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing Complex Polynomials and Circuit Lower Bounds for Modular Counting. Search on Bibsonomy LATIN The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington Quasipolynomial Size Circuit Classes. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1992 DBLP  BibTeX  RDF
1David A. Mix Barrington, Richard Beigel, Steven Rudich Representing Boolean Functions as Polynomials Modulo Composite Numbers (Extended Abstract) Search on Bibsonomy STOC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, James C. Corbett A Note on Some Languages in Uniform ACC0. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Pierre McKenzie Oracle branching programs and Logspace versus P Search on Bibsonomy Inf. Comput. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing Superlinear Lower Bounds for Bounded-Width Branching Programs. Search on Bibsonomy Structure in Complexity Theory Conference The full citation details ... 1991 DBLP  BibTeX  RDF
1David A. Mix Barrington, Howard Straubing, Denis Thérien Non-Uniform Automata Over Groups Search on Bibsonomy Inf. Comput. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington Extensions of an Idea of McNaughton. Search on Bibsonomy Mathematical Systems Theory The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Neil Immerman, Howard Straubing On Uniformity within NC¹. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, James C. Corbett On the Relative Complexity of Some Languages in NC. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Pierre McKenzie Oracle Branching Programs and Logspace versus P. Search on Bibsonomy MFCS The full citation details ... 1989 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Denis Thérien Finite monoids and the fine structure of NC1. Search on Bibsonomy J. ACM The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Denis Thérien Non-Uniform Automata Over Groups. Search on Bibsonomy ICALP The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington, Denis Thérien Finite Monoids and the Fine Structure of NC¹ Search on Bibsonomy STOC The full citation details ... 1987 DBLP  DOI  BibTeX  RDF
1David A. Mix Barrington Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC¹ Search on Bibsonomy STOC The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #47 of 47 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.