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.

Per E. Danielsson

dblp:178/6066 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1970
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
2 papers
Electronic design automation · 57% Processor architecture and microarchitecture · 26% Integrated circuit design · 17%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Geometric modeling and processing › shape modeling › parametric modeling
curve design
0.011970
Incremental Curve Generation · IEEE Trans. Computers 1970
Electronic design automation
logic synthesis
0.011967
Two Problems on Boolean Memories · IEEE Trans. Electron. Comput. 1967
Integrated circuit design › memory circuit design
boolean memory
0.011967
Two Problems on Boolean Memories · IEEE Trans. Electron. Comput. 1967
Processor architecture and microarchitecture › special-purpose processor
digital differential analyzer
0.011970
Incremental Curve Generation · IEEE Trans. Computers 1970

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

universal encoding · 0.0parametric representation · 0.0hypercube vertex assignment · 0.0digital differential analyzer · 0.0
YearPublicationVenuePosition
1970 Incremental Curve Generation
abstract
The process of converting a mathematically defined curve into unit steps along a fixed axis in digital technique is known as interpolation. The representation of the curve may be parametric or nonparametric. The parametric representation is widely used since it lends itself to realization by ordinary DDA technique. However, the nonparametric representation is shown to be fully competitive. In many cases, e.g., circle generation, it seems to be advantageous because it eliminates the risk of curve degradation.
Per E. Danielsson
IEEE Trans. Computers1
1967 Two Problems on Boolean Memories
abstract
This paper is intended to improve Huffman's results on universal encoding of asynchronous sequential networks. The method employed here consists of assigning to each row of the flow table a single vertex on the corresponding hypercube. The remaining vertices are used for the transitions between stable states. Such a vertex can be used for different transitions if they correspond to distinct input states.
Henrik Eriksson, Per E. Danielsson
IEEE Trans. Electron. Comput.2