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

Manfred Wiesel

dblp:60/4792 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1994
—ORCID · none

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

Systems, architecture and hardware · 4 · 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.

Computer architecture, parallel and distributed computing, and storage systems
4 papers
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › design management
design reuse
0.011994
Design Reuse: Fact or Fiction? (Panel) · DAC 1994
Electronic design automation
physical design
0.031984
Chip layout optimization using critical path weighting · DAC 1984
A combined force and cut algorithm for hierarchical VLSI layout · DAC 1982
Two-dimensional channel routing and channel intersection problems · DAC 1982
Electronic design automation › physical design › routing
channel routing
0.011982
Two-dimensional channel routing and channel intersection problems · DAC 1982
Electronic design automation › physical design › placement › analytical placement
force-directed placement
0.011982
A combined force and cut algorithm for hierarchical VLSI layout · DAC 1982
Electronic design automation › physical design › placement
hierarchical placement
0.011982
A combined force and cut algorithm for hierarchical VLSI layout · DAC 1982
Electronic design automation › physical design › placement › partitioning-based placement
min-cut placement
0.011982
A combined force and cut algorithm for hierarchical VLSI layout · DAC 1982
Electronic design automation › physical design
placement
0.011982
A combined force and cut algorithm for hierarchical VLSI layout · DAC 1982

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

min-cut partitioning · 0.0force-directed placement · 0.0
YearPublicationVenuePosition
1994 Design Reuse: Fact or Fiction? (Panel)
abstract
Design reuse is expected to be a key enabler for system designs in the 90's. Proponents claim that design reuse increases competitiveness through better quality, improved predictability and better productivity. On the other hand, skeptics say that design reuse is not realizable due to several barriers including rapid changes in technology, lack of standardized libraries and the presence of human, as opposed to technical barriers. Is design reuse a reality? How much is reused in practice? Where is it most applicable? Do concrete metrics exist for reusability? The panel will assess the track record of design reuse and discuss its status and future.
Nikil Dutt, David Agnew, Raúl Camposano, Antun Domic, Manfred Wiesel, Hiroto Yasuura
DAC5
1984 Chip layout optimization using critical path weighting
Alfred E. Dunlop, Vishwani D. Agrawal, David N. Deutsch, M. F. Jukl, Patrick Kozak, Manfred Wiesel
DAC6
1982 Two-dimensional channel routing and channel intersection problems
abstract
A two-dimensional channel routing program for hierarchical IC layout with orthogonal building blocks of variable size and shape is presented. A two dimensional channel model and a one layer channel router are used. A detailed description of the routing scheme which avoids the generation of “switch box” problems is given. The behavior of the two-dimensional routing algorithm to single and coupled channel intersections is demonstrated.
Manfred Wiesel, Dieter A. Mlynski
DAC1
1982 A combined force and cut algorithm for hierarchical VLSI layout
abstract
This paper presents a new algorithm for the initial placement of hierarchical VLSI circuits. The components to be placed are orthogonal macrocells of variable shape and size. This algorithm combines the advantages of force directed placement and min-cut algorithm. It provides an initial placement which avoids overlapping between cells and includes an estimation of routting area. This algorithm is suitable for regular cell arrangements, too.
G. J. Wipfler, Manfred Wiesel, Dieter A. Mlynski
DAC2