Demo Data from EDBT 2026 / reviewers in the wild / expert
Totadri Jayashree
dblp:44/1259
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1976
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Processor architecture and microarchitecture · 73% Integrated circuit design · 27% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Integrated circuit design › digital circuit design
arithmetic circuit design |
0.0 | 1 | 1976 | On Binary Multiplication Using the Quarter Square Algorithm · IEEE Trans. Computers 1976 |
Processor architecture and microarchitecture › computer arithmetic
binary multiplication |
0.0 | 1 | 1976 | On Binary Multiplication Using the Quarter Square Algorithm · IEEE Trans. Computers 1976 |
Processor architecture and microarchitecture
arithmetic unit |
0.0 | 1 | 1975 | On a Simple Postcorrection for Nonrestoring Division · IEEE Trans. Computers 1975 |
Processor architecture and microarchitecture › division algorithm
nonrestoring division |
0.0 | 1 | 1975 | On a Simple Postcorrection for Nonrestoring Division · IEEE Trans. Computers 1975 |
Methods — techniques the papers use, named apart from their topics
terminal correction · 0.0quarter square technique · 0.0double precision quotient · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1976 | On Binary Multiplication Using the Quarter Square AlgorithmabstractThis correspondence suggests a new method of perporming binary multiplication using the quarter square technique. As compared to the previous methods [1],[2] the proposed scheme is more general in that it can be readily applied to numbers of any word length. Moreover, it has been shown that for the eight-bit case the present method is faster, more systematic, and economical than the earlier schemes. Totadri Jayashree, Dhruba Basu |
IEEE Trans. Computers | 1 |
| 1975 | On a Simple Postcorrection for Nonrestoring DivisionabstractThis correspondence points out that the usual terminal correction for nonrestoring division can always be made in such a way as to permit concatenation of the primary and secondary quotients to form a double precision answer. This eliminates the necessity of any separate postcorrection as suggested in [1] and [2]. Dhruba Basu, Totadri Jayashree |
IEEE Trans. Computers | 2 |