Остановите войну!
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 48 matches
- 1985
- Algirdas Avizienis:
Arithmetic algorithms for operands encoded in two-dimensional low-cost arithmetic error codes. IEEE Symposium on Computer Arithmetic 1985: 285-292 - Jaisimha Bannur, A. Varma:
The VLSI implementation of a square root algorithm. IEEE Symposium on Computer Arithmetic 1985: 159-165 - J. Hartmut Bleher, A. E. Roeder, Siegfried M. Rump:
ACRITH: High-Accuracy Arithmetic an advanced tool for numerical computation. IEEE Symposium on Computer Arithmetic 1985: 318-321 - Richard P. Brent, H. T. Rung:
A systolic algorithm for integer GCD computation. IEEE Symposium on Computer Arithmetic 1985: 118-125 - Virginio Cantoni, Marco Ferretti, Stefano Levialdi, Renato Stefanelli:
PAPIA: Pyramidal architecture for parallel image analysis. IEEE Symposium on Computer Arithmetic 1985: 237-242 - Tien Chi Chen:
Maximal redundancy signed-digit systems. IEEE Symposium on Computer Arithmetic 1985: 296-299 - Heng-Da Cheng, King-Sun Fu:
Algorithm partition for a fixed-size VLSI architecture using space-time domain expansion. IEEE Symposium on Computer Arithmetic 1985: 126-132 - Donald M. Chiarulli, Walter G. Rudd, Duncan A. Buell:
DRAFT: A dynamically reconfigurable processor for integer arithmetic. IEEE Symposium on Computer Arithmetic 1985: 309-317 - Edward T. Chow, Dan I. Moldovan:
Prime Factor DFT parallel processor using wafer scale integration. IEEE Symposium on Computer Arithmetic 1985: 133-140 - Luigi Ciminiera, Angelo Serra:
Efficient serial-parallel arrays for multiplication and addition. IEEE Symposium on Computer Arithmetic 1985: 28-35 - Luigi Dadda:
Fast multipliers for two's-complement numbers in serial form. IEEE Symposium on Computer Arithmetic 1985: 57-63 - Luigi Dadda:
Squarers for binary numbers in serial form. IEEE Symposium on Computer Arithmetic 1985: 173-179 - Jack J. Dongarra, Danny C. Sorensen:
A fast algorithm for the symmetric eigenvalue problem. IEEE Symposium on Computer Arithmetic 1985: 337-342 - John A. Eldon:
A family of CMOS floating point arithmetic chips. IEEE Symposium on Computer Arithmetic 1985: 101-107 - Milos D. Ercegovac, Tomás Lang:
A division algorithm with prediction of quotient digits. IEEE Symposium on Computer Arithmetic 1985: 51-56 - Jan Fandrianto, B. Y. Woo:
VLSI floating-point processors. IEEE Symposium on Computer Arithmetic 1985: 93-100 - Warren E. Ferguson, David W. Matuja:
Rationally biased arithmetic. IEEE Symposium on Computer Arithmetic 1985: 194-202 - Dennis Gannon:
On the structure of parallelism in a highly concurrent PDE solver. IEEE Symposium on Computer Arithmetic 1985: 252-259 - Thomas R. Gross:
Floating-point arithmetic on a reduced-instruction-set processor. IEEE Symposium on Computer Arithmetic 1985: 86-92 - Kai Hwang, Zhiwei Xu:
Multiprocessors for evaluating compound arithmetic functions. IEEE Symposium on Computer Arithmetic 1985: 266-275 - William Kahan, E. LeBlanc:
Anomalies in the IBM ACRITH package. IEEE Symposium on Computer Arithmetic 1985: 322-331 - Saroj Kaushik:
Multiple error correction and additive overflow detection with magnitude indices in residue code. IEEE Symposium on Computer Arithmetic 1985: 278-284 - Hideaki Kobayashi:
A multioperand two's complement addition algorithm. IEEE Symposium on Computer Arithmetic 1985: 16-19 - Peter Kornerup, David W. Matula:
Finite precision lexicographic continued fraction number systems. IEEE Symposium on Computer Arithmetic 1985: 207-213 - Takakazu Kurokawa, Hideo Aiso:
Polynomial Transformer. IEEE Symposium on Computer Arithmetic 1985: 153-158 - Xiaobo Li, Lionel M. Ni:
A pipeline architecture for computing cumulative hypergeometric distributions. IEEE Symposium on Computer Arithmetic 1985: 166-172 - Wentai Liu, J. C. Duh, Daniel E. Atkins:
The design of a vector-radix 2DFFT chip. IEEE Symposium on Computer Arithmetic 1985: 231-236 - R. Lohner, Jürgen Wolff von Gudenberg:
Complex interval division with maximum accuracy. IEEE Symposium on Computer Arithmetic 1985: 332-336 - Franklin T. Luk:
A parallel method for computing the generalized singular value decomposition. IEEE Symposium on Computer Arithmetic 1985: 260-265 - Renato de Mori, Régis Cardin:
Design for a recursive parallel multiplier. IEEE Symposium on Computer Arithmetic 1985: 44-50
skipping 18 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-06-07 07:35 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