Oliver Aberth

dblp:43/5010 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 1992
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 44% Algorithms and data structures · 44% Computational complexity · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Memory systems · 100%

Topics — the 2 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Memory systems › memory management
memory sharing
0.011969
A Multiple Computer Linkage · IEEE Trans. Computers 1969
Computational complexity
computability theory
0.011968
Analysis in the Computable Number Field · J. ACM 1968

Methods — techniques the papers use, named apart from their topics

programmable functions · 0.0constructive proof · 0.0
YearPublicationVenuePosition
1992 Precise computation using range arithmetic, via C++
abstract
An arithmetic is described that can replace floating-point arithmetic for programming tasks requiring assured accuracy. A general explanation is given of how the arithmetic is constructed with C++, and a programming example in this language is supplied. Times for solving representative problems are presented.
Oliver Aberth, Mark J. Schaefer
ACM Trans. Math. Softw.1
1984 Precise Scientific Computation with a Microprocessor
abstract
When a high-level programming language is used for scientific computation, usually one must use standard floating point and choose the precision-single, double, or higher-before one's program executes. This paper describes a modified Basic that accommodates the advanced computation techniques of dynamic adjustable precision and interval arithmetic. This language-Precision Basic or Pbasic-allows a user to routinely obtain his n decimal place answers accurate to the last decimal place. An interpreter for this modified Basic was recently completed that runs on a Z-80 microprocessor. Some features of the interpreter are described.
Oliver Aberth
IEEE Trans. Computers1
1971 The Concect of Effective Method Applied to Computational Problems of Linear Algebra
Oliver Aberth
J. Comput. Syst. Sci.1
1969 A Multiple Computer Linkage
abstract
A system of memory sharing is proposed as a means for computer communication.
Oliver Aberth
IEEE Trans. Computers1
1968 Analysis in the Computable Number Field
abstract
It is well known that real variable analysis is nonconstructive. For example, although it is asserted that every bounded monotone sequence converges to a limit, there is no algorithm for obtaining this limit. This paper presents a constructive analysis which is restricted to a countable set of numbers, the field of computable numbers. These numbers are defined in a new way by employing the concept of “programmable functions.” The resultant analysis differs from real analysis in many important respects.
Oliver Aberth
J. ACM1