Demo Data from EDBT 2026 / reviewers in the wild / expert
Harold Fleisher
dblp:05/4195
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
logic synthesis |
0.0 | 2 | 1989 | Minimizability of Random Boolean Functions · IEEE Trans. Computers 1989 A Computer Algorithm for Minimizing Reed-Muller Canonical Forms · IEEE Trans. Computers 1987 |
Electronic design automation › logic synthesis › logic minimization
boolean function minimization |
0.0 | 1 | 1989 | Minimizability of Random Boolean Functions · IEEE Trans. Computers 1989 |
Electronic design automation › logic synthesis › logic minimization
multiple output minimization |
0.0 | 1 | 1987 | A Computer Algorithm for Minimizing Reed-Muller Canonical Forms · IEEE Trans. Computers 1987 |
Methods — techniques the papers use, named apart from their topics
random clumping theory · 0.0geometric analysis · 0.0geometrical operations · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Minimizability of Random Boolean FunctionsabstractThe average number of prime k-cubes and essential k-cubes in an n-variable, single-output Boolean function has already been obtained combinationally. The authors show how the same quantities can be obtained geometrically, using the theory of random clumping and take an initial step in calculating, for k-cubes in the minimized form of a function. The authors compare their results to minimizations produced by ESPRESSO and a cruder algorithm.> Harold Fleisher, John Giraldi, R. Phoenix, Morton Tavel |
IEEE Trans. Computers | 1 |
| 1987 | A Computer Algorithm for Minimizing Reed-Muller Canonical FormsabstractA computer algorithm is presented that uses geometrical operations to minimize multioutput Reed-Muller expansions of up to ten variables. Harold Fleisher, Morton Tavel, John Yeager |
IEEE Trans. Computers | 1 |