On the public citation graph

A New Lower Bound for the Number of Switches in Rearrangeable Networks

0 signed · 14 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.1016/0097-3165(78)90036-5openalex-snapshot
A short proof of Minc's conjecture
inferredcites →https://doi.org/10.1090/s0002-9904-1963-11031-9openalex-snapshot
Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
inferredcites →https://doi.org/10.1134/11122.1608-3253openalex-snapshot
Problems of Information Transmission
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.1007/0-387-29026-5_15openalex-snapshot
WDM Switching Networks: Complexity and Constructions
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.1016/b978-0-444-88071-0.50020-5openalex-snapshot
Communication Networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.030openalex-snapshot
Shorter arithmetization of nondeterministic computations
inferred← citeshttps://doi.org/10.1080/00029890.1989.11972245openalex-snapshot
Kathy O'Hara's Constructive Proof of the Unimodality of the Gaussian Polynomials
inferred← citeshttps://doi.org/10.1090/dimacs/042openalex-snapshot
Advances in Switching Networks
inferred← citeshttps://doi.org/10.1137/0603041openalex-snapshot
Rearrangeable Networks with Limited Depth
inferred← citeshttps://doi.org/10.1137/0606057openalex-snapshot
Some Graph-Colouring Theorems with Applications to Generalized Connection Networks
inferred← citeshttps://doi.org/10.1137/s0097539704442714openalex-snapshot
WDM Switching Networks, Rearrangeable and Nonblocking [w,f]-connectors
inferred← citeshttps://doi.org/10.1145/800061.808731openalex-snapshot
Superconcentrators, generalizers and generalized connectors with limited depth
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.