Howard Straubing

2.8k total citations
50 papers, 1.2k citations indexed

About

Howard Straubing is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Howard Straubing has authored 50 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computational Theory and Mathematics, 28 papers in Artificial Intelligence and 4 papers in Geometry and Topology. Recurrent topics in Howard Straubing's work include semigroups and automata theory (40 papers), Advanced Algebra and Logic (17 papers) and Logic, programming, and type systems (13 papers). Howard Straubing is often cited by papers focused on semigroups and automata theory (40 papers), Advanced Algebra and Logic (17 papers) and Logic, programming, and type systems (13 papers). Howard Straubing collaborates with scholars based in United States, France and Canada. Howard Straubing's co-authors include Neil Immerman, Denis Thérien, David A. Mix Barrington, Christophe Reutenauer, Kevin J. Compton, Jean-Éric Pin, Amitabha Roy, Mikołaj Bojańczyk, Wolfgang Thomas and Luc Segoufin and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and American Mathematical Monthly.

In The Last Decade

Howard Straubing

49 papers receiving 1.1k citations

Peers

Howard Straubing

CTM

AI

MB

GT

CNC

Rod Downey New Zealand

Werner Kuich Austria

Denis Thérien Canada

Azaria Paz Israel

Yechezkel Zalcstein United States

Seinosuke Toda Japan

Zoltán Ésik Hungary

Volker Diekert Germany

M. Lothaire United Kingdom

Johann A. Makowsky Israel

Rod Downey New Zealand

Howard Straubing

1.2k ×1.1

CTM

344 ×0.5

AI

62 ×0.5

MB

259 ×2.4

GT

189 ×2.5

CNC

Citations per year, relative to Howard Straubing Howard Straubing (= 1×) peers Rod Downey

Countries citing papers authored by Howard Straubing

Since Specialization

Citations

This map shows the geographic impact of Howard Straubing's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Howard Straubing with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Howard Straubing more than expected).

Fields of papers citing papers by Howard Straubing

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Howard Straubing. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Howard Straubing. The network helps show where Howard Straubing may publish in the future.

Co-authorship network of co-authors of Howard Straubing

This figure shows the co-authorship network connecting the top 25 collaborators of Howard Straubing. A scholar is included among the top collaborators of Howard Straubing based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Howard Straubing. Howard Straubing is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Krebs, Andreas, Kamal Lodaya, Paritosh K. Pandya, & Howard Straubing. (2020). Two-variable logics with some betweenness relations: Expressiveness, satisfiability and membership. SHILAP Revista de lepidopterología. 3 indexed citations

2.

Bojańczyk, Mikołaj, Luc Segoufin, & Howard Straubing. (2012). Piecewise testable tree languages. Logical Methods in Computer Science. Volume 8, Issue 3. 5 indexed citations

3.

Bojańczyk, Mikołaj, Igor Walukiewicz, & Howard Straubing. (2012). Wreath Products of Forest Algebras, with Applications to Tree Logics. Logical Methods in Computer Science. Volume 8, Issue 3. 2 indexed citations

4.

Bojańczyk, Mikołaj, Luc Segoufin, & Howard Straubing. (2008). Piecewise Testable Tree Languages. 3404. 442–451. 15 indexed citations

5.

Straubing, Howard, et al.. (2006). Actions, wreath products of C-varieties and concatenation product. Theoretical Computer Science. 356(1-2). 73–89. 11 indexed citations

6.

Roy, Amitabha, et al.. (2005). Bounds on an exponential sum arising in Boolean circuit complexity. Comptes Rendus Mathématique. 341(5). 279–282. 21 indexed citations

7.

Barrington, David A. Mix & Howard Straubing. (1995). Superlinear Lower Bounds for Bounded-Width Branching Programs. Journal of Computer and System Sciences. 50(3). 374–381. 19 indexed citations

8.

Straubing, Howard, Denis Thérien, & Wolfgang Thomas. (1995). Regular Languages Defined with Generalized Quantifiers. Information and Computation. 118(2). 289–301. 23 indexed citations

9.

Compton, Kevin J. & Howard Straubing. (1992). Characterizations of regular languages in low level complexity classes. Bulletin of the European Association for Theoretical Computer Science. 48. 134–142. 5 indexed citations

10.

Barrington, David A. Mix, Kevin J. Compton, Howard Straubing, & Denis Thérien. (1992). Regular languages in NC1. Journal of Computer and System Sciences. 44(3). 478–499. 53 indexed citations

11.

Immerman, Neil, et al.. (1990). On uniformity within NC1. Journal of Computer and System Sciences. 41(3). 274–306. 257 indexed citations

12.

Straubing, Howard, et al.. (1990). Non-uniform automata over groups. Information and Computation. 89(2). 109–132. 70 indexed citations

13.

Straubing, Howard. (1988). Semigroups and languages of dot-depth two. Theoretical Computer Science. 58(1-3). 361–378. 33 indexed citations

14.

Straubing, Howard. (1987). Applications of the theory of automata in enumeration. Discrete Mathematics. 64(2-3). 269–279. 2 indexed citations

15.

Pin, Jean‐Philippe & Howard Straubing. (1985). Monoids of upper triangular matrices. 12 indexed citations

16.

Straubing, Howard. (1985). Finite semigroup varieties of the form V ∗ D. Journal of Pure and Applied Algebra. 36. 53–94. 98 indexed citations

17.

Reutenauer, Christophe & Howard Straubing. (1984). Inversion of matrices over a commutative semiring. Journal of Algebra. 88(2). 350–360. 47 indexed citations

18.

Straubing, Howard. (1983). A combinatorial proof of the Cayley-Hamilton theorem. Discrete Mathematics. 43(2-3). 273–279. 27 indexed citations

19.

Straubing, Howard. (1979). Families of recognizable sets corresponding to certain varieties of finite monoids. Journal of Pure and Applied Algebra. 15(3). 305–318. 34 indexed citations

20.

Straubing, Howard. (1979). Aperiodic homomorphisms and the concatenation product of recognizable sets. Journal of Pure and Applied Algebra. 15(3). 319–327. 32 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact