On the public citation graph

A unifying look at d-dimensional periodicities and space coverings

https://doi.org/10.1007/bfb0029807
0 signed · 30 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/3-540-51486-4_90openalex-snapshot
Knuth-Morris-Pratt algorithm: An analysis
inferredcites →https://doi.org/10.1007/3-540-52846-6_102openalex-snapshot
Fast algorithms for two dimensional and multiple pattern matching
inferredcites →https://doi.org/10.1007/978-1-4612-4752-4openalex-snapshot
Elliptic Functions
inferredcites →https://doi.org/10.1007/bfb0015775openalex-snapshot
Optimal parallel pattern matching in strings
inferredcites →https://doi.org/10.1109/sfcs.1992.267767openalex-snapshot
Truly alphabet-independent two-dimensional pattern matching
inferredcites →https://doi.org/10.1109/sfcs.1992.267791openalex-snapshot
Tighter bounds on the exact complexity of string matching
inferredcites →https://doi.org/10.1145/129712.129719openalex-snapshot
Alphabet independent two dimensional matching
inferredcites →https://doi.org/10.1145/129712.129720openalex-snapshot
A constant-time optimal parallel string-matching algorithm
inferredcites →https://doi.org/10.1145/66451.66459openalex-snapshot
A technique for two-dimensional pattern matching

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-58094-8_17openalex-snapshot
Dictionary-matching on unbounded alphabets: Uniform length dictionaries
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_70openalex-snapshot
Optimal two-dimensional compressed matching
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_246openalex-snapshot
Multidimensional Compressed Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-030-59212-7_9openalex-snapshot
Multidimensional Period Recovery
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_5openalex-snapshot
Cycle Detection and Correction
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_73openalex-snapshot
Closest Periodic Vectors in L p Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-34109-0_1openalex-snapshot
Approximate Period Detection and Correction
inferred← citeshttps://doi.org/10.1007/bfb0017478openalex-snapshot
Generalizations of the periodicity theorem of Fine and Wilf
inferred← citeshttps://doi.org/10.1016/j.ic.2015.02.004openalex-snapshot
Approximate periodicity
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.08.012openalex-snapshot
A multidimensional critical factorization theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.019openalex-snapshot
Closest periodic vectors in Lp spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.06.016openalex-snapshot
Two-dimensional comma-free and cylindric codes
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)00277-6openalex-snapshot
Analysis of two-dimensional approximate pattern matching algorithms
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.1137/s0097539795298321openalex-snapshot
Two-Dimensional Periodicity in Rectangular Arrays
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/2390176.2390189openalex-snapshot
Cycle detection and correction
inferred← citeshttps://doi.org/10.3934/dcds.2025152openalex-snapshot
Shifts of finite type obtained by forbidding a single pattern
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.