On the public citation graph

Generalizations of the periodicity theorem of Fine and Wilf

https://doi.org/10.1007/bfb0017478
0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0029807openalex-snapshot
A unifying look at d-dimensional periodicities and space coverings
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferredcites →https://doi.org/10.1016/c2009-0-21955-6openalex-snapshot
Digital Picture Processing
inferredcites →https://doi.org/10.1090/conm/109openalex-snapshot
Combinatorial Group Theory
inferredcites →https://doi.org/10.1090/s0002-9939-1965-0174934-9openalex-snapshot
Uniqueness Theorems for Periodic Functions
inferredcites →https://doi.org/10.1109/sfcs.1992.267767openalex-snapshot
Truly alphabet-independent two-dimensional pattern matching
inferredcites →https://doi.org/10.1137/0220063openalex-snapshot
On the Exact Complexity of String Matching: Lower Bounds
inferredcites →https://doi.org/10.1307/mmj/1028998766openalex-snapshot
The equation $a^M=b^Nc^P$ in a free group.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jagm.1996.0844openalex-snapshot
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_18openalex-snapshot
A periodicity lemma for partial words
inferred← citeshttps://doi.org/10.1007/978-3-319-92016-0_16openalex-snapshot
How Much Different Are Two Words with Different Shortest Periods
inferred← citeshttps://doi.org/10.1007/978-3-540-32439-3_18openalex-snapshot
Periodicity and Almost-Periodicity
inferred← citeshttps://doi.org/10.1016/j.dam.2006.07.001openalex-snapshot
Testing primitivity on partial words
inferred← citeshttps://doi.org/10.1016/j.dam.2006.11.017openalex-snapshot
Periodicity and repetitions in parameterized strings
inferred← citeshttps://doi.org/10.1016/j.endm.2005.07.030openalex-snapshot
Periodicity and Repetitions in Parameterized Strings
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.012openalex-snapshot
A multidimensional critical factorization theorem
inferred← citeshttps://doi.org/10.1016/s0019-3577(03)90076-0openalex-snapshot
Fine and Wilf words for any periods
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00248-2openalex-snapshot
Periodicity vectors for labelled trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00226-2openalex-snapshot
On Fine and Wilf's theorem for bidimensional words
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00386-3openalex-snapshot
On a conjecture on bidimensional words
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00072-8openalex-snapshot
Periodicities on trees
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00182-0openalex-snapshot
Fibonacci arrays and their two-dimensional repetitions
inferred← citeshttps://doi.org/10.1090/s0002-9939-03-06970-3openalex-snapshot
Multi-dimensional versions of a theorem of Fine and Wilf and a formula of Sylvester
inferred← citeshttps://doi.org/10.1142/s0218001401001349openalex-snapshot
OPTIMALLY FAST CRCW-PRAM TESTING 2D-ARRAYS FOR EXISTENCE OF REPETITIVE PATTERNS
inferred← citeshttps://doi.org/10.1145/584792.584832openalex-snapshot
On the efficient evaluation of relaxed queries in biological databases
inferred← citeshttps://doi.org/10.36045/bbms/1103408547openalex-snapshot
Logic and {$p$}-recognizable sets of integers
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.