![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
James E. Robertson
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1990
- [j8]Tony M. Carter, James E. Robertson:
The Set Theory of Arithmetic Decomposition. IEEE Trans. Computers 39(8): 993-1005 (1990) - [j7]Tony M. Carter, James E. Robertson:
Radix-16 Signed-Digit Division. IEEE Trans. Computers 39(12): 1424-1433 (1990)
1980 – 1989
- 1987
- [c7]James E. Robertson:
Error detection and correction for addition and subtraction, through use of higher radix extensions of hamming codes. IEEE Symposium on Computer Arithmetic 1987: 226-229 - 1983
- [c6]James E. Robertson:
Conditions for the distributivity of multiplication with respect to set addition and their effect on the design of array multipliers. IEEE Symposium on Computer Arithmetic 1983: 67-71 - 1981
- [c5]James E. Robertson:
A systematic approach to the design of structures for arithmetic. IEEE Symposium on Computer Arithmetic 1981: 35-41
1970 – 1979
- 1978
- [c4]Catherine Y. Chow, James E. Robertson:
Logical design of a redundant binary adder. IEEE Symposium on Computer Arithmetic 1978: 109-115 - 1973
- [j6]James E. Robertson, Kishor S. Trivedi:
The Status of Investigations into Computer Hardware Design Based on the Use of Continued Fractions. IEEE Trans. Computers 22(6): 555-560 (1973) - 1972
- [c3]James E. Robertson, Kishor S. Trivedi:
The status of investigations into the use of continued fractions for computer hardware. IEEE Symposium on Computer Arithmetic 1972: 1-30 - 1970
- [j5]James E. Robertson:
The Correspondence Between Methods of Digital Division and Multiplier Recoding Procedures. IEEE Trans. Computers 19(8): 692-701 (1970)
1960 – 1969
- 1961
- [c2]James E. Robertson:
Problems in the physical realization of speed independent circuits. SWCT 1961: 106-108
1950 – 1959
- 1959
- [j4]John W. Carr III, Alan J. Perlis, James E. Robertson, Norman R. Scott:
A Visit to Computation Centers in the Soviet Union. Commun. ACM 2(6): 8-20 (1959) - [c1]Gernot Metze, James E. Robertson:
Elimination of carry propagation in digital computers. IFIP Congress 1959: 389-395 - 1958
- [j3]James E. Robertson:
A New Class of Digital Division Methods. IRE Trans. Electron. Comput. 7(3): 218-222 (1958) - 1956
- [j2]James E. Robertson:
Odd Binary Asynchronous Counters. IRE Trans. Electron. Comput. 5(1): 12-15 (1956) - 1955
- [j1]James E. Robertson:
Two's Complement Multiplication in Binary Parallel Digital Computers. IRE Trans. Electron. Comput. 4(3): 118-119 (1955) - 1952
- [b1]James E. Robertson:
Error Detection and Correction in Binary Parallel Digital Computers. University of Illinois Urbana-Champaign, USA, 1952
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint