On the public citation graph

Implementing multiplication with split read-only memory

0 signed · 13 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.53588openalex-snapshot
An approach to implementing multiplication with small tables
inferredcites →https://doi.org/10.1142/9467openalex-snapshot
Computer Arithmetic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-11218-3_24openalex-snapshot
Memory Based Multiplier Design in Custom and FPGA Implementation
inferred← citeshttps://doi.org/10.1007/978-3-319-63962-8_169-1openalex-snapshot
Tabular Computation
inferred← citeshttps://doi.org/10.1007/978-3-319-77525-8_169openalex-snapshot
Tabular Computation
inferred← citeshttps://doi.org/10.1016/j.vlsi.2008.01.005openalex-snapshot
Partial product reduction by using look-up tables for M×N multiplier
inferred← citeshttps://doi.org/10.1109/12.713320openalex-snapshot
Design of a high-speed square generator
inferred← citeshttps://doi.org/10.1109/apccas.2008.4745988openalex-snapshot
Design of square generator with small look-up table
inferred← citeshttps://doi.org/10.1109/iccd.1996.563600openalex-snapshot
On design of efficient square generator
inferred← citeshttps://doi.org/10.1109/icniconsmcl.2006.2openalex-snapshot
A CAD Tool for Generation of Synthesizable and Scalable Square of Binary Numbers
inferred← citeshttps://doi.org/10.1109/iemcon.2018.8614848openalex-snapshot
A Case for Table-Based Approximate Computing
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206269openalex-snapshot
Design of a 32-bit squarer - exploiting addition redundancy
inferred← citeshttps://doi.org/10.1109/tvlsi.2010.2049389openalex-snapshot
Dynamic Transfer of Computation to Processor Cache for Yield and Reliability Improvement
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.