On the public citation graph
On the maximum number of distinct factors of a binary string
0 signed · 24 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/bfb0057319openalex-snapshot
Combinatorial Theory Seminar Eindhoven University of Technology
inferredcites →https://doi.org/10.1137/1024041openalex-snapshot
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-23247-4_10openalex-snapshot
Generalized de Bruijn Words and the State Complexity of Conjugate Sets
inferred← citeshttps://doi.org/10.1007/978-3-540-27801-6_6openalex-snapshot
On the Average Sequence Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_44openalex-snapshot
Sublinear Algorithms for Approximating String Compressibility
inferred← citeshttps://doi.org/10.1007/978-3-642-38227-7_25openalex-snapshot
Descriptional Entropy: Application to Security Software Analysis
inferred← citeshttps://doi.org/10.1007/s00453-012-9618-6openalex-snapshot
Sublinear Algorithms for Approximating String Compressibility
inferred← citeshttps://doi.org/10.1016/j.disc.2009.08.002openalex-snapshot
Total palindrome complexity of finite words
inferred← citeshttps://doi.org/10.1016/j.disc.2024.113928openalex-snapshot
Subsequence frequency in binary words
inferred← citeshttps://doi.org/10.1016/j.ic.2021.104689openalex-snapshot
Maximal state complexity and generalized de Bruijn words
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.06.023openalex-snapshot
On average sequence complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.02.008openalex-snapshot
On semi-perfect de Bruijn words
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115732openalex-snapshot
On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00248-5openalex-snapshot
On the combinatorics of finite words
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00258-8openalex-snapshot
Complexity for finite factors of infinite sequences
inferred← citeshttps://doi.org/10.33993/jnaat332-767openalex-snapshot
Properties of the complexity function for finite words
inferred← citeshttps://doi.org/10.48550/arxiv.1605.02361openalex-snapshot
On the subword complexity of the fixed point of $a \rightarrow aab$, $b \rightarrow b$, and generalizations
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.