VLDB 2026 Research / reviewers in the wild / expert

Steven J. Friedman

dblp:13/1525 · DBLP profile ↗
← Back
5ranked-venue papers
2as 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 · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1Theory of computation · 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
3 papers
Electronic design automation · 100%
Theoretical computer science
3 papers
Computational geometry · 53% Graph algorithms and graph theory · 27% Mathematical optimization · 20%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis › decision diagrams
binary decision diagram		 0.021990
Finding the Optimal Variable Ordering for Binary Decision Diagrams · IEEE Trans. Computers 1990
Finding the Optimal Variable Ordering for Binary Decision Diagrams · DAC 1987
Electronic design automation
logic synthesis		 0.021990
Finding the Optimal Variable Ordering for Binary Decision Diagrams · IEEE Trans. Computers 1990
Finding the Optimal Variable Ordering for Binary Decision Diagrams · DAC 1987
Electronic design automation › logic synthesis
variable ordering		 0.011990
Finding the Optimal Variable Ordering for Binary Decision Diagrams · IEEE Trans. Computers 1990
Computational geometry › triangulation
delaunay triangulation		 0.011987
Delaunay Graphs are Almost as Good as Complete Graphs · FOCS 1987
Computational geometry › geometric graph › geometric spanners
euclidean spanners		 0.011987
Delaunay Graphs are Almost as Good as Complete Graphs · FOCS 1987
Graph algorithms and graph theory
graph spanners		 0.011987
Delaunay Graphs are Almost as Good as Complete Graphs · FOCS 1987
Electronic design automation › hardware verification and test
formal verification		 0.011986
A new method for verifying sequential circuits · DAC 1986
Electronic design automation › hardware verification and test
hardware verification		 0.011986
A new method for verifying sequential circuits · DAC 1986
Electronic design automation › hardware verification and test › formal verification
sequential equivalence checking		 0.011986
A new method for verifying sequential circuits · DAC 1986
Mathematical optimization
combinatorial optimization		 0.011990
Finding the Optimal Variable Ordering for Binary Decision Diagrams · IEEE Trans. Computers 1990
Mathematical optimization
variable ordering		 0.011987
Finding the Optimal Variable Ordering for Binary Decision Diagrams · DAC 1987

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

dynamic programming · 0.0symbolic comparison · 0.0geometric analysis · 0.0formal equivalence checking · 0.0
YearPublicationVenuePosition
1990 Delaunay Graphs are almost as Good as Complete Graphs
David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
 Discret. Comput. Geom.2
1990 Finding the Optimal Variable Ordering for Binary Decision Diagrams
abstract
The ordered binary decision diagram is a canonical representation for Boolean functions, presented by R.E. Bryant (1985) as a compact representation for a broad class of interesting functions derived from circuits. However, the size of the diagram is very sensitive to the choice of ordering on the variables; hence, for some applications, such as differential cascode voltage switch (DCVS) trees, it becomes extremely important to find the ordering leading to the most compact representation. An algorithm for this problem with time complexity O(n/sup 2/3/sup n/) is presented. This represents an improvement over the previous best algorithm.>
Steven J. Friedman, Kenneth J. Supowit
 IEEE Trans. Computers1
1987 Finding the Optimal Variable Ordering for Binary Decision Diagrams
abstract
The ordered binary decision diagram is a canonical representation for Boolean functions, presented by Bryant as a compact representation for a broad class of interesting functions derived from circuits. However, the size of the diagram is very sensitive to the choice of ordering on the variables; hence for some applications, such as Differential Cascode Voltage Switch (DCVS) trees, it becomes extremely important to find the ordering leading to the most compact representation. We present an algorithm for this problem with time complexity O(n/sup 2/3/sup n/), an improvement over the previous best, which required O(n!2/sup n/).
Steven J. Friedman, Kenneth J. Supowit
 DAC1
1987 Delaunay Graphs are Almost as Good as Complete Graphs
abstract
Let S be any set of N points in the plane and let DT(S) be the graph of the Delaunay triangulation of S. For all points a and b of S, let d(a, b) be the Euclidean distance from a to b and let DT(a, b) be the length of the shortest path in DT(S) from a to b. We show that there is a constant c(≤ 1+√5/2 π ≈ 5.08) independent of S and N such that DT(a, b)/d(a, b) ≪ c.
David P. Dobkin, Steven J. Friedman, Kenneth J. Supowit
 FOCS2
1986 A new method for verifying sequential circuits
abstract
We present an algorithm for deciding whether two given synchronous, logic-level sequential circuits are functionally equivalent. Our approach involves a formal symbolic comparison, as opposed to the (often very time-consuming) generation and simulation of numerous test vector sequences. The given circuits need not have the same number of states, nor must they have the same number of inputs — for example, one circuit may be a parallel implementation and the other serial. Although this is an intractable problem in general, we believe that the method is useful on a broad class of practical circuits; our computational experience thus far is encouraging.
Kenneth J. Supowit, Steven J. Friedman
 DAC2