![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Peter Kornerup
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j29]Claude-Pierre Jeannerod, Peter Kornerup, Nicolas Louvet, Jean-Michel Muller
:
Error bounds on complex floating-point multiplication with an FMA. Math. Comput. 86(304): 881-898 (2017) - 2015
- [j28]Peter Kornerup:
Reviewing High-Radix Signed-Digit Adders. IEEE Trans. Computers 64(5): 1502-1505 (2015) - 2014
- [i3]Peter Kornerup:
Correction to the 2005 paper: "Digit Selection for SRT Division and Square Root". CoRR abs/1411.6498 (2014) - 2012
- [j27]Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
:
On the Computation of Correctly Rounded Sums. IEEE Trans. Computers 61(3): 289-298 (2012) - [i2]Peter Kornerup, Jean-Michel Muller, Adrien Panhaleux:
Floating-Point Arithmetic on Round-to-Nearest Representations. CoRR abs/1201.3914 (2012) - 2011
- [j26]Peter Kornerup, Jean-Michel Muller
, Adrien Panhaleux:
Performing Arithmetic Operations on Round-to-Nearest Representations. IEEE Trans. Computers 60(2): 282-291 (2011) - [c26]Nicolas Brisebarre, Mioara Joldes, Peter Kornerup, Érik Martin-Dorel, Jean-Michel Muller
:
Augmented Precision Square Roots and 2-D Norms, and Discussion on Correctly Rounding sqrt(x^2+y^2). IEEE Symposium on Computer Arithmetic 2011: 23-30 - 2010
- [j25]Peter Kornerup, Christoph Quirin Lauter, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
:
Computing correctly rounded integer powers in floating-point arithmetic. ACM Trans. Math. Softw. 37(1): 4:1-4:23 (2010)
2000 – 2009
- 2009
- [j24]Peter Kornerup, Paolo Montuschi, Jean-Michel Muller, Eric Schwarz:
Guest Editors' Introduction: Special Section on Computer Arithmetic. IEEE Trans. Computers 58(2): 145-147 (2009) - [j23]Peter Kornerup:
Correcting the Normalization Shift of Redundant Binary Representations. IEEE Trans. Computers 58(10): 1435-1439 (2009) - [c25]Peter Kornerup, Vincent Lefèvre, Nicolas Louvet, Jean-Michel Muller
:
On the Computation of Correctly-Rounded Sums. IEEE Symposium on Computer Arithmetic 2009: 155-160 - 2007
- [i1]Peter Kornerup, Vincent Lefèvre, Jean-Michel Muller:
Computing Integer Powers in Floating-Point Arithmetic. CoRR abs/0705.4369 (2007) - 2006
- [j22]Peter Kornerup, Jean-Michel Muller
:
Leading Guard Digits in Finite Precision Redundant Representations. IEEE Trans. Computers 55(5): 541-548 (2006) - [j21]Peter Kornerup, Jean-Michel Muller
:
Choosing starting values for certain Newton-Raphson iterations. Theor. Comput. Sci. 351(1): 101-110 (2006) - 2005
- [j20]Peter Kornerup:
Digit Selection for SRT Division and Square Root. IEEE Trans. Computers 54(3): 294-303 (2005) - [j19]Nicolas Brisebarre, David Defour, Peter Kornerup, Jean-Michel Muller
, Nathalie Revol:
A New Range-Reduction Algorithm. IEEE Trans. Computers 54(3): 331-339 (2005) - [j18]Peter Kornerup:
Reviewing 4-to-2 Adders for Multi-Operand Addition. J. VLSI Signal Process. 40(1): 143-152 (2005) - [c24]Peter Kornerup, David W. Matula:
Single Precision Reciprocals by Multipartite Table Lookup. IEEE Symposium on Computer Arithmetic 2005: 240-248 - 2003
- [j17]Peter Kornerup, Jean-Claude Bajard
, Christiane Frougny, Jean-Michel Muller
:
Preface. Theor. Comput. Sci. 291(2): 133-134 (2003) - [c23]Peter Kornerup:
Revisiting SRT Quotient Digit Selection. IEEE Symposium on Computer Arithmetic 2003: 38-45 - 2002
- [c22]Peter Kornerup:
Reviewing 4-to-2 Adders for Multi-Operand Addition. ASAP 2002: 218- - 2001
- [c21]Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup:
Modular Multiplication and Base Extensions in Residue Number Systems. IEEE Symposium on Computer Arithmetic 2001: 59-65 - 2000
- [j16]Israel Koren, Peter Kornerup:
Guest Editors' Introduction - Special Issue on Computer Arithmetic. IEEE Trans. Computers 49(7): 625-627 (2000) - [j15]Feng Zhou, Peter Kornerup:
Computing Moments by Prefix Sums. J. VLSI Signal Process. 25(1): 5-17 (2000)
1990 – 1999
- 1999
- [j14]Asger Munk Nielsen, Peter Kornerup:
Redundant Radix Representations of Rings. IEEE Trans. Computers 48(11): 1153-1165 (1999) - [c20]Peter Kornerup:
Necessary and Sufficient Conditions for Parallel, Constant Time Conversion and Addition. IEEE Symposium on Computer Arithmetic 1999: 152- - 1998
- [j13]Jean-Claude Bajard
, Laurent-Stéphane Didier, Peter Kornerup:
An RNS Montgomery Modular Multiplication Algorithm. IEEE Trans. Computers 47(7): 766-776 (1998) - [j12]Feng Zhou, Peter Kornerup:
A New Fast Discrete Fourier Transform. J. VLSI Signal Process. 20(3): 219-232 (1998) - 1997
- [c19]Asger Munk Nielsen, Peter Kornerup:
On Radix Representation of Rings. IEEE Symposium on Computer Arithmetic 1997: 34-43 - [c18]Jean-Claude Bajard, Laurent-Stéphane Didier, Peter Kornerup:
An IWS Montgomery Modular Multiplication Algorithm. IEEE Symposium on Computer Arithmetic 1997: 234-239 - 1996
- [c17]Feng Zhou, Peter Kornerup:
Computing moments by prefix sums. ICIP (3) 1996: 619-622 - 1995
- [j11]Peter Kornerup, David W. Matula:
LCF: A Lexicagraphic Binary representation of the Rationals. J. Univers. Comput. Sci. 1(7): 484-503 (1995) - [j10]Asger Munk Nielsen, Peter Kornerup:
MSB-First Digit Serial Arithmetic. J. Univers. Comput. Sci. 1(7): 527-547 (1995) - [c16]Feng Zhou, Peter Kornerup:
High Speed DCT/IDCT Using a Pipelined CORDIC Algorithm. IEEE Symposium on Computer Arithmetic 1995: 180-187 - 1994
- [j9]Peter Kornerup:
Digit-Set Conversions: Generalizations and Application. IEEE Trans. Computers 43(5): 622-629 (1994) - [j8]Peter Kornerup:
A Systolic, Linear-Array Multiplier for a Class of Right-Shift Algorithms. IEEE Trans. Computers 43(8): 892-898 (1994) - 1993
- [c15]Peter Kornerup:
High-radix modular multiplication for cryptosystems. IEEE Symposium on Computer Arithmetic 1993: 277-283 - 1991
- [c14]Gerd Bohlender, Wolfgang Walter, Peter Kornerup, David W. Matula:
Semantics for exact floating point operations. IEEE Symposium on Computer Arithmetic 1991: 22-26 - [c13]Holger Orup, Peter Kornerup:
A high-radix hardware algorithm for calculating the exponential ME modulo N. IEEE Symposium on Computer Arithmetic 1991: 51-56 - 1990
- [j7]Peter Kornerup, David W. Matula:
An Algorithm for Redundant Binary Bit-Pipelined Rational Arithmetic. IEEE Trans. Computers 39(8): 1106-1115 (1990)
1980 – 1989
- 1989
- [c12]Peter Kornerup, David W. Matula:
Exploiting redundancy in bit-pipelined rational arithmetic. IEEE Symposium on Computer Arithmetic 1989: 119-126 - 1988
- [j6]Peter Kornerup, David W. Matula:
An On-Line Arithmetic Unit for Bit-Pipelined Rational Arithmetic. J. Parallel Distributed Comput. 5(3): 310-330 (1988) - 1987
- [c11]Peter Kornerup, David W. Matula:
A bit-serial arithmetic unit for rational arithmetic. IEEE Symposium on Computer Arithmetic 1987: 204-211 - 1985
- [j5]David W. Matula, Peter Kornerup:
Finite Precision Rational Arithmetic Slash Number Systems. IEEE Trans. Computers 34(1): 3-18 (1985) - [c10]Peter Kornerup, David W. Matula:
Finite precision lexicographic continued fraction number systems. IEEE Symposium on Computer Arithmetic 1985: 207-213 - 1983
- [j4]Peter Kornerup, R. T. Gregory:
Mapping Integers and Hensel Codes onto Farey Fractions. BIT 23(1): 9-20 (1983) - [j3]Peter Kornerup, David W. Matula:
Finite Precision Rational Arithmetic: An Arithmetic Unit. IEEE Trans. Computers 32(4): 378-388 (1983) - [c9]David W. Matula, Peter Kornerup:
An order preserving finite binary encoding of the rationals. IEEE Symposium on Computer Arithmetic 1983: 201-209 - [e1]T. R. N. Rao, Peter Kornerup:
6th IEEE Symposium on Computer Arithmetic, ARITH 1983, Aarhus, Denmark, June 20-22, 1983. IEEE Computer Society 1983, ISBN 0-8186-0034-9 [contents] - 1981
- [c8]Peter Kornerup, David W. Matula:
An integrated rational arithmetic unit. IEEE Symposium on Computer Arithmetic 1981: 233-240 - 1980
- [j2]Peter Kornerup, Bent Bruun Kristensen
, Ole Lehrmann Madsen
:
Interpretation and Code Generation Based on Intermediate Languages. Softw. Pract. Exp. 10(8): 635-658 (1980) - [c7]Peter Kornerup:
Firmware Development Systems, a Survey. Firmware Engineering 1980: 124-137
1970 – 1979
- 1979
- [c6]David W. Matula, Peter Kornerup:
An approximate rational arithmetic system with intrinsic recovery of simple fractions during expression evaluation. EUROSAM 1979: 383-397 - 1978
- [c5]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 - [c4]Peter Kornerup, David W. Matula:
A feasibility analysis of fixed-slash rational arithmetic. IEEE Symposium on Computer Arithmetic 1978: 39-47 - 1977
- [j1]Peter Kornerup, Bruce D. Shriver:
A Unified Numeric Representation Arithmetic Unit and Its Language Support. IEEE Trans. Computers 26(7): 651-659 (1977) - 1975
- [c3]Peter Kornerup:
A unified numeric data type in Pascal. IEEE Symposium on Computer Arithmetic 1975: 40-47 - [c2]Bruce D. Shriver, Peter Kornerup:
The UNRAU a Unified Numeric Representation Arithmetic Unit. IEEE Symposium on Computer Arithmetic 1975: 179-184 - 1974
- [c1]Peter Kornerup:
Concepts of the MATHILDA System. ISCA 1974: 159-164
Coauthor Index
![](https://dblp.org/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:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint