Demo Data from VLDB 2026 / reviewers in the wild / expert
Sany M. Leinwand
dblp:86/6784 · also Sany Leinwand
· DBLP profile ↗
8ranked-venue papers
6as 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 · 7 · 6 first-authorTheory 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
7 papers |
Electronic design automation · 93% Integrated circuit design · 7% | |
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › physical design
floorplanning |
0.0 | 2 | 1988 | Algorithms for floorplan design via rectangular dualization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988 An algorithm for building rectangular floor-plans · DAC 1984 |
Electronic design automation
physical design |
0.0 | 2 | 1988 | Algorithms for floorplan design via rectangular dualization · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988 An algorithm for building rectangular floor-plans · DAC 1984 |
Electronic design automation
hardware verification and test |
0.0 | 3 | 1982 | Logical correctness by construction · DAC 1982 Algebraic analysis of nondeterministic behavior · DAC 1980 Design verification based on functional abstraction · DAC 1979 |
Electronic design automation
logic synthesis |
0.0 | 2 | 1982 | Logical correctness by construction · DAC 1982 Dynamic Boolean Algebras · IEEE Trans. Computers 1980 |
Electronic design automation › hardware verification and test
logic simulation |
0.0 | 2 | 1981 | Process oriented logic simulation · DAC 1981 Algebraic analysis of nondeterministic behavior · DAC 1980 |
Electronic design automation › design for manufacturability
design rule restriction |
0.0 | 1 | 1982 | Logical correctness by construction · DAC 1982 |
Integrated circuit design
digital circuit design |
0.0 | 3 | 1984 | An algorithm for building rectangular floor-plans · DAC 1984 Process oriented logic simulation · DAC 1981 Algebraic analysis of nondeterministic behavior · DAC 1980 |
Electronic design automation › logic synthesis
switching theory |
0.0 | 1 | 1980 | Dynamic Boolean Algebras · IEEE Trans. Computers 1980 |
Electronic design automation › physical design
layout design |
0.0 | 1 | 1984 | An algorithm for building rectangular floor-plans · DAC 1984 |
Integrated circuit design
large-scale integration |
0.0 | 1 | 1982 | Logical correctness by construction · DAC 1982 |
Electronic design automation › hardware verification and test
hardware verification |
0.0 | 1 | 1979 | Design verification based on functional abstraction · DAC 1979 |
Methods — techniques the papers use, named apart from their topics
graph matching · 0.0bipartite graph algorithms · 0.0rectangular floorplan algorithm · 0.0process-oriented simulation · 0.0modular synthesis · 0.0constructive design · 0.0algebraic analysis · 0.0admissible combination rules · 0.0functional abstraction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | A Theory of Rectangular Dual Graphs
Yen-Tai Lai, Sany M. Leinwand |
Algorithmica | 2 |
| 1988 | Algorithms for floorplan design via rectangular dualizationabstractA rectangular floorplan construction problem is approached from a graph-theoretical view. The study is based on a reduction of the rectangular dualization problem to a matching problem on bipartite graphs. This opens the way to applying traditional graph-theoretic methods and algorithms to floorplanning. Another result is a method for generating alternative rectangular duals, such that a proposed floorplan can be optimized by a sequence of iterative transformations. This approach is made more practical than others, by assuming that the given structure graph can be modified to force it to admit a rectangular dual. Algorithms that introduce edges and vertices into the given graph until a rectangular dual can be constructed are also presented.> Yen-Tai Lai, Sany M. Leinwand |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |
| 1984 | An algorithm for building rectangular floor-plans
Sany M. Leinwand, Yen-Tai Lai |
DAC | 1 |
| 1982 | Logical correctness by constructionabstractA novel methodological approach to the design of large-scale-integrated systems proposed correctness by construction. By using a restricted repertoire of admissible combination rules, it is possible to guarantee that only designs suitable for implementation are generated. This paper addresses the complementary issue of logical correctness by construction - prohibiting "meaningless" constructs from occurring. Sany M. Leinwand |
DAC | 1 |
| 1981 | Process oriented logic simulation
Sany M. Leinwand |
DAC | 1 |
| 1980 | Algebraic analysis of nondeterministic behaviorabstractThis paper is concerned with the analysis of design errors that lead to unpredictable response of digital systems. Besides classical topics, such as hazards and races, the analysis of malfunctions in real circuits is also included. After defining the notion of behavior and nondeterministic response, a general approach for detecting such design problems through algebraic analysis is presented. Compared with existing simulation methods, the algebraic technique provides results of improved accuracy. Another basic advantage is the ability to accomodate modular synthesis of digital systems. Sany M. Leinwand, T. Lamdan |
DAC | 1 |
| 1980 | Dynamic Boolean AlgebrasabstractSwitching algebra is unable to represent the dynamic behavior of digital circuits. There are several known methods for modeling the dynamics of circuits, using either multivalued algebras or specialized operators. None of them preserves the framework of switching algebra; therefore, existing analysis and synthesis methods developed by switching theory cannot be used. Sany M. Leinwand, T. Lamdan |
IEEE Trans. Computers | 1 |
| 1979 | Design verification based on functional abstraction
Sany M. Leinwand, T. Lamdan |
DAC | 1 |