On the public citation graph

Partial communations

https://doi.org/10.1007/bfb0035789
0 signed · 38 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/3-540-16761-7_75openalex-snapshot
On recognizable subsets of free partially commutative monoids
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_23openalex-snapshot
Words over a Partially Commutative Alphabet
inferredcites →https://doi.org/10.1007/bf00993053openalex-snapshot
Inhomogeneous sorting
inferredcites →https://doi.org/10.1007/bfb0079468openalex-snapshot
Problèmes combinatoires de commutation et réarrangements
inferredcites →https://doi.org/10.1016/0020-0190(86)90056-6openalex-snapshot
Square-free words on partially commutative free monoids
inferredcites →https://doi.org/10.1016/0304-3975(85)90206-3openalex-snapshot
Maximal serializability of iterated transactions
inferredcites →https://doi.org/10.1016/0304-3975(86)90028-9openalex-snapshot
On some equations in free partially commutative monoids
inferredcites →https://doi.org/10.1016/0304-3975(87)90080-6openalex-snapshot
On regular trace languages
inferredcites →https://doi.org/10.1016/0304-3975(88)90027-8openalex-snapshot
On recognizable subsets of free partially commutative monoids
inferredcites →https://doi.org/10.1016/0304-3975(88)90051-5openalex-snapshot
Theory of traces
inferredcites →https://doi.org/10.1051/ita/1985190100211openalex-snapshot
Automates et commutations partielles
inferredcites →https://doi.org/10.1051/ita/1986200201031openalex-snapshot
Trace languages defined by regular string languages
inferredcites →https://doi.org/10.1051/ita/1986200201211openalex-snapshot
Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.21236/ada208996openalex-snapshot
Chapter on Distributed Computing

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-52282-4_38openalex-snapshot
Combinatorial rewriting on traces
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_11openalex-snapshot
Partially commutative formal power series
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_12openalex-snapshot
Infinite traces
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_139openalex-snapshot
A Kleene theorem for infinite trace languages
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_56openalex-snapshot
Recognizable complex trace languages (abstract)
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_179openalex-snapshot
A survey of recognizable languages of infinite traces
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_106openalex-snapshot
Asynchronous cellular automata for infinite traces
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_68openalex-snapshot
Semi-commutations and rational expressions
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_24openalex-snapshot
Poset properties of complex traces
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_26openalex-snapshot
Partially commutative Lyndon words
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_154openalex-snapshot
Coding with traces
inferred← citeshttps://doi.org/10.1007/3-540-59042-0_89openalex-snapshot
Coding and strong coding in trace monoids
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_149openalex-snapshot
On congruences and partial orders
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_7openalex-snapshot
Graphs for Generalized Traces
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_1openalex-snapshot
Automated Synthesis of Application-Layer Connectors from Automata-Based Specifications
inferred← citeshttps://doi.org/10.1007/bf01200264openalex-snapshot
Recognizable trace languages, distributed automata and the distribution problem
inferred← citeshttps://doi.org/10.1007/bfb0020790openalex-snapshot
Recognizable and rational languages of finite and infinite traces
inferred← citeshttps://doi.org/10.1016/0034-4877(94)90017-5openalex-snapshot
Combinatorial objects enumerated by q-bessel functions
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90247-qopenalex-snapshot
The poset of infinitary traces
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00336-4openalex-snapshot
Resource traces: a domain for processes sharing exclusive resources
inferred← citeshttps://doi.org/10.1051/ita/1993270100071openalex-snapshot
On the structure of recognizable languages of dependence graphs
inferred← citeshttps://doi.org/10.1080/00927872.2012.677080openalex-snapshot
Gröbner-Shirshov Bases for Free Partially Commutative Lie Algebras
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.