On the public citation graph

A note on unique decipherability

https://doi.org/10.1007/bfb0030289
0 signed · 20 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/978-3-642-82456-2_5openalex-snapshot
Algorithms for Factorizing and Testing Subsemigroups
inferredcites →https://doi.org/10.1007/bf02194863openalex-snapshot
Quelques Constructions Et Algorithmes Relatifs Aux Sous-Monoïdes D'un Monoïde Libre
inferredcites →https://doi.org/10.1016/0020-0190(84)90020-6openalex-snapshot
Pattern Matching Machine implementation of a fast test for unique decipherability
inferredcites →https://doi.org/10.1109/tit.1979.1056005openalex-snapshot
A note on uniquely decipherable codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1982.1056535openalex-snapshot
A fast test for unique decipherability based on suffix trees (Corresp.)
inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot
SEMIGROUPS AND COMBINATORIAL APPLICATIONS
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/360825.360855openalex-snapshot
Efficient string matching
inferredcites →https://doi.org/10.1307/mmj/1028999307openalex-snapshot
Free subsemigroups of a free semigroup.

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-642-82456-2_5openalex-snapshot
Algorithms for Factorizing and Testing Subsemigroups
inferred← citeshttps://doi.org/10.1007/bfb0016249openalex-snapshot
Unique decipherability for partially commutative alphabet (extended abstract)
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90121-3openalex-snapshot
The space complexity of the unique decipherability problem
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90278-xopenalex-snapshot
A fast algorithm for the unique decipherability of multivalued encodings
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.030openalex-snapshot
Parsing with a finite dictionary
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.007openalex-snapshot
Automata for solid codes
inferred← citeshttps://doi.org/10.1109/18.370097openalex-snapshot
Deciding multiset decipherability
inferred← citeshttps://doi.org/10.1109/18.45290openalex-snapshot
An efficient algorithm for testing immutability of variable-length codes
inferred← citeshttps://doi.org/10.1109/18.930915openalex-snapshot
On unique, multiset, and set decipherability of three-word codes
inferred← citeshttps://doi.org/10.1109/18.9779openalex-snapshot
On the characterization of statistically synchronizable variable-length codes
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.