Demo Data from EDBT 2026 / reviewers in the wild / expert
Larry E. Druffel
dblp:03/2428
· DBLP profile ↗
5ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers |
Electronic design automation · 93% Integrated circuit design · 7% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Graph algorithms and graph theory
graph isomorphism |
0.0 | 1 | 1976 | A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices · J. ACM 1976 |
Electronic design automation
physical design |
0.0 | 1 | 1975 | An iterative algorithm for placement and assignment of integrated circuits · DAC 1975 |
Electronic design automation › logic synthesis › combinational logic synthesis
combinational logic optimization |
0.0 | 1 | 1974 | An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks · IEEE Trans. Computers 1974 |
Electronic design automation
logic synthesis |
0.0 | 1 | 1974 | An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks · IEEE Trans. Computers 1974 |
Electronic design automation › logic synthesis › logic minimization
multiple output minimization |
0.0 | 1 | 1974 | An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks · IEEE Trans. Computers 1974 |
Integrated circuit design
digital circuit design |
0.0 | 1 | 1975 | An iterative algorithm for placement and assignment of integrated circuits · DAC 1975 |
Electronic design automation › logic synthesis
prime implicant generation |
0.0 | 1 | 1974 | An Extension of the Clause Table Approach to Multi-Output Combinational Switching Networks · IEEE Trans. Computers 1974 |
Methods — techniques the papers use, named apart from their topics
iterative algorithm · 0.0implicant generation · 0.0distance matrices · 0.0clause table approach · 0.0backtracking · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | Position Statement: ICSE-12 Workshop on Industrial Experience Using Formal Methods
Dines Bjørner, Larry E. Druffel |
ICSE | 2 |
| 1990 | Software Engineering for AI Based Software Product
Larry E. Druffel, Reed Little |
Data Knowl. Eng. | 1 |
| 1976 | A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance MatricesabstractA backtracking algorithm for testing a pair of digraphs for isomorphism is presented. The information contained in the distance matrix representation of a graph is used to establish an initial partition of the graph's vertices. This distance matrix information is then applied in a backtracking procedure to reduce the search tree of possible mappings. While the algorithm is not guaranteed to run in polynomial time, it performs efficiently for a large class of graphs. Douglas C. Schmidt, Larry E. Druffel |
J. ACM | 2 |
| 1975 | An iterative algorithm for placement and assignment of integrated circuits
Douglas C. Schmidt, Larry E. Druffel |
DAC | 2 |
| 1974 | An Extension of the Clause Table Approach to Multi-Output Combinational Switching NetworksabstractThere are a number of methods which use a clause table to generate the prime implicants of a switching function. This paper describes a technique for extending the clause table approach to the minimization of multi-terminal networks. The specific extension described here extends the algorithm of Slagle et al. to generate the important implicants of a set of switching functions and to determine a minimum realization. Douglas C. Schmidt, Larry E. Druffel |
IEEE Trans. Computers | 2 |