Howard Straubing

74 papers A* 8A 4B 6C 1Journal 43Unranked 9

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	Regular languages defined by first-order formulas without quantifier alternation. CoRR Andreas Krebs, Howard Straubing
2021	—	`ch.`	Varieties. Handbook of Automata Theory (I.) Howard Straubing, Pascal Weil
2020	J	`jnl`	Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. Log. Methods Comput. Sci. Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing
2019	J	`jnl`	Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. CoRR Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing
2019	J	`jnl`	Wreath Products of Distributive Forest Algebras. CoRR Michael Hahn, Andreas Krebs, Howard Straubing
2018	B	`conf`	An Algebraic Decision Procedure for Two-Variable Logic with a Between Relation. CSL Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing
2018	J	`jnl`	Difference hierarchies and duality with an application to formal languages. CoRR Célia Borlido, Mai Gehrke, Andreas Krebs, Howard Straubing
2018	J	`jnl`	First-order logic and aperiodic languages: a revisionist history. ACM SIGLOG News Howard Straubing
2018	J	`jnl`	Forest Categories. CoRR Howard Straubing
2018	A*	`conf`	Wreath Products of Distributive Forest Algebras. LICS Michael Hahn, Andreas Krebs, Howard Straubing
2017	J	`jnl`	An Effective Characterization of the Alternation Hierarchy in Two-Variable Logic. ACM Trans. Comput. Log. Andreas Krebs, Howard Straubing
2016	J	`jnl`	Circuit Complexity of Powering in Fields of Odd Characteristic. Chic. J. Theor. Comput. Sci. Arkadev Chattopadhyay, Frederic Green, Howard Straubing
2016	J	`jnl`	Two-variable Logic with a Between Predicate. CoRR Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing
2016	A*	`conf`	Two-variable Logic with a Between Relation. LICS Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing
2015	J	`jnl`	A new proof of the locality of R. Int. J. Algebra Comput. Howard Straubing
2015	—	`conf`	EF+EX Forest Algebras. CAI Andreas Krebs, Howard Straubing
2015	J	`jnl`	Varieties. CoRR Howard Straubing, Pascal Weil
2014	J	`jnl`	EF+EX Forest Algebras. CoRR Andreas Krebs, Howard Straubing
2013	J	`jnl`	New applications of the wreath product of forest algebras. RAIRO Theor. Informatics Appl. Howard Straubing
2012	—	`ch.`	An Introduction to Finite Automata and their Connection to Logic. Modern Applications of Automata Theory Howard Straubing, Pascal Weil
2012	J	`jnl`	An effective characterization of the alternation hierarchy in two-variable logic CoRR Andreas Krebs, Howard Straubing
2012	—	`conf`	An effective characterization of the alternation hierarchy in two-variable logic. FSTTCS Andreas Krebs, Howard Straubing
2012	J	`jnl`	Piecewise testable tree languages Log. Methods Comput. Sci. Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
2012	J	`jnl`	Wreath Products of Forest Algebras, with Applications to Tree Logics Log. Methods Comput. Sci. Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
2011	B	`conf`	Algebraic Characterization of the Alternation Hierarchy in FO CSL Howard Straubing
2010	J	`jnl`	An introduction to finite automata and their connection to logic CoRR Howard Straubing, Pascal Weil
2010	J	`jnl`	Weakly Iterated Block Products and Applications to Logic and Complexity. Int. J. Algebra Comput. Howard Straubing, Pascal Tesson, Denis Thérien
2009	A*	`conf`	Wreath Products of Forest Algebras, with Applications to Tree Logics. LICS Mikolaj Bojanczyk, Howard Straubing, Igor Walukiewicz
2008	—	`conf`	Modular quantifiers. Logic and Automata Howard Straubing, Denis Thérien
2008	A*	`conf`	Piecewise Testable Tree Languages. LICS Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing
2007	J	`jnl`	Definability of Languages by Generalized First-Order Formulas over N SIAM J. Comput. Amitabha Roy, Howard Straubing
2006	J	`jnl`	A Note on MOD Theory Comput. Syst. Howard Straubing, Denis Thérien
2006	J	`jnl`	Actions, wreath products of Theor. Comput. Sci. Laura Chaubard, Jean-Eric Pin, Howard Straubing
2006	A	`conf`	Definability of Languages by Generalized First-Order Formulas over (N, +). STACS Amitabha Roy, Howard Straubing
2006	A*	`conf`	First Order Formulas with Modular Predicates. LICS Laura Chaubard, Jean-Eric Pin, Howard Straubing
2005	C	`conf`	Inexpressibility Results for Regular Languages in Nonregular Settings. Developments in Language Theory Howard Straubing
2005	J	`jnl`	Some results on C-varieties. RAIRO Theor. Informatics Appl. Jean-Eric Pin, Howard Straubing
2003	J	`jnl`	Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. Theory Comput. Syst. Howard Straubing, Denis Thérien
2002	B	`conf`	On Logical Descriptions of Regular Languages. LATIN Howard Straubing
2002	B	`conf`	Weakly Iterated Block Products of Finite Monoids. LATIN Howard Straubing, Denis Thérien
2001	—	`ch.`	Characterizations of Regular Languages in Low Level Complexity Classes. Current Trends in Theoretical Computer Science Kevin J. Compton, Howard Straubing
2001	J	`jnl`	Languages Defined with Modular Counting Quantifiers. Inf. Comput. Howard Straubing
2001	A	`conf`	Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. STACS Howard Straubing, Denis Thérien
1999	J	`jnl`	Lower bounds for modular counting by circuits with modular gates. Comput. Complex. David A. Mix Barrington, Howard Straubing
1998	A	`conf`	Languages Defined With Modular Counting Quantifiers (Extended Abstract). STACS Howard Straubing
1997	J	`jnl`	Finite Semigroup Varieties Defined by Programs. Theor. Comput. Sci. Pierre Péladeau, Howard Straubing, Denis Thérien
1996	—	`conf`	Finite Models, Automata, and Circuit Complexity. Descriptive Complexity and Finite Models Howard Straubing
1995	B	`conf`	Lower Bounds for Modular Counting by Circuits with Modular Gates. LATIN David A. Mix Barrington, Howard Straubing
1995	J	`jnl`	Regular Languages Defined with Generalized Quanifiers Inf. Comput. Howard Straubing, Denis Thérien, Wolfgang Thomas
1995	J	`jnl`	Superlinear Lower Bounds for Bounded-Width Branching Programs. J. Comput. Syst. Sci. David A. Mix Barrington, Howard Straubing
1995	J	`jnl`	The Power of Local Self-Reductions Electron. Colloquium Comput. Complex. Richard Beigel, Howard Straubing
1995	—	`conf`	The Power of Local Self-Reductions. SCT Richard Beigel, Howard Straubing
1994	J	`jnl`	Complex Polynomials and Circuit Lower Bounds for Modular Counting. Comput. Complex. David A. Mix Barrington, Howard Straubing
1992	J	`jnl`	Characterizations of regular languages in low level complexity classes. Bull. EATCS Kevin J. Compton, Howard Straubing
1992	A*	`conf`	Circuit Complexity and the Expressive Power of Generalized First-Order Formulas. ICALP Howard Straubing
1992	B	`conf`	Complex Polynomials and Circuit Lower Bounds for Modular Counting. LATIN David A. Mix Barrington, Howard Straubing
1992	J	`jnl`	On a Conjecture Concerning Dot-Depth Two Languages. Theor. Comput. Sci. Howard Straubing, Pascal Weil
1992	J	`jnl`	Regular Languages in NC¹. J. Comput. Syst. Sci. David A. Mix Barrington, Kevin J. Compton, Howard Straubing, Denis Thérien
1992	J	`jnl`	Some Results on the Generalized Star-Height Problem Inf. Comput. Jean-Eric Pin, Howard Straubing, Denis Thérien
1991	J	`jnl`	Constant-Depth periodic Circuits. Int. J. Algebra Comput. Howard Straubing
1991	—	`conf`	Superlinear Lower Bounds for Bounded-Width Branching Programs. SCT David A. Mix Barrington, Howard Straubing
1990	J	`jnl`	Non-Uniform Automata Over Groups Inf. Comput. David A. Mix Barrington, Howard Straubing, Denis Thérien
1990	J	`jnl`	On Uniformity within NC¹. J. Comput. Syst. Sci. David A. Mix Barrington, Neil Immerman, Howard Straubing
1989	A	`conf`	New Results on the Generalized Star-Height Problem. STACS Jean-Eric Pin, Howard Straubing, Denis Thérien
1988	—	`conf`	Finite automata and computational complexity. Formal Properties of Finite Automata and Applications Howard Straubing, Denis Thérien
1988	—	`conf`	On uniformity within NC SCT David A. Mix Barrington, Neil Immerman, Howard Straubing
1988	J	`jnl`	Semigroups and Languages of Dot-Depth Two. Theor. Comput. Sci. Howard Straubing
1988	—	`conf`	The wreath product and its applications. Formal Properties of Finite Automata and Applications Howard Straubing
1988	A*	`conf`	regular Languages Defined with Generalized Quantifiers. ICALP Howard Straubing, Denis Thérien, Wolfgang Thomas
1987	J	`jnl`	Applications of the theory of automata in enumeration. Discret. Math. Howard Straubing
1986	A*	`conf`	Semigroups and Languages of Dot-Depth 2. ICALP Howard Straubing
1983	J	`jnl`	A combinatorial proof of the Cayley-Hamilton theorem. Discret. Math. Howard Straubing
1981	J	`jnl`	A Generalization of the Schützenberger Product of Finite Monoids. Theor. Comput. Sci. Howard Straubing
1981	J	`jnl`	Relationals Morphisms and Operations on Recognizable Sets. RAIRO Theor. Informatics Appl. Howard Straubing