VLDB 2026 Research / reviewers in the wild / expert
Benjamin Steinberg
dblp:15/917
· DBLP profile ↗
15ranked-venue papers
4as first author
1since 2021 · last 2021
0000-0003-3636-4255ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 15 · 4 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | Pointlike Sets and Separation: A Personal Perspective
Benjamin Steinberg |
DLT | 1 |
| 2017 | Pro-Aperiodic Monoids via Saturated ModelsabstractWe apply Stone duality and model theory to study the structure theory of free pro-aperiodic monoids. Stone duality implies that elements of the free pro-aperiodic monoid may be viewed as elementary equivalence classes of pseudofinite words. Model theory provides us with saturated words in each such class, i.e., words in which all possible factorizations are realized. We give several applications of this new approach, including a solution to the word problem for omega-terms that avoids using McCammond's normal forms, as well as new proofs and extensions of other structural results concerning free pro-aperiodic monoids. Samuel Jacob van Gool, Benjamin Steinberg |
STACS | 2 |
| 2015 | Rational subsets and submonoids of wreath products
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche |
Inf. Comput. | 2 |
| 2013 | Rational Subsets and Submonoids of Wreath Products
Markus Lohrey, Benjamin Steinberg, Georg Zetzsche |
ICALP (2) | 2 |
| 2012 | The Krohn-Rhodes Theorem and Local DivisorsabstractWe give a new proof of the Krohn-Rhodes theorem using local divisors. The proof provides nearly as good a decomposition in terms of size as the holonomy decomposition of Eilenberg, avoids induction on the size of the state set, and works exclusively Volker Diekert, Manfred Kufleitner, Benjamin Steinberg |
Fundam. Informaticae | 3 |
| 2011 | Tilings and Submonoids of Metabelian Groups
Markus Lohrey, Benjamin Steinberg |
Theory Comput. Syst. | 2 |
| 2011 | The Černý conjecture for one-cluster automata with prime length cycle
Benjamin Steinberg |
Theor. Comput. Sci. | 1 |
| 2010 | The Averaging Trick and the Cerný Conjecture
Benjamin Steinberg |
Developments in Language Theory | 1 |
| 2009 | Matrix Mortality and the Cerný-Pin Conjecture
Jorge Almeida 0001, Benjamin Steinberg |
Developments in Language Theory | 2 |
| 2008 | Subsequence Counting, Matrix Representations and a Theorem of Eilenberg
Benjamin Steinberg |
LATA | 1 |
| 2007 | The submonoid and rational subset membership problems for graph groups
Markus Lohrey, Benjamin Steinberg |
LATA | 2 |
| 2006 | Synchronizing groups and automata
Fredrick Arnold, Benjamin Steinberg |
Theor. Comput. Sci. | 2 |
| 2005 | Constructing divisions into power groups
Karl Auinger, Benjamin Steinberg |
Theor. Comput. Sci. | 2 |
| 2004 | Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups
John L. Rhodes 0001, Benjamin Steinberg |
LATIN | 2 |
| 2002 | Extensions and submonoids of automatic monoids
Pedro V. Silva, Benjamin Steinberg |
Theor. Comput. Sci. | 2 |