On the public citation graph
Inhomogeneous sorting
0 signed · 23 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.
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-45841-7_41openalex-snapshot
Existential and Positive Theories of Equations in Graph Products
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_45openalex-snapshot
Solvability of Equations in Free Partially Commutative Groups Is decidable
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_64openalex-snapshot
Computing the closure of sets of words under partial commutations
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_190openalex-snapshot
Solving trace equations using lexicographical normal forms
inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_22openalex-snapshot
Number of Prefixes in Trace Monoids: Clique Polynomials and Dependency Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-40579-2_11openalex-snapshot
The Lexicographic Cross-Section of the Plactic Monoid Is Regular
inferred← citeshttps://doi.org/10.1007/978-3-642-54792-8_1openalex-snapshot
A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_8openalex-snapshot
Partial Commutation and Traces
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_13openalex-snapshot
Finding k Partially Disjoint Paths in a Directed Planar Graph
inferred← citeshttps://doi.org/10.1007/s00026-014-0249-2openalex-snapshot
Structure and Enumeration of (3+1)-Free Posets
inferred← citeshttps://doi.org/10.1007/s00224-024-10173-zopenalex-snapshot
The Power Word Problem in Graph Products
inferred← citeshttps://doi.org/10.1007/s11334-019-00347-1openalex-snapshot
Certified normalization of generalized traces
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00032-eopenalex-snapshot
Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00130-1openalex-snapshot
Logical definability on infinite traces
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100677openalex-snapshot
Operational semantics with semicommutations
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00313-2openalex-snapshot
Solving word equations modulo partial commutations
inferred← citeshttps://doi.org/10.1090/tran/7183openalex-snapshot
On the length of fully commutative elements
inferred← citeshttps://doi.org/10.1109/dcc.2003.1194006openalex-snapshot
On compressing interchange classes of events in a concurrent system
inferred← citeshttps://doi.org/10.1109/tit.2004.830754openalex-snapshot
Compression of Words Over a Partially Commutative Alphabet
inferred← citeshttps://doi.org/10.1142/s0218196706003372openalex-snapshot
SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE
inferred← citeshttps://doi.org/10.70675/b8c9913aze055z43bdz863czb01f1010420fopenalex-snapshot
Automated Verification of Privacy in Security Protocols : Back and Forth Between Theory & Practice
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.