On the public citation graph
On the exponent of periodicity of minimal solutions of context equations
0 signed · 50 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.1006/jsco.1996.0009openalex-snapshot
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
inferredcites →https://doi.org/10.1007/3-540-61464-8_60openalex-snapshot
An algorithm for distributive unification
inferredcites →https://doi.org/10.1007/3-540-61464-8_63openalex-snapshot
Linear second-order unification
inferredcites →https://doi.org/10.1007/3-540-63104-6_4openalex-snapshot
On equality up-to constraints over finite trees, context unification, and one-step rewriting
inferredcites →https://doi.org/10.1016/0168-0072(88)90015-2openalex-snapshot
A unification algorithm for second-order monadic terms
inferredcites →https://doi.org/10.1016/0304-3975(75)90011-0openalex-snapshot
A unification algorithm for typed λ-calculus
inferredcites →https://doi.org/10.1016/0304-3975(81)90040-2openalex-snapshot
The undecidability of the second-order unification problem
inferredcites →https://doi.org/10.1016/0304-3975(91)90024-vopenalex-snapshot
On the existence of speed-independent circuits
inferredcites →https://doi.org/10.1016/s0304-3975(06)80003-4openalex-snapshot
Simple second-order languages for which unification is undecidable
inferredcites →https://doi.org/10.1016/s0747-7171(89)80023-9openalex-snapshot
Higher-order unification revisited: Complete sets of transformations
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1145/234533.234543openalex-snapshot
Complexity of Makanin's algorithm
inferredcites →https://doi.org/10.1145/321752.321764openalex-snapshot
A Complete Mechanization of Second-Order Type Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2001.0438openalex-snapshot
Solvability of Context Equations with Two Context Variables is Decidable
inferred← citeshttps://doi.org/10.1007/10721975openalex-snapshot
Rewriting Techniques and Applications: 11th International Conference, RTA 2000, Norwich, UK, July 10-12, 2000 Proceedings
inferred← citeshttps://doi.org/10.1007/10721975_11openalex-snapshot
Linear Second-Order Unification and Context Unification with Tree-Regular Constraints
inferred← citeshttps://doi.org/10.1007/11805618_30openalex-snapshot
Bounded Second-Order Unification Is NP-Complete
inferred← citeshttps://doi.org/10.1007/11814771_8openalex-snapshot
Stratified Context Unification Is NP-Complete
inferred← citeshttps://doi.org/10.1007/3-540-44802-0_35openalex-snapshot
Stratified Context Unification Is in PSPACE
inferred← citeshttps://doi.org/10.1007/3-540-45127-7_14openalex-snapshot
Context Unification and Traversal Equations
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_23openalex-snapshot
Currying Second-Order Unification Problems
inferred← citeshttps://doi.org/10.1007/3-540-45738-0_12openalex-snapshot
Dominance Constraints in Context Unification
inferred← citeshttps://doi.org/10.1007/3-540-45793-3_35openalex-snapshot
Decidability of Bounded Higher-Order Unification
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_5openalex-snapshot
Solvability of Context Equations with Two Context Variables Is Decidable
inferred← citeshttps://doi.org/10.1007/978-3-030-24886-4_2openalex-snapshot
Deciding Context Unification (with Regular Constraints)
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_4openalex-snapshot
Recompression: Technique for Word Equations and Compressed Data
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_38openalex-snapshot
Regular Patterns in Second-Order Unification
inferred← citeshttps://doi.org/10.1007/978-3-540-25979-4_4openalex-snapshot
Monadic Second-Order Unification Is NP-Complete
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_10openalex-snapshot
Decidable Variants of Higher-Order Unification
inferred← citeshttps://doi.org/10.1007/978-3-642-58322-3_14openalex-snapshot
Die Verarbeitung von Parallelismus-Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_21openalex-snapshot
Context Unification is in PSPACE
inferred← citeshttps://doi.org/10.1007/bfb0055810openalex-snapshot
∀∃*-Equational theory of context unification is π10-hard
inferred← citeshttps://doi.org/10.1007/s00224-004-1151-9openalex-snapshot
The Complexity of Linear and Stratified Context Matching Problems
inferred← citeshttps://doi.org/10.1016/j.ic.2003.08.002openalex-snapshot
Decidability of bounded second order unification
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.09.009openalex-snapshot
Dominance constraints in stratified context unification
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.01.005openalex-snapshot
Decidability of bounded higher-order unification
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.10.005openalex-snapshot
Context unification with one context variable
inferred← citeshttps://doi.org/10.1016/j.jsc.2009.07.001openalex-snapshot
On the relation between Context and Sequence Unification
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00190-6openalex-snapshot
∀∃5-equational theory of context unification is undecidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00081-4openalex-snapshot
A decision algorithm for distributive unification
inferred← citeshttps://doi.org/10.1023/a:1017964622902openalex-snapshot
The Constraint Language for Lambda Structures
inferred← citeshttps://doi.org/10.1093/jigpal/jzq010openalex-snapshot
On the complexity of Bounded Second-Order Unification and Stratified Context Unification
inferred← citeshttps://doi.org/10.1137/050645403openalex-snapshot
The Complexity of Monadic Second-Order Unification
inferred← citeshttps://doi.org/10.1145/1055558.1055585openalex-snapshot
Conjunctive queries over trees
inferred← citeshttps://doi.org/10.1145/1131342.1131345openalex-snapshot
Conjunctive queries over trees
inferred← citeshttps://doi.org/10.1145/1970398.1970402openalex-snapshot
Unification and matching on compressed terms
inferred← citeshttps://doi.org/10.29007/zhpcopenalex-snapshot
Bounded Higher-order Unification using Regular Terms
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0602004openalex-snapshot
Conjunctive Queries over Trees
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.