Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Straubing, Howard"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An effective characterization of the alternation hierarchy in two-variable logic
Andreas Krebs
,
Howard Straubing
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 86-98
Definability of languages by generalized first-order formulas over (N,
+
)
Amitabha Roy
,
Howard Straubing
SIAM Journal on Computing
37
(2), 2007, pp. 502-521
Actions, wreath products of
C
-varieties and concatenation product
Laura Chaubard
,
Jean-Éric Pin
,
Howard Straubing
Theoretical Computer Science
356
(1-2), 2006, pp. 73-89
Definability of languages by generalized first-order formulas over (N, +)
Amitabha Roy
,
Howard Straubing
Lecture Notes in Computer Science
3884
, 2006, pp. 489-499
A note on MOD
_p
- MOD
m
circuits
Howard Straubing
,
Denis Thérien
Theory of Computing Systems
39
(5), 2006, pp. 699-706
Regular languages defined by generalized first-order formulas with a bounded number of bound variables
Howard Straubing
,
Denis Thérien
Theory of Computing Systems
36
(1), 2003, pp. 29-69
Regular languages defined by generalized first-order formulas with a bounded number of bound variables
Howard Straubing
,
Denis Thérien
Lecture Notes in Computer Science
2010
, 2001, pp. 551-562
Languages defined with modular counting quantifiers
Howard Straubing
Information and Computation
166
(2), 2001, pp. 112-132
Languages defined with modular counting quantifiers
Howard Straubing
Lecture Notes in Computer Science
1373
, 1998, pp. 332-343
Finite semigroup varieties defined by programs
Pierre Péladeau
,
Howard Straubing
,
Denis Thérien
Theoretical Computer Science
180
(1-2), 1997, pp. 325-339
Finite models, automata, and circuit complexity
Howard Straubing
DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
31
, 1997, pp. 63-96
Superlinear lower bounds for bounded-width branching programs
David A. Mix Barrington
,
Howard Straubing
Journal of Computer and System Sciences
50
(3), 1995, pp. 374-381
Lower bounds for modular counting by circuits with modular gates
David Mix Barrington
,
Howard Straubing
Lecture Notes in Computer Science
911
, 1995, pp. 60-71
The power of local self-reductions
Richard Beigel
,
Howard Straubing
Proceedings of the Tenth Annual Conference on Structure in Complexity Theory (Minneapolis, Minnesota, June 19-22, 1995)
, 1995, pp. 277-285
Regular languages defined with generalized quantifiers
Howard Straubing
,
Denis Thérien
,
Wolfgang Thomas
Information and Computation
118
(2), 1995, pp. 289-301
Regular languages in
NC^1
David A. Mix Barrington
,
Kevin Compton
,
Howard Straubing
,
Denis Thérien
Journal of Computer and System Sciences
44
, 1992, pp. 478-499
Complex polynomials and circuit lower bounds for modular counting
David A. Mix Barrington
,
Howard Straubing
Lecture Notes in Computer Science
583
, 1992, pp. 24-31
Circuit complexity and the expressive power of generalized first-order formulas
Howard Straubing
Lecture Notes in Computer Science
623
, 1992, pp. 16-27
Superlinear lower bounds for bounded-width branching programs
David A. Mix Barrington
,
Howard Straubing
Proceedings of the 6th Annual Conference on Structure in Complexity Theory, CSCT'91 (Chicago, Illinois, June 30-July 3, 1991)
, 1991, pp. 305-313
Constant-depth periodic circuits
Howard Straubing
International Journal of Algebra and Computation
1
(1), 1991, pp. 49-87
Non-uniform automata over groups
David A. Mix Barrington
,
Howard Straubing
,
Denis Thérien
Information and Computation
89
(2), 1990, December, pp. 109-132
Semigroups and languages of dot-depth two
Howard Straubing
Theoretical Computer Science
58
, 1988, pp. 361-378