Journal of the ACM Bibliography

Selected papers that cite this one

• Eric Allender and Vivek Gore. A uniform circuit lower bound for the permanent. SIAM Journal on Computing, 23(5):1026-1049, October 1994.

• David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, and Sven Skyum. Searching constant width mazes captures the AC^0 hierarchy. In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 73-83, Paris France, 25-27 February 1998. Springer.

• David A. Mix Barrington and Howard Straubing. Superlinear lower bounds for bounded-width branching programs. Journal of Computer and System Sciences, 50(3):374-381, June 1995.

• Martin Beaudry and Pierre McKenzie. Circuits, matrices, and nonassociative computation. Journal of Computer and System Sciences, 50(3):441-455, June 1995.

• Martin Beaudry, Pierre McKenzie, Pierre Péladeau, and Denis Thérien. Finite monoids: From word to circuit evaluation. SIAM Journal on Computing, 26(1):138-152, January 1997.

• J.-C. Birget. Two-way automata and length-preserving homomorphisms. Mathematical Systems Theory, 29(3):191-226, May/June 1996.

• Hervé Caussinus. A note on a theorem of Barrington, Straubing and Thérien. Information Processing Letters, 58(1):31-33, 8 April 1996.

• Hervé Caussinus, Pierre McKenzie, Denis Thérien, and Heribert Vollmer. Nondeterministic NC^1 computation. Journal of Computer and System Sciences, 57(2):200-212, October 1998.

• Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, and Sven Skyum. Dynamic word problems. Journal of the ACM, 44(2):257-271, March 1997.

• Birgit Jenner, Pierre McKenzie, and Denis Thérien. Logspace and logtime leaf languages. Information and Computation, 129(1):21-33, 25 August 1996.

• Pierre Péladeau, Howard Straubing, and Denis Thérien. Finite semigroup varieties defined by programs. Theoretical Computer Science, 180(1-2):325-339, 10 June 1997.

• Howard Straubing. Languages defined with modular counting quantifiers (extended abstract). In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 332-343, Paris France, 25-27 February 1998. Springer.

• Howard Straubing, Denis Thérien, and Wolfgang Thomas. Regular languages defined with generalized quanifiers. Information and Computation, 118(2):289-301, 1 May 1995.

Shortcuts: