| 2008 |
|---|
| 41 | EE | Mikolaj Bojanczyk,
Luc Segoufin,
Howard Straubing:
Piecewise Testable Tree Languages.
LICS 2008: 442-451 |
| 2007 |
|---|
| 40 | EE | Amitabha Roy,
Howard Straubing:
Definability of Languages by Generalized First-Order Formulas over N+.
SIAM J. Comput. 37(2): 502-521 (2007) |
| 2006 |
|---|
| 39 | EE | Laura Chaubard,
Jean-Eric Pin,
Howard Straubing:
First Order Formulas with Modular Ppredicates.
LICS 2006: 211-220 |
| 38 | EE | Amitabha Roy,
Howard Straubing:
Definability of Languages by Generalized First-Order Formulas over (N, +).
STACS 2006: 489-499 |
| 37 | EE | Laura Chaubard,
Jean-Eric Pin,
Howard Straubing:
Actions, wreath products of C-varieties and concatenation product.
Theor. Comput. Sci. 356(1-2): 73-89 (2006) |
| 36 | EE | Howard Straubing,
Denis Thérien:
A Note on MODp - MODm Circuits.
Theory Comput. Syst. 39(5): 699-706 (2006) |
| 2005 |
|---|
| 35 | EE | Howard Straubing:
Inexpressibility Results for Regular Languages in Nonregular Settings.
Developments in Language Theory 2005: 69-77 |
| 2003 |
|---|
| 34 | EE | Howard Straubing,
Denis Thérien:
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables.
Theory Comput. Syst. 36(1): 29-69 (2003) |
| 2002 |
|---|
| 33 | EE | Howard Straubing:
On Logical Descriptions of Regular Languages.
LATIN 2002: 528-538 |
| 32 | EE | Howard Straubing,
Denis Thérien:
Weakly Iterated Block Products of Finite Monoids.
LATIN 2002: 91-104 |
| 2001 |
|---|
| 31 | EE | Howard Straubing,
Denis Thérien:
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables.
STACS 2001: 551-562 |
| 30 | | Kevin J. Compton,
Howard Straubing:
Characterizations of Regular Languages in Low Level Complexity Classes.
Current Trends in Theoretical Computer Science 2001: 235-246 |
| 1999 |
|---|
| 29 | EE | David A. Mix Barrington,
Howard Straubing:
Lower bounds for modular counting by circuits with modular gates.
Computational Complexity 8(3): 258-272 (1999) |
| 1998 |
|---|
| 28 | | Howard Straubing:
Languages Defined With Modular Counting Quantifiers (Extended Abstract).
STACS 1998: 332-343 |
| 1997 |
|---|
| 27 | EE | Pierre Péladeau,
Howard Straubing,
Denis Thérien:
Finite Semigroup Varieties Defined by Programs.
Theor. Comput. Sci. 180(1-2): 325-339 (1997) |
| 1996 |
|---|
| 26 | | Howard Straubing:
Finite Models, Automata, and Circuit Complexity.
Descriptive Complexity and Finite Models 1996: 63-96 |
| 1995 |
|---|
| 25 | | David A. Mix Barrington,
Howard Straubing:
Lower Bounds for Modular Counting by Circuits with Modular Gates.
LATIN 1995: 60-71 |
| 24 | | Richard Beigel,
Howard Straubing:
The Power of Local Self-Reductions.
Structure in Complexity Theory Conference 1995: 277-285 |
| 23 | EE | Richard Beigel,
Howard Straubing:
The Power of Local Self-Reductions
Electronic Colloquium on Computational Complexity (ECCC) 2(37): (1995) |
| 22 | | Howard Straubing,
Denis Thérien,
Wolfgang Thomas:
Regular Languages Defined with Generalized Quanifiers
Inf. Comput. 118(2): 289-301 (1995) |
| 21 | | David A. Mix Barrington,
Howard Straubing:
Superlinear Lower Bounds for Bounded-Width Branching Programs.
J. Comput. Syst. Sci. 50(3): 374-381 (1995) |
| 1994 |
|---|
| 20 | | David A. Mix Barrington,
Howard Straubing:
Complex Polynomials and Circuit Lower Bounds for Modular Counting.
Computational Complexity 4: 325-338 (1994) |
| 1992 |
|---|
| 19 | | Howard Straubing:
Circuit Complexity and the Expressive Power of Generalized First-Order Formulas.
ICALP 1992: 16-27 |
| 18 | | David A. Mix Barrington,
Howard Straubing:
Complex Polynomials and Circuit Lower Bounds for Modular Counting.
LATIN 1992: 24-31 |
| 17 | | Kevin J. Compton,
Howard Straubing:
Characterizations of regular languages in low level complexity classes.
Bulletin of the EATCS 48: 134-142 (1992) |
| 16 | | Jean-Eric Pin,
Howard Straubing,
Denis Thérien:
Some Results on the Generalized Star-Height Problem
Inf. Comput. 101(2): 219-250 (1992) |
| 15 | | David A. Mix Barrington,
Kevin J. Compton,
Howard Straubing,
Denis Thérien:
Regular Languages in NC¹.
J. Comput. Syst. Sci. 44(3): 478-499 (1992) |
| 14 | | Howard Straubing,
Pascal Weil:
On a Conjecture Concerning Dot-Depth Two Languages.
Theor. Comput. Sci. 104(2): 161-183 (1992) |
| 1991 |
|---|
| 13 | | David A. Mix Barrington,
Howard Straubing:
Superlinear Lower Bounds for Bounded-Width Branching Programs.
Structure in Complexity Theory Conference 1991: 305-313 |
| 1990 |
|---|
| 12 | | David A. Mix Barrington,
Howard Straubing,
Denis Thérien:
Non-Uniform Automata Over Groups
Inf. Comput. 89(2): 109-132 (1990) |
| 11 | | David A. Mix Barrington,
Neil Immerman,
Howard Straubing:
On Uniformity within NC¹.
J. Comput. Syst. Sci. 41(3): 274-306 (1990) |
| 1989 |
|---|
| 10 | | Jean-Eric Pin,
Howard Straubing,
Denis Thérien:
New Results on the Generalized Star-Height Problem.
STACS 1989: 458-467 |
| 1988 |
|---|
| 9 | | Howard Straubing:
The wreath product and its applications.
Formal Properties of Finite Automata and Applications 1988: 15-24 |
| 8 | | Howard Straubing,
Denis Thérien:
Finite automata and computational complexity.
Formal Properties of Finite Automata and Applications 1988: 199-233 |
| 7 | | Howard Straubing,
Denis Thérien,
Wolfgang Thomas:
regular Languages Defined with Generalized Quantifiers.
ICALP 1988: 561-575 |
| 6 | | Howard Straubing:
Semigroups and Languages of Dot-Depth Two.
Theor. Comput. Sci. 58: 361-378 (1988) |
| 1987 |
|---|
| 5 | EE | Howard Straubing:
Applications of the theory of automata in enumeration.
Discrete Mathematics 64(2-3): 269-279 (1987) |
| 1986 |
|---|
| 4 | | Howard Straubing:
Semigroups and Languages of Dot-Depth 2.
ICALP 1986: 416-423 |
| 1983 |
|---|
| 3 | EE | Howard Straubing:
A combinatorial proof of the Cayley-Hamilton theorem.
Discrete Mathematics 43(2-3): 273-279 (1983) |
| 1981 |
|---|
| 2 | | Howard Straubing:
Relationals Morphisms and Operations on Recognizable Sets.
ITA 15(2): 149-159 (1981) |
| 1 | | Howard Straubing:
A Generalization of the Schützenberger Product of Finite Monoids.
Theor. Comput. Sci. 13: 137-150 (1981) |
