New ideas for solving covering problems
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Negative thinking by incremental problem solving: application to unate covering
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
A fast and robust exact algorithm for face embedding
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
On using satisfiability-based pruning techniques in covering algorithms
DATE '00 Proceedings of the conference on Design, automation and test in Europe
An efficient heuristic approach to solve the unate covering problem
DATE '00 Proceedings of the conference on Design, automation and test in Europe
OBDD Minimization Based on Two-Level Representation of Boolean Functions
IEEE Transactions on Computers
An efficient divide and conquer algorithm for exact hazard free logic minimization
Proceedings of the conference on Design, automation and test in Europe
Worst and Best Irredundant Sum-of-Products Expressions
IEEE Transactions on Computers
Fast three-level logic minimization based on autosymmetry
Proceedings of the 39th annual Design Automation Conference
Logic Synthesis and Verification
BOOM: a heuristic boolean minimizer
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Genetic engineering versus natural evolution: genetic algorithms with deterministic operators
Journal of Systems Architecture: the EUROMICRO Journal
Verifying integrity of decision diagrams
Integration, the VLSI Journal
Knowledge discovery with second-order relations
Knowledge and Information Systems
On the Complexity and Inapproximability of Shortest Implicant Problems
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Implementing Reversed Alternating Finite Automaton (r-AFA) Operations
WIA '98 Revised Papers from the Third International Workshop on Automata Implementation
Verifying Integrity of Decision Diagrams
SAFECOMP '98 Proceedings of the 17th International Conference on Computer Safety, Reliability and Security
Large-scale SOP minimization using decomposition and functional properties
Proceedings of the 40th annual Design Automation Conference
Solving Graph Optimization Problems with ZBDDs
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Decision Diagrams in Synthesis - Algorithms, Applications and Extensions
VLSID '97 Proceedings of the Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Restructuring decision tables for elucidation of knowledge
Data & Knowledge Engineering
Advanced AI Search Techniques in Modern Digital Circuit Synthesis
Artificial Intelligence Review
Satisfiability-Based Algorithms for Boolean Optimization
Annals of Mathematics and Artificial Intelligence
Efficient Static Compaction of Test Sequence Sets through the Application of Set Covering Techniques
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence
Advanced AI search techniques in modern digital circuit synthesis
Artificial intelligence in logic design
An approximation algorithm for fully testable kEP-SOP networks
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
The optimization of kEP-SOPs: Computational complexity, approximability and experiments
ACM Transactions on Design Automation of Electronic Systems (TODAES)
The decomposition tree for analyses of boolean functions
Mathematical Structures in Computer Science
Search space pruning techniques in ATPG for VLSI circuits
ICC'05 Proceedings of the 9th International Conference on Circuits
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
A novel approach for fast covering the Boolean sets
ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
On the gap between ess(f) and cnf_size(f)
Discrete Applied Mathematics
Hi-index | 0.01 |