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
Demo Data from VLDB 2026 / reviewers in the wild / expert

Andrea Jahnke

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

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

Systems, architecture and hardware · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
decision diagrams		 0.011998
On Variable Ordering and Decomposition Type Choice in OKFDDs · IEEE Trans. Computers 1998
Electronic design automation
logic synthesis		 0.011998
On Variable Ordering and Decomposition Type Choice in OKFDDs · IEEE Trans. Computers 1998
Electronic design automation › logic synthesis
variable ordering		 0.011998
On Variable Ordering and Decomposition Type Choice in OKFDDs · IEEE Trans. Computers 1998

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

heuristics · 0.0decomposition type choice · 0.0
YearPublicationVenuePosition
1998 On Variable Ordering and Decomposition Type Choice in OKFDDs
abstract
We present methods for the construction of small ordered Kronecker Functional Decision Diagrams (OKFDDs). OKFDDs are a generalization of ordered binary decision diagrams (OBDDs) and ordered functional decision diagrams (OFDDs) as well. Starting with an upper bound for the size of an OKFDD representing a tree-like circuit, we develop different heuristics to find good variable orderings and decomposition types for OKFDDs representing two-level and multilevel circuits, respectively. Experimental results are presented to show the efficiency of our approaches.
Rolf Drechsler, Bernd Becker 0001, Andrea Jahnke
 IEEE Trans. Computers3