Evguenii I. Goldberg
List of publications from the
2008 |
26 | EE | Eugene Goldberg:
A Decision-Making Procedure for Resolution-Based SAT-Solvers.
SAT 2008: 119-132 |
25 | EE | Eugene Goldberg:
On Bridging Simulation and Formal Verification.
VMCAI 2008: 127-141 |
2007 |
24 | EE | Eugene Goldberg,
Kanupriya Gulati:
On Complexity of Internal and External Equivalence Checking.
DSD 2007: 197-206 |
23 | EE | Eugene Goldberg,
Kanupriya Gulati,
Sunil P. Khatri:
Toggle Equivalence Preserving (TEP) Logic Optimization.
DSD 2007: 271-279 |
22 | EE | Eugene Goldberg,
Yakov Novikov:
BerkMin: A fast and robust Sat-solver.
Discrete Applied Mathematics 155(12): 1549-1561 (2007) |
2006 |
21 | EE | Eugene Goldberg:
Determinization of Resolution by an Algorithm Operating on Complete Assignments.
SAT 2006: 90-95 |
2005 |
20 | EE | Eugene Goldberg:
On equivalence checking and logic synthesis of circuits with a common specification.
ACM Great Lakes Symposium on VLSI 2005: 102-107 |
19 | EE | Eugene Goldberg:
Equivalence Checking of Circuits with Parameterized Specifications.
SAT 2005: 107-121 |
18 | EE | Eugene Goldberg:
Testing satisfiability of CNF formulas by computing a stable set of points.
Ann. Math. Artif. Intell. 43(1): 65-89 (2005) |
2003 |
17 | EE | Evguenii I. Goldberg,
Yakov Novikov:
Verification of Proofs of Unsatisfiability for CNF Formulas.
DATE 2003: 10886-10891 |
16 | EE | Eugene Goldberg,
Yakov Novikov:
How Good Can a Resolution Based SAT-solver Be?
SAT 2003: 37-52 |
2002 |
15 | EE | Eugene Goldberg:
Testing Satisfiability of CNF Formulas by Computing a Stable Set of Points.
CADE 2002: 161-180 |
14 | EE | Evguenii I. Goldberg,
Mukul R. Prasad,
Robert K. Brayton:
Using Problem Symmetry in Search Based Satisfiability Algorithms.
DATE 2002: 134-141 |
13 | EE | Evguenii I. Goldberg,
Yakov Novikov:
BerkMin: A Fast and Robust Sat-Solver.
DATE 2002: 142-149 |
12 | | Eugene Goldberg:
Proving Unsatisfiability of CNFs Locally.
J. Autom. Reasoning 28(5): 417-434 (2002) |
2001 |
11 | EE | Evguenii I. Goldberg,
Mukul R. Prasad,
Robert K. Brayton:
Using SAT for combinational equivalence checking.
DATE 2001: 114-121 |
10 | EE | Yakov Novikov,
Evguenii I. Goldberg:
An efficient learning procedure for multiple implication checks.
DATE 2001: 127-135 |
9 | EE | Eugene Goldberg:
Proving unsatisfiability of CNFs locally.
Electronic Notes in Discrete Mathematics 9: 96-114 (2001) |
2000 |
8 | EE | Eugene Goldberg,
Alexander Saldanha:
Timing Analysis with Implicitly Specified False Paths.
VLSI Design 2000: 518-522 |
7 | EE | Evguenii I. Goldberg,
Luca P. Carloni,
Tiziano Villa,
Robert K. Brayton,
Alberto L. Sangiovanni-Vincentelli:
Negative thinking in branch-and-bound: the case of unate covering.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(3): 281-294 (2000) |
1999 |
6 | | Luca P. Carloni,
Evguenii I. Goldberg,
Tiziano Villa,
Robert K. Brayton,
Alberto L. Sangiovanni-Vincentelli:
Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems.
VLSI 1999: 346-361 |
1998 |
5 | EE | Evguenii I. Goldberg,
Yuji Kukimoto,
Robert K. Brayton:
Combinational Verification based on High-Level Functional Specifications.
DATE 1998: 803- |
4 | EE | Evguenii I. Goldberg,
Tiziano Villa,
Robert K. Brayton,
Alberto L. Sangiovanni-Vincentelli:
Theory and algorithms for face hypercube embedding.
IEEE Trans. on CAD of Integrated Circuits and Systems 17(6): 472-488 (1998) |
1997 |
3 | EE | Evguenii I. Goldberg,
Tiziano Villa,
Robert K. Brayton,
Alberto L. Sangiovanni-Vincentelli:
A fast and robust exact algorithm for face embedding.
ICCAD 1997: 296-303 |
2 | EE | Evguenii I. Goldberg,
Luca P. Carloni,
Tiziano Villa,
Robert K. Brayton,
Alberto L. Sangiovanni-Vincentelli:
Negative thinking by incremental problem solving: application to unate covering.
ICCAD 1997: 91-98 |
1994 |
1 | | Eugene Goldberg,
Ludmila Krasilnikova:
Using Consensusless Covers for Fast Operating on Boolean Functions.
FPL 1994: 114-116 |