On the public citation graph
Generalized Connectors
0 signed · 24 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.1145/321958.321962openalex-snapshot
Shifting Graphs and Their Applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1098-2418(200008)17:1<64::aid-rsa5>3.0.co;2-3openalex-snapshot
Construction of expanders and superconcentrators using Kolmogorov complexity
inferred← citeshttps://doi.org/10.1002/j.1538-7305.1979.tb02972.xopenalex-snapshot
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0281-0_14openalex-snapshot
Notes on the Complexity of Switching Networks
inferred← citeshttps://doi.org/10.1007/bf00995527openalex-snapshot
On switching network functionalities and their relationships
inferred← citeshttps://doi.org/10.1007/s10878-011-9402-6openalex-snapshot
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90105-6openalex-snapshot
Size bounds for superconcentrators
inferred← citeshttps://doi.org/10.1016/b978-0-444-88071-0.50020-5openalex-snapshot
Communication Networks
inferred← citeshttps://doi.org/10.1109/12.2270openalex-snapshot
On the construction of communication networks satisfying bounded fan-in of service ports
inferred← citeshttps://doi.org/10.1109/26.216511openalex-snapshot
Nonblocking multirate distribution networks
inferred← citeshttps://doi.org/10.1109/hpsr.2007.4281250openalex-snapshot
Constructions of Given-Depth and Optimal Multirate Rearrangeably Nonblocking Distributors
inferred← citeshttps://doi.org/10.1109/infcom.1990.91379openalex-snapshot
Nonblocking multirate distribution networks
inferred← citeshttps://doi.org/10.1109/mc.1979.1658777openalex-snapshot
A Sampler of Circuit Switching Networks
inferred← citeshttps://doi.org/10.1109/sfcs.1981.23openalex-snapshot
Non-existence of one-dimensional expanding graphs
inferred← citeshttps://doi.org/10.1109/tc.1978.1675014openalex-snapshot
Generalized Connection Networks for Parallel Processor Intercommunication
inferred← citeshttps://doi.org/10.1109/tc.1980.1675501openalex-snapshot
Construction of a Generalized Connector with 5.8 n log2n Edges
inferred← citeshttps://doi.org/10.1109/tc.1983.1676296openalex-snapshot
Expected Capacity of (m2)-Networks
inferred← citeshttps://doi.org/10.1109/tc.1986.1676762openalex-snapshot
Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems
inferred← citeshttps://doi.org/10.1109/tnet.2008.2001728openalex-snapshot
Rearrangeable and Nonblocking $[w,f]$-Distributors
inferred← citeshttps://doi.org/10.1137/0213011openalex-snapshot
Limitations on Explicit Constructions of Expanding Graphs
inferred← citeshttps://doi.org/10.1137/0605030openalex-snapshot
Explicit Concentrators from Generalized N -Gons
inferred← citeshttps://doi.org/10.1137/0606057openalex-snapshot
Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
inferred← citeshttps://doi.org/10.70675/c320173aza82bz46ddz95dfz59df600d7fccopenalex-snapshot
G-graphs and Expander graphs
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.