On the public citation graph
Crosspoint complexity of sparse crossbar concentrators
0 signed · 34 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.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1109/12.260636openalex-snapshot
Fast self-routing permutation switching on an asymptotically minimum cost network
inferredcites →https://doi.org/10.1109/26.328986openalex-snapshot
High performance concentrators and superconcentrators using multiplexing schemes
inferredcites →https://doi.org/10.1109/26.380083openalex-snapshot
Design of efficient and easily routable generalized connectors
inferredcites →https://doi.org/10.1109/tc.1982.1675941openalex-snapshot
Lower Bounds on Crosspoints in Concentrators
inferredcites →https://doi.org/10.1109/tcom.1977.1093937openalex-snapshot
Binomial Switching Networks for Concentration and Distribution
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
inferredcites →https://doi.org/10.1201/9781420010572.pt2openalex-snapshot
Combinatorial Matrix Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20058openalex-snapshot
Constructions of sparse asymmetric connectors with number theoretic methods
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_2openalex-snapshot
Constructions of Sparse Asymmetric Connectors
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.1080/17445760.2023.2231578openalex-snapshot
Faster quantum concentration via Grover's search
inferred← citeshttps://doi.org/10.1090/dimacs/042/11openalex-snapshot
Structure and density of sparse crossbar concentrators
inferred← citeshttps://doi.org/10.1109/broadnets.2007.4550472openalex-snapshot
A new class of strictly nonblocking WDM multicast switching networks
inferred← citeshttps://doi.org/10.1109/dft.2006.46openalex-snapshot
NoC Interconnect Yield Improvement Using Crosspoint Redundancy
inferred← citeshttps://doi.org/10.1109/eiconrus.2019.8656846openalex-snapshot
Algorithm for Design and Structure Optimization of the FPGA Routing Block with a Given Number of Trace Signals
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/icc.2004.1312821openalex-snapshot
A new design for WDM packet switching networks with wavelength conversion and recirculating buffering
inferred← citeshttps://doi.org/10.1109/icccn.2004.1401626openalex-snapshot
Group switching for DWDM optical networks
inferred← citeshttps://doi.org/10.1109/infcom.2004.1354594openalex-snapshot
WDM optical switching networks using sparse crossbars
inferred← citeshttps://doi.org/10.1109/ipdps.2003.1213110openalex-snapshot
Sparse WDM optical interconnects under wavelength-based model
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1302949openalex-snapshot
Designing WDM optical interconnects with full connectivity by using limited wavelength conversion
inferred← citeshttps://doi.org/10.1109/iscas.2005.1464520openalex-snapshot
Concentrator Access Networks for Programmable Logic Cores on SoCs
inferred← citeshttps://doi.org/10.1109/isit.1998.708764openalex-snapshot
Tight information theoretic density bounds for sparse crossbar concentrators
inferred← citeshttps://doi.org/10.1109/tc.2004.113openalex-snapshot
Designing WDM optical interconnects with full connectivity by using limited wavelength conversion
inferred← citeshttps://doi.org/10.1109/tc.2010.145openalex-snapshot
Self-Routing Quantum Sparse Crossbar Packet Concentrators
inferred← citeshttps://doi.org/10.1109/tcad.2010.2061530openalex-snapshot
Exploring FPGA Routing Architecture Stochastically
inferred← citeshttps://doi.org/10.1109/tcomm.2006.878838openalex-snapshot
Low-loss switching fabric design for recirculating buffer in WDM optical packet switching networks using arrayed waveguide grating routers
inferred← citeshttps://doi.org/10.1109/tpds.2005.5openalex-snapshot
Cost-effective designs of WDM optical interconnects
inferred← citeshttps://doi.org/10.1109/tpds.2006.67openalex-snapshot
WDM optical interconnects with recirculating buffering and limited range wavelength conversion
inferred← citeshttps://doi.org/10.1145/329166.329199openalex-snapshot
Generating highly-routable sparse crossbars for PLDs
inferred← citeshttps://doi.org/10.1201/9781420011296-31openalex-snapshot
Optimal Parallel Scheduling Algorithms in WDM Packet Interconnects
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.