On the public citation graph
Regular sparse crossbar concentrators
0 signed · 29 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.1109/12.260636openalex-snapshot
Fast self-routing permutation switching on an asymptotically minimum cost network
inferredcites →https://doi.org/10.1109/71.285603openalex-snapshot
Adaptive binary sorting schemes and associated interconnection networks
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/1-4020-3128-9_19openalex-snapshot
A New Arithmetic Unit in GF(2M) for Reconfigurable Hardware Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-45234-8_65openalex-snapshot
A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation
inferred← citeshttps://doi.org/10.1038/s41598-021-81799-zopenalex-snapshot
An efficient simulation for quantum secure multiparty computation
inferred← citeshttps://doi.org/10.1049/el:20020550openalex-snapshot
High-speed division architecture for GF (2 m )
inferred← citeshttps://doi.org/10.1049/el:20063980openalex-snapshot
Lehmer-based algorithm for computing inverses in Galois fields GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-cdt.2009.0068openalex-snapshot
Simplified bit parallel systolic multipliers for special class of Galois field (2 m ) with testability
inferred← citeshttps://doi.org/10.1049/iet-cdt:20060183openalex-snapshot
High speed hardware architecture to compute galois fields GF(p) montgomery inversion with scalability features
inferred← citeshttps://doi.org/10.1049/ip-cdt:20050165openalex-snapshot
Flexible GF(2m) arithmetic architectures for subword parallel processing ASIPs
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/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/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/memcod.2016.7797744openalex-snapshot
Verifying the concentration property of permutation networks by BDDs
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/tpds.2005.5openalex-snapshot
Cost-effective designs of WDM optical interconnects
inferred← citeshttps://doi.org/10.1145/329166.329199openalex-snapshot
Generating highly-routable sparse crossbars for PLDs
inferred← citeshttps://doi.org/10.1145/503048.503069openalex-snapshot
FPGA test time reduction through a novel interconnect testing scheme
inferred← citeshttps://doi.org/10.14288/1.0065579openalex-snapshot
Test and fault-tolerance for network-on-chip infrastructures
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.