Howard Straubing

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Lower bounds for modular counting by circuits with modular gates
LATIN '95: Theoretical Informatics
2022-08-16Paper
New results on the generalized star-height problem
STACS 89
2022-08-16Paper
scientific article; zbMATH DE number 7533353 (Why is no real title available?)2022-05-28Paper
Varieties
(available as arXiv preprint)
2022-02-04Paper
Wreath products of distributive forest algebras
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science
2021-01-20Paper
scientific article; zbMATH DE number 7269244 (Why is no real title available?)
(available as arXiv preprint)
2020-11-03Paper
scientific article; zbMATH DE number 7269244 (Why is no real title available?)2020-11-03Paper
Difference hierarchies and duality with an application to formal languages
Topology and its Applications
2020-04-06Paper
Circuit complexity and the expressive power of generalized first-order formulas
Automata, Languages and Programming
2019-12-04Paper
Two-variable logic with a between relation
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science
2018-04-23Paper
An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic
ACM Transactions on Computational Logic
2018-03-22Paper
An effective characterization of the alternation hierarchy in two-variable logic
(available as arXiv preprint)
2017-01-26Paper
Circuit complexity of powering in fields of odd characteristic
Chicago Journal of Theoretical Computer Science
2016-08-16Paper
EF+EX forest algebras
Algebraic Informatics
2015-09-22Paper
A new proof of the locality of \(\mathbf R\).
International Journal of Algebra and Computation
2015-04-21Paper
New applications of the wreath product of forest algebras
RAIRO - Theoretical Informatics and Applications
2014-02-24Paper
An introduction to finite automata and their connection to logic
Modern Applications of Automata Theory
2013-02-26Paper
Piecewise testable tree languages
Logical Methods in Computer Science
2012-10-22Paper
Wreath products of forest algebras, with applications to tree logics
Logical Methods in Computer Science
2012-09-25Paper
Algebraic characterization of the alternation hierarchy in \(\mathrm{FO}^2[<\) on finite words]2012-09-18Paper
Modular quantifiers2011-03-30Paper
Weakly iterated block products and applications to logic and complexity
International Journal of Algebra and Computation
2010-05-25Paper
Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
SIAM Journal on Computing
2008-04-22Paper
Definability of Languages by Generalized First-Order Formulas over (N,+)
STACS 2006
2008-03-19Paper
A note on \(\mathbf{MOD}_{p}\)-\(\mathbf{MOD}_{m}\) circuits
Theory of Computing Systems
2006-10-16Paper
Developments in Language Theory
Lecture Notes in Computer Science
2006-06-23Paper
Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
Theoretical Computer Science
2006-05-18Paper
Incomplete quadratic exponential sums in several variables
Journal of Number Theory
2006-03-20Paper
Bounds on an exponential sum arising in Boolean circuit complexity
Comptes Rendus. Mathématique. Académie des Sciences, Paris
2005-09-27Paper
Some results onC-varieties
RAIRO - Theoretical Informatics and Applications
2005-06-07Paper
Some results onC-varieties
RAIRO - Theoretical Informatics and Applications
2005-06-07Paper
scientific article; zbMATH DE number 2086221 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 2086254 (Why is no real title available?)2004-08-11Paper
scientific article; zbMATH DE number 1944132 (Why is no real title available?)2004-02-02Paper
scientific article; zbMATH DE number 1995174 (Why is no real title available?)2003-10-21Paper
Regular languages defined by generalized first-order formulas with a bounded number of bound variables
Theory of Computing Systems
2003-08-26Paper
Languages defined with modular counting quantifiers
Information and Computation
2003-01-14Paper
scientific article; zbMATH DE number 1688392 (Why is no real title available?)2002-01-09Paper
scientific article; zbMATH DE number 1860666 (Why is no real title available?)2001-01-01Paper
Lower bounds for modular counting by circuits with modular gates
Computational Complexity
2000-12-19Paper
scientific article; zbMATH DE number 1136081 (Why is no real title available?)2000-10-08Paper
scientific article; zbMATH DE number 1419259 (Why is no real title available?)2000-03-21Paper
Finite semigroup varieties defined by programs
Theoretical Computer Science
1998-07-22Paper
scientific article; zbMATH DE number 988809 (Why is no real title available?)1997-10-16Paper
scientific article; zbMATH DE number 1059244 (Why is no real title available?)1997-09-10Paper
Superlinear lower bounds for bounded-width branching programs
Journal of Computer and System Sciences
1995-08-21Paper
Regular languages defined with generalized quantifiers
Information and Computation
1995-07-10Paper
Complex polynomials and circuit lower bounds for modular counting
Computational Complexity
1995-04-06Paper
scientific article; zbMATH DE number 459361 (Why is no real title available?)1994-11-21Paper
scientific article; zbMATH DE number 618821 (Why is no real title available?)1994-08-11Paper
Some results on the generalized star-height problem
Information and Computation
1993-05-16Paper
On a conjecture concerning dot-depth two languages
Theoretical Computer Science
1993-01-16Paper
Regular languages in \(NC\)
Journal of Computer and System Sciences
1992-09-27Paper
CONSTANT-DEPTH PERIODIC CIRCUITS
International Journal of Algebra and Computation
1991-01-01Paper
On uniformity within \(NC^ 1\)
Journal of Computer and System Sciences
1990-01-01Paper
Non-uniform automata over groups
Information and Computation
1990-01-01Paper
Semigroups and languages of dot-depth two
Theoretical Computer Science
1988-01-01Paper
Locally trivial categories and unambiguous concatenation
Journal of Pure and Applied Algebra
1988-01-01Paper
Partially ordered finite monoids and a theorem of I. Simon
Journal of Algebra
1988-01-01Paper
scientific article; zbMATH DE number 4076666 (Why is no real title available?)1988-01-01Paper
Applications of the theory of automata in enumeration
Discrete Mathematics
1987-01-01Paper
scientific article; zbMATH DE number 4010794 (Why is no real title available?)1987-01-01Paper
scientific article; zbMATH DE number 3961008 (Why is no real title available?)1986-01-01Paper
Finite semigroup varieties of the form V*D
Journal of Pure and Applied Algebra
1985-01-01Paper
scientific article; zbMATH DE number 4034007 (Why is no real title available?)1985-01-01Paper
scientific article; zbMATH DE number 3912646 (Why is no real title available?)1984-01-01Paper
Inversion of matrices over a commutative semiring
Journal of Algebra
1984-01-01Paper
A combinatorial proof of the Cayley-Hamilton theorem
Discrete Mathematics
1983-01-01Paper
scientific article; zbMATH DE number 3899183 (Why is no real title available?)1983-01-01Paper
The variety generated by finite nilpotent monoids
Semigroup Forum
1982-01-01Paper
A generalization of the Schützenberger product of finite monoids
Theoretical Computer Science
1981-01-01Paper
scientific article; zbMATH DE number 3724720 (Why is no real title available?)1981-01-01Paper
scientific article; zbMATH DE number 3728535 (Why is no real title available?)1981-01-01Paper
On finite \(\mathcal J\)-trivial monoids
Semigroup Forum
1980-01-01Paper
Families of recognizable sets corresponding to certain varieties of finite monoids
Journal of Pure and Applied Algebra
1979-01-01Paper
Recognizable sets and power sets of finite semigroups
Semigroup Forum
1979-01-01Paper
Aperiodic homomorphisms and the concatenation product of recognizable sets
Journal of Pure and Applied Algebra
1979-01-01Paper


Research outcomes over time


This page was built for person: Howard Straubing