On the public citation graph
An algebraic approach to communication complexity
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.
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/978-1-4613-2215-3openalex-snapshot
Varieties of Formal Languages
inferredcites →https://doi.org/10.1007/bf01212963openalex-snapshot
NC1: The automata-theoretic viewpoint
inferredcites →https://doi.org/10.1016/0022-0000(89)90037-8openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
inferredcites →https://doi.org/10.1016/0022-0000(92)90047-mopenalex-snapshot
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
inferredcites →https://doi.org/10.1016/0022-0000(93)90039-yopenalex-snapshot
Functions with bounded symmetric communication complexity, programs over commutative monoids, and ACC
inferredcites →https://doi.org/10.1016/0022-4049(88)90097-7openalex-snapshot
Locally trivial categories and unambiguous concatenation
inferredcites →https://doi.org/10.1016/0304-3975(89)90051-0openalex-snapshot
Programs over aperiodic monoids
inferredcites →https://doi.org/10.1016/0890-5401(90)90007-5openalex-snapshot
Non-uniform automata over groups
inferredcites →https://doi.org/10.1016/b978-0-12-198820-3.50021-8openalex-snapshot
SUBWORD COUNTING AND NILPOTENT GROUPS
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1109/fscs.1990.89582openalex-snapshot
On the power of small-depth threshold circuits
inferredcites →https://doi.org/10.1109/sfcs.1992.267764openalex-snapshot
Separating the communication complexities of MOD m and MOD p circuits
inferredcites →https://doi.org/10.1109/sfcs.1997.646112openalex-snapshot
Separation of the monotone NC hierarchy
inferredcites →https://doi.org/10.1145/12130.12131openalex-snapshot
Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1
inferredcites →https://doi.org/10.1145/195058.195108openalex-snapshot
A weight-size trade-off for circuits with MOD m gates
inferredcites →https://doi.org/10.1145/48014.63138openalex-snapshot
Finite monoids and the fine structure of NC 1
inferredcites →https://doi.org/10.1145/62212.62265openalex-snapshot
Monotone circuits for connectivity require super-logarithmic depth
inferredcites →https://doi.org/10.1145/800135.804414openalex-snapshot
Some complexity questions related to distributive computing(Preliminary Report)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11821069_13openalex-snapshot
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
inferred← citeshttps://doi.org/10.1007/11874683_28openalex-snapshot
An Algebraic Point of View on the Crane Beach Property
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_30openalex-snapshot
Algebraic Characterizations of Small Classes of Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_7openalex-snapshot
Complete Classifications for the Communication Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_47openalex-snapshot
Satisfiability of Systems of Equations over Finite Monoids
inferred← citeshttps://doi.org/10.1007/3-540-44693-1_25openalex-snapshot
Learning Expressions over Monoids
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_26openalex-snapshot
Space Complexity of Reachability Testing in Labelled Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_43openalex-snapshot
Languages with Bounded Multiparty Communication Complexity
inferred← citeshttps://doi.org/10.1007/978-3-540-85780-8_7openalex-snapshot
On the Non-deterministic Communication Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1007/s00224-004-1190-2openalex-snapshot
Complete Classifications for the Communication Complexity of Regular Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2005.09.003openalex-snapshot
Learning expressions and programs over monoids
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.04.002openalex-snapshot
Space complexity of reachability testing in labelled graphs
inferred← citeshttps://doi.org/10.1017/s0963548303005790openalex-snapshot
An Application of Hindman's Theorem to a Problem on Communication Complexity
inferred← citeshttps://doi.org/10.1142/s0129054110007386openalex-snapshot
ON THE NON-DETERMINISTIC COMMUNICATION COMPLEXITY OF REGULAR LANGUAGES
inferred← citeshttps://doi.org/10.2168/lmcs-3(1:4)2007openalex-snapshot
Logic Meets Algebra: the Case of Regular Languages
inferred← citeshttps://doi.org/10.46298/lmcs-18(3:14)2022openalex-snapshot
Tameness and the power of programs over monoids in DA
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.