On the public citation graph
Unification in datastructure multisets
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.1007/3-540-15976-2_19openalex-snapshot
An algebraic approach to unification under associativity and commutativity
inferredcites →https://doi.org/10.1007/3-540-15976-2_22openalex-snapshot
Complexity of matching problems
inferredcites →https://doi.org/10.1007/978-0-387-34768-4_12openalex-snapshot
Associative-Commutative Unification
inferredcites →https://doi.org/10.1016/0020-0190(78)90078-9openalex-snapshot
An algorithm to generate the basis of solutions to homogeneous linear diophantine equations
inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot
A Machine-Oriented Logic Based on the Resolution Principle
inferredcites →https://doi.org/10.1145/322261.322262openalex-snapshot
A Unification Algorithm for Associative-Commutative Functions
inferredcites →https://doi.org/10.1145/362686.362694openalex-snapshot
Algorithm and bound for the greatest common divisor of n integers
inferredcites →https://doi.org/10.21236/ada015846openalex-snapshot
A Complete Unification Algorithm for Associative-Commutative Functions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jabr.1997.7212openalex-snapshot
Unification in Commutative Semigroups
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_112openalex-snapshot
Unification in the data structure sets
inferred← citeshttps://doi.org/10.1007/3-540-16780-3_118openalex-snapshot
Unification in many-sorted equational theories
inferred← citeshttps://doi.org/10.1007/3-540-56944-8_51openalex-snapshot
Deciding in HFS-theory via linear integer programming
inferred← citeshttps://doi.org/10.1007/bf00252179openalex-snapshot
Linear and unit-resulting refutations for Horn theories
inferred← citeshttps://doi.org/10.1007/bfb0012843openalex-snapshot
Adventures in associative-commutative unification (A summary)
inferred← citeshttps://doi.org/10.1007/bfb0012853openalex-snapshot
Solving disequations in equational theories
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90140-5openalex-snapshot
Unification in commutative idempotent monoids
inferred← citeshttps://doi.org/10.1016/s0004-3702(96)00033-1openalex-snapshot
Ramification and causality
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80001-9openalex-snapshot
An algebraic approach to unification under associativity and commutativity
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80065-2openalex-snapshot
Embedding boolean expressions into logic programming
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80025-2openalex-snapshot
Efficient solution of linear diophantine equations
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80026-4openalex-snapshot
Adventures in associative-commutative unification
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80037-9openalex-snapshot
Unification in permutative equational theories is undecidable
inferred← citeshttps://doi.org/10.1016/s0747-7171(89)80055-0openalex-snapshot
Unification in commutative theories
inferred← citeshttps://doi.org/10.1145/174130.174133openalex-snapshot
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
inferred← citeshttps://doi.org/10.1145/179812.179813openalex-snapshot
On solving equations and disequations
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.