| On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990 | 629 | 1990 |
| On uniformity within NC1 DAM Barrington, N Immerman, H Straubing Journal of Computer and System Sciences 41 (3), 274-306, 1990 | 629 | 1990 |
| Finite automata, formal logic, and circuit complexity H Straubing Springer Science & Business Media, 2012 | 564 | 2012 |
| Finite semigroup varieties of the form V∗ D H Straubing Journal of Pure and Applied Algebra 36, 53-94, 1985 | 203 | 1985 |
| Regular languages in NC1 DAM Barrington, K Compton, H Straubing, D Thérien Journal of Computer and System Sciences 44 (3), 478-499, 1992 | 131 | 1992 |
| Non-uniform automata over groups DAM Barrington, H Straubing, D Thérien Information and Computation 89 (2), 109-132, 1990 | 131 | 1990 |
| A generalization of the Schützenberger product of finite monoids H Straubing Theoretical Computer Science 13 (2), 137-150, 1981 | 131 | 1981 |
| Inversion of matrices over a commutative semiring C Reutenauer, H Straubing Journal of Algebra 88 (2), 350-360, 1984 | 110 | 1984 |
| On logical descriptions of regular languages H Straubing Latin American Symposium on Theoretical Informatics, 528-538, 2002 | 90 | 2002 |
| Families of recognizable sets corresponding to certain varieties of finite monoids H Straubing Journal of Pure and Applied Algebra 15 (3), 305-318, 1979 | 83 | 1979 |
| Locally trivial categories and unambiguous concatenation JÉ Pin, H Straubing, D Thérien Journal of Pure and Applied Algebra 52 (3), 297-311, 1988 | 79 | 1988 |
| Partially ordered finite monoids and a theorem of I. Simon H Straubing, D Thérien Journal of Algebra 119 (2), 393-399, 1988 | 76 | 1988 |
| Aperiodic homomorphisms and the concatenation product of recognizable sets H Straubing Journal of Pure and Applied Algebra 15 (3), 319-327, 1979 | 71 | 1979 |
| Semigroups and languages of dot-depth two H Straubing Theoretical Computer Science 58 (1-3), 361-378, 1988 | 68* | 1988 |
| Regular languages defined with generalized quantifiers H Straubing, D Thérien, W Thomas Information and computation 118 (2), 289-301, 1995 | 67 | 1995 |
| A combinatorial proof of the Cayley-Hamilton theorem H Straubing Discrete Mathematics 43 (2-3), 273-279, 1983 | 67 | 1983 |
| Monoids of upper triangular boolean matrices JE Pin, H Straubing Semigroups. Structure and Universal AIgebraic Problems 39, 259-272, 1981 | 63 | 1981 |
| Piecewise testable tree languages M Bojanczyk, L Segoufin, H Straubing 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 442-451, 2008 | 57 | 2008 |
| Piecewise testable tree languages M Bojanczyk, L Segoufin, H Straubing 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 442-451, 2008 | 57 | 2008 |
| Superlinear lower bounds for bounded-width branching programs DAM Barrington, H Straubing Journal of Computer and System Sciences 50 (3), 374-381, 1995 | 55 | 1995 |
Denis TherienVerified email at elementai.com
