Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John A. Wisniewski

dblp:99/3105 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1984
—ORCID · none

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

Systems, architecture and hardware · 2Theory of computation · 1

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
floorplanning
0.011984
Module positioning algorithms for rectilinear macrocell assemblies · DAC 1984
Electronic design automation › physical design › floorplanning
module location
0.011984
Module positioning algorithms for rectilinear macrocell assemblies · DAC 1984
Electronic design automation
physical design
0.011984
Module positioning algorithms for rectilinear macrocell assemblies · DAC 1984
Electronic design automation › physical design
placement
0.011984
Module positioning algorithms for rectilinear macrocell assemblies · DAC 1984

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

placement algorithm · 0.0
YearPublicationVenuePosition
1984 Module positioning algorithms for rectilinear macrocell assemblies
Jack A. Hudson, John A. Wisniewski, Randy C. Peters
DAC2
1983 Algorithm 594: Software for Relative Error Analysis
abstract
This package performs an automatic round-off error analysis of numerical algorithms, which is useful in determining the numerical properties (stability) of such algorithms.The approach taken with this software differs from that of Miller [4, 5] by dealing with relative as opposed to absolute error analysis.This is the natural approach taken for dealing with floating-point arithmetic.In addition, this software gives an accurate analysis of an algorithm for some fixed data, rather than searches for data for which an approximate analysis indicates that the algorithm performs poorly.It uses one of two methods, either an exact method [1] or a heuristic algorithm [1-3].T h e following paragraphs summarize the previous work in [2], and it is assumed that the reader is familiar with the concepts and techniques presented there.To perform the error analysis, the algorithm being analyzed is represented as a directed graph with each numeric quantity being a node in this graph.Directed arcs lead from operands to their results.Each node's value is subject to error, called local relative error.This error affects those subsequent nodes that are computed using the contaminated node as an operand.All of the local relative errors together are used to produce a total relative error for each node.F r o m the
John L. Larson, Mary E. Pasternak, John A. Wisniewski
ACM Trans. Math. Softw.3
1982 Iterative algorithms for tridiagonal matrices on a WSI-multiprocessor
Daniel Gajski, Ahmed H. Sameh, John A. Wisniewski
ICPP3