On the public citation graph
Optimal left-to-right pattern-matching automata
0 signed · 31 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.1002/spe.4380151205openalex-snapshot
Implementation of an interpreter for abstract equations
inferredcites →https://doi.org/10.1007/3-540-15648-8_20openalex-snapshot
Equational logic as a programming language: Abstract
inferredcites →https://doi.org/10.1007/3-540-52592-0_68openalex-snapshot
The specificity rule for lazy pattern-matching in ambiguous term rewrite systems
inferredcites →https://doi.org/10.1007/3-540-53904-2_107openalex-snapshot
Left-to-right tree 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/11403937_45openalex-snapshot
Complete Pattern Matching: Recursivity Versus Multi-threading
inferred← citeshttps://doi.org/10.1007/3-540-32498-4openalex-snapshot
Genetic Systems Programming: Theory and Experiences
inferred← citeshttps://doi.org/10.1007/3-540-32498-4_4openalex-snapshot
Evolutionary Pattern Matching Using Genetic Programming
inferred← citeshttps://doi.org/10.1007/3-540-36390-4_19openalex-snapshot
Minimal Adaptive Pattern-Matching Automata for Efficient Term Rewriting
inferred← citeshttps://doi.org/10.1007/3-540-44888-8_22openalex-snapshot
More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
inferred← citeshttps://doi.org/10.1007/3-540-45034-3_42openalex-snapshot
Efficient Pattern Matching for Non-strongly Sequential Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/3-540-45517-5_97openalex-snapshot
Improving Space, Time, and Termination in Rewriting-Based Programming
inferred← citeshttps://doi.org/10.1007/3-540-48035-8_74openalex-snapshot
Optimal Adaptive Pattern Matching
inferred← citeshttps://doi.org/10.1007/bfb0056617openalex-snapshot
A compiler for rewrite programs in associative-commutative theories
inferred← citeshttps://doi.org/10.1016/j.jda.2004.08.007openalex-snapshot
More efficient left-to-right matching for overlapping pattern
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80335-4openalex-snapshot
Dynamic Deterministic Pattern-Matching
inferred← citeshttps://doi.org/10.1017/s0956796800003907openalex-snapshot
Promoting rewriting to a programming language: a compiler for non-deterministic rewrite programs in associative-commutative theories
inferred← citeshttps://doi.org/10.1142/s0219649206001591openalex-snapshot
Complete Pattern Matching for DNA Computing
inferred← citeshttps://doi.org/10.1145/3149869.3149871openalex-snapshot
Efficient Pattern Matching in Python
inferred← citeshttps://doi.org/10.1145/3168804openalex-snapshot
The generalized matrix chain algorithm
inferred← citeshttps://doi.org/10.1145/3179541.3168804openalex-snapshot
The generalized matrix chain algorithm
inferred← citeshttps://doi.org/10.1145/3567512.3567519openalex-snapshot
Optimising First-Class Pattern Matching
inferred← citeshttps://doi.org/10.1145/568600.568612openalex-snapshot
Efficient concise deterministic pattern-matching automata for ambiguous patterns
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.25080/shinma-7f4c6e7-000openalex-snapshot
Proceedings of the 16th Python in Science Conference
inferred← citeshttps://doi.org/10.25080/shinma-7f4c6e7-00bopenalex-snapshot
MatchPy: A Pattern Matching Library
inferred← citeshttps://doi.org/10.48550/arxiv.1705.00907openalex-snapshot
Non-linear Associative-Commutative Many-to-One Pattern Matching with Sequence Variables
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.