Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 34 matches
- 1978
- Dharma P. Agrawal:
On arithmetic inter-relationships and hardware interchangeabiltty of negabinary and binary systems. IEEE Symposium on Computer Arithmetic 1978: 88-96 - Dharma P. Agrawal, T. R. N. Rao:
On modulo (2n+1) arithmetic logic. IEEE Symposium on Computer Arithmetic 1978: 104-108 - Daniel E. Atkins, Shauchi Ong:
A comparison of two approaches to multi-operand binary addition. IEEE Symposium on Computer Arithmetic 1978: 125-139 - Catherine Y. Chow, James E. Robertson:
Logical design of a redundant binary adder. IEEE Symposium on Computer Arithmetic 1978: 109-115 - Danny Cohen:
Mathematical approach to iterative computation networks. IEEE Symposium on Computer Arithmetic 1978: 226-238 - Luigi Dadda:
Multiple addition of binary serial numbers. IEEE Symposium on Computer Arithmetic 1978: 140-148 - Milos D. Ercegovac:
An on-line square rooting algorithm. IEEE Symposium on Computer Arithmetic 1978: 183-189 - Milos D. Ercegovac, Melvin M. Takata:
An arithmetic module for efficient evaluation of functions. IEEE Symposium on Computer Arithmetic 1978: 190-199 - Krzysztof S. Frankowski:
A realistic model for error estimates in the evaluation of elementary functions. IEEE Symposium on Computer Arithmetic 1978: 70-74 - Daniel D. Gajski, Louis P. Rubinfield:
Design of arithmetic elements for Burroughs Scientific Processor. IEEE Symposium on Computer Arithmetic 1978: 245-256 - Oscar N. Garcia, Harvey Glass, Stanley C. Haimes:
An approximate and empirical study of the distribution of adder inputs and maximum carry length propagation. IEEE Symposium on Computer Arithmetic 1978: 97-103 - R. Nigel Horspool, Eric C. R. Hehner:
Exact arithmetic using a variable-length P-ADIC representation. IEEE Symposium on Computer Arithmetic 1978: 10-14 - Thomas E. Hull:
Desirable floating-point arithmetic and elementary functions for numerical computation. IEEE Symposium on Computer Arithmetic 1978: 63-69 - Kai Hwang, T. P. Chang:
An interleaved rational/radix arithmetic system for high-precision computations. IEEE Symposium on Computer Arithmetic 1978: 15-24 - Graham A. Jullien, William C. Miller:
Application of the residue number system to computer processing of digital signals. IEEE Symposium on Computer Arithmetic 1978: 220-225 - Israel Koren, Yoram Maliniak:
A unified approach to a class of number systems. IEEE Symposium on Computer Arithmetic 1978: 25-28 - Peter Kornerup, David W. Matula:
A feasibility analysis of fixed-slash rational arithmetic. IEEE Symposium on Computer Arithmetic 1978: 39-47 - E. V. Kriphnamurthy, H. Venkateswaran:
Multivariable polynomial processing - Applications to interpolation. IEEE Symposium on Computer Arithmetic 1978: 81-87 - Lawrence A. Liddiard:
Required scientific floating point arithmetic. IEEE Symposium on Computer Arithmetic 1978: 56-62 - Sigurd L. Lillevik, P. David Fisher:
Computational design alternatives with microprocessor-based systems. IEEE Symposium on Computer Arithmetic 1978: 267-273 - Raymond S. Lim:
High-speed multiplication and multiple summand addition. IEEE Symposium on Computer Arithmetic 1978: 149-153 - David W. Matula:
Basic digit sets for radix representation of the integers. IEEE Symposium on Computer Arithmetic 1978: 1-9 - David W. Matula, Peter Kornerup:
A feasibility analysis of binary fixed-slash and floating-slash number systems. IEEE Symposium on Computer Arithmetic 1978: 29-38 - Eric K. Reuter, John P. Jeter, J. Wayne Anderson, Bruce D. Shriver:
Some experiments using interval arithmetic. IEEE Symposium on Computer Arithmetic 1978: 75-80 - Fabio Alberto Schreiber, R. Stefanelli:
Two methods for fast integer binary-BCD conversion. IEEE Symposium on Computer Arithmetic 1978: 200-207 - Arunas G. Slekys, Algirdas Avizienis:
A modified bi-imaginary number system. IEEE Symposium on Computer Arithmetic 1978: 48-55 - Antonín Svoboda:
Arithmetic circuit fault detection by modular encoding. IEEE Symposium on Computer Arithmetic 1978: 208-219 - Earl E. Swartzlander Jr.:
Merged arithmetic for signal processing. IEEE Symposium on Computer Arithmetic 1978: 239-244 - Kwang G. Tan:
The theory and implementations of high-radix division. IEEE Symposium on Computer Arithmetic 1978: 154-163 - Kishor S. Trivedi, Joseph G. Rusnak:
Higher radix on-line division. IEEE Symposium on Computer Arithmetic 1978: 164-174
skipping 4 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-07-23 06:41 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint