On the public citation graph

Efficient VLSI architectures for Columnsort

0 signed · 22 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.1109/12.277290openalex-snapshot
Parallel computations on reconfigurable meshes
inferredcites →https://doi.org/10.1109/71.363407openalex-snapshot
Reconfigurable buses with shift switching: concepts and applications
inferredcites →https://doi.org/10.1109/acssc.1995.540614openalex-snapshot
Shift switching and novel arithmetic schemes
inferredcites →https://doi.org/10.1109/t-c.1971.223205openalex-snapshot
Parallel Processing with the Perfect Shuffle
inferredcites →https://doi.org/10.1109/tc.1985.1676584openalex-snapshot
Wafer-Scale Integration of Systolic Arrays
inferredcites →https://doi.org/10.1109/tc.1985.5009385openalex-snapshot
Tight Bounds on the Complexity of Parallel Sorting
inferredcites →https://doi.org/10.1145/1468075.1468121openalex-snapshot
Sorting networks and their applications
inferredcites →https://doi.org/10.1155/1999/79875openalex-snapshot
Reconfigurable Shift Switching Parallel Comparators

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-45591-4_19openalex-snapshot
A Non-Binary Parallel Arithmetic Architecture
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_30openalex-snapshot
Improving the Average Delay of Sorting
inferred← citeshttps://doi.org/10.1016/j.ins.2011.12.008openalex-snapshot
On the complexity of min–max sorting networks
inferred← citeshttps://doi.org/10.1016/j.sysarc.2006.04.002openalex-snapshot
A scalable VLSI speed/area tunable sorting network
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.028openalex-snapshot
Improving the average delay of sorting
inferred← citeshttps://doi.org/10.1080/10655140290011140openalex-snapshot
Fast Inner Product Computation on Short Buses
inferred← citeshttps://doi.org/10.1109/apasic.1999.824038openalex-snapshot
An inner product processor design using novel parallel counter circuits
inferred← citeshttps://doi.org/10.1109/eurmic.1999.794456openalex-snapshot
A novel approach for CMOS parallel counter design
inferred← citeshttps://doi.org/10.1109/ipps.1999.760476openalex-snapshot
An efficient VLSI architecture parallel prefix counting with domino logic
inferred← citeshttps://doi.org/10.1109/iscas.2002.1010428openalex-snapshot
Design of a pipelined and expandable sorting architecture with simple control scheme
inferred← citeshttps://doi.org/10.1109/tpds.2003.1233714openalex-snapshot
An efficient parallel prefix sums architecture with domino logic
inferred← citeshttps://doi.org/10.1109/tpds.2005.33openalex-snapshot
Efficient algorithms for the all nearest neighbor and closest pair problems on the linear array with a reconfigurable pipelined bus system
inferred← citeshttps://doi.org/10.1109/tvlsi.2017.2661746openalex-snapshot
An Efficient O( $N$ ) Comparison-Free Sorting Algorithm
inferred← citeshttps://doi.org/10.1109/vtsa.2001.934485openalex-snapshot
Design of k-WTA/Sorting network using maskable WTA/MAX circuit
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.