Остановите войну!
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 37 matches
- 1991
- Robert Alverson:
Integer division using reciprocals. IEEE Symposium on Computer Arithmetic 1991: 186-190 - Gerd Bohlender, Wolfgang Walter, Peter Kornerup, David W. Matula:
Semantics for exact floating point operations. IEEE Symposium on Computer Arithmetic 1991: 22-26 - Françoise Chaitin-Chatelin, Valérie Frayssé:
Analysis of arithmetic algorithms: a statistical study. IEEE Symposium on Computer Arithmetic 1991: 10-16 - Pak K. Chan, Martine D. F. Schlag, Clark D. Thomborson, Vojin G. Oklobdzija:
Delay optimization of carry-skip adders and block carry-lookahead adders. IEEE Symposium on Computer Arithmetic 1991: 154-164 - Jen-Shiun Chiang, Mi Lu:
A general division algorithm for residue number systems. IEEE Symposium on Computer Arithmetic 1991: 76-83 - Jean Duprat, Yvan Herreros, Sylvanus Kla:
New redundant representations of complex numbers and vectors. IEEE Symposium on Computer Arithmetic 1991: 2-9 - Warren E. Ferguson, Tom Brightman:
Accurate and monotone approximations of some transcendental functions. IEEE Symposium on Computer Arithmetic 1991: 237-244 - Christiane Frougny:
Representation of numbers in nonclassical numeration systems. IEEE Symposium on Computer Arithmetic 1991: 17-21 - Dragan Gamberger:
New approach to integer division in residue number systems. IEEE Symposium on Computer Arithmetic 1991: 84-91 - Alain Guyot:
OCAPI: architecture of a VLSI coprocessor for the GCD and the extended GCD of large numbers. IEEE Symposium on Computer Arithmetic 1991: 226-231 - Shen-Fu Hsiao, Jean-Marc Delosme:
The CORDIC Householder algorithm. IEEE Symposium on Computer Arithmetic 1991: 256-263 - Thomas E. Hull, Marty S. Cohen, C. B. Hall:
Specifications for a variable-precision arithmetic coprocessor. IEEE Symposium on Computer Arithmetic 1991: 127-131 - Vitit Kantabutra:
Designing optimum carry-skip adders. IEEE Symposium on Computer Arithmetic 1991: 146-153 - Andreas Knöfel:
Fast hardware units for the computation of accurate dot products. IEEE Symposium on Computer Arithmetic 1991: 70-74 - Lars Kühnel:
Optimal purely systolic addition. IEEE Symposium on Computer Arithmetic 1991: 172-179 - Alfons A. J. de Lange, Ed F. Deprettere:
Design and implementation of a floating-point quasi-systolic general purpose CORDIC rotator for high-rate parallel data and signal processing. IEEE Symposium on Computer Arithmetic 1991: 272-281 - Jeong-A Lee, Tomás Lang:
SVD by constant-factor-redundant-CORDIC. IEEE Symposium on Computer Arithmetic 1991: 264-271 - Thomas W. Lynch, Earl E. Swartzlander Jr.:
The redundant cell adder. IEEE Symposium on Computer Arithmetic 1991: 165-170 - Mayur Mehta, Vijay Parmar, Earl E. Swartzlander Jr.:
High-speed multiplier design using multi-input counter and compressor circuits. IEEE Symposium on Computer Arithmetic 1991: 43-50 - Paolo Montuschi, Luigi Ciminiera:
Simple radix 2 division and square root with skipping of some addition steps. IEEE Symposium on Computer Arithmetic 1991: 202-209 - Michael Müller, Christine Rüb, Wolfgang Rülling:
Exact accumulation of floating-point numbers. IEEE Symposium on Computer Arithmetic 1991: 64-69 - Holger Orup, Peter Kornerup:
A high-radix hardware algorithm for calculating the exponential ME modulo N. IEEE Symposium on Computer Arithmetic 1991: 51-56 - Shrikant N. Parikh, David W. Matula:
A redundant binary Euclidean GCD algorithm. IEEE Symposium on Computer Arithmetic 1991: 220-225 - Michael S. Paterson, Uri Zwick:
Shallow multiplication circuits. IEEE Symposium on Computer Arithmetic 1991: 28-34 - Stanislaw J. Piestrak:
Design of residue generators and multioperand modular adders using carry-save adders. IEEE Symposium on Computer Arithmetic 1991: 100-107 - Douglas M. Priest:
Algorithms for arbitrary precision floating point arithmetic. IEEE Symposium on Computer Arithmetic 1991: 132-143 - Naofumi Takagi:
A radix-4 modular multiplication hardware algorithm efficient for iterative modular multiplications. IEEE Symposium on Computer Arithmetic 1991: 35-42 - Ping Tak Peter Tang:
Table-lookup algorithms for elementary functions and their error analysis. IEEE Symposium on Computer Arithmetic 1991: 232-236 - Paul K.-G. Tu, Milos D. Ercegovac:
Application of on-line arithmetic algorithms to the SVD computation: preliminary results. IEEE Symposium on Computer Arithmetic 1991: 246-255 - Peter R. Turner:
Implementation and analysis of extended SLI operations. IEEE Symposium on Computer Arithmetic 1991: 118-126
skipping 7 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-05-25 17:44 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