The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Howard Straubing: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  39. Piecewise Testable Tree Languages. [Citation Graph (, )][DBLP]


  40. Wreath Products of Forest Algebras, with Applications to Tree Logics. [Citation Graph (, )][DBLP]


Search in 0.026secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002