Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
101 | Christopher Umans |
The Minimum Equivalent DNF Problem and Shortest Implicants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8-11, 1998, Palo Alto, California, USA, pp. 556-563, 1998, IEEE Computer Society, 0-8186-9172-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
minimum equivalent DNF, shortest implicant, complexity of approximation, computational complexity, logic minimization, polynomial hierarchy |
73 | Kuo-Hsing Cheng, Shun-Wen Cheng |
Prioritized Prime Implicant Patterns Puzzle for Novel Logic Synthesis and Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASP-DAC/VLSI Design ![In: Proceedings of the 7th Asia and South Pacific Design Automation Conference (ASP-DAC 2002), and the 15th International Conference on VLSI Design (VLSI Design 2002), Bangalore, India, January 7-11, 2002, pp. 155-159, 2002, IEEE Computer Society, 0-7695-1299-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
full-swing logic, Low power design, VLSI design, hybrid logic, prime implicant |
67 | Neil V. Murray, Erik Rosenthal |
Reduced Implicate/Implicant Tries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMIS ![In: Foundations of Intelligent Systems, 17th International Symposium, ISMIS 2008, Toronto, Canada, May 20-23, 2008, Proceedings, pp. 203-214, 2008, Springer, 978-3-540-68122-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
67 | Christopher Umans |
On the Complexity and Inapproximability of Shortest Implicant Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 687-696, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
48 | Vasco M. Manquinho, Paulo F. Flores, João P. Marques Silva, Arlindo L. Oliveira |
Prime Implicant Computation Using Satisfiability Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 9th International Conference on Tools with Artificial Intelligence, ICTAI '97, Newport Beach, CA, USA, November 3-8, 1997, pp. 232-239, 1997, IEEE Computer Society, 0-8186-8203-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
Integer Programming Algorithms, Propositional Satisfiability Algorithms, Backtrack Search Strategies, Prime Implicants |
44 | Yi Cao, Joseph C. Culberson, Lorna Stewart |
DP-Complete Problems Derived from Extremal NP-Complete Properties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 199-210, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
DP-complete, extremal problem, unfrozen, complexity, colorability, implicant |
44 | Jason Cong, Kirill Minkovich |
Improved SAT-based Boolean matching using implicants for LUT-based FPGAs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FPGA ![In: Proceedings of the ACM/SIGDA 15th International Symposium on Field Programmable Gate Arrays, FPGA 2007, Monterey, California, USA, February 18-20, 2007, pp. 139-147, 2007, ACM, 978-1-59593-600-4. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
logic synthesis, SAT, implicant, boolean matching, FPGA lookup table |
38 | Mehmet M. Dalkilic, Arijit Sengupta |
A logic-theoretic classifier called Circle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICARCV ![In: 8th International Conference on Control, Automation, Robotics and Vision, ICARCV 2004, Kunming, China, 6-9 December 2004, Proceedings, pp. 1043-1048, 2004, IEEE, 0-7803-8653-1. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
38 | Kazuyoshi Hayase, Hiroshi Imai |
OBDDs of a Monotone Function and of Its Prime Implicants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 136-145, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
38 | Pranav Ashar, Srinivas Devadas, A. Richard Newton |
Optimum and heuristic algorithms for an approach to finite state machine decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(3), pp. 296-310, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Johan de Kleer, Alan K. Mackworth, Raymond Reiter |
Characterizing Diagnoses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Systems in Engineering ![In: Expert Systems in Engineering, Principles and Applications, International Workshop, Vienna, Austria, September 24-26, 1990, Proceedings, pp. 1-15, 1990, Springer, 3-540-53104-1. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
38 | Pranav Ashar, Srinivas Devadas, A. Richard Newton |
A Unified Approach to the Decomposition and Re-Decomposition of Sequential Machines. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DAC ![In: Proceedings of the 27th ACM/IEEE Design Automation Conference. Orlando, Florida, USA, June 24-28, 1990., pp. 601-606, 1990, IEEE Computer Society Press, 0-89791-363-9. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
29 | Jayashree Katti, Virendra Sule, B. K. Lande |
Implicant based solver for XOR Boolean linear systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SpringSim (HPC) ![In: Proceedings of the 25th High Performance Computing Symposium, Virginia Beach, VA, USA, April 23 - 26, 2017, pp. 8:1-8:12, 2017, ACM, 978-1-5108-3822-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
29 | Daniel Kane 0001, Osamu Watanabe 0001 |
A Short Implicant of a CNF Formula with Many Satisfying Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 76(4), pp. 1203-1223, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
29 | Virendra Sule |
Implicant based parallel all solution solver for Boolean satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1611.09590, 2016. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP BibTeX RDF |
|
29 | Ashok Kumar Palaniswamy, Spyros Tragoudas |
Improved Threshold Logic Synthesis Using Implicant-Implicit Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Emerg. Technol. Comput. Syst. ![In: ACM J. Emerg. Technol. Comput. Syst. 10(3), pp. 21:1-21:32, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
29 | Daniel M. Kane, Osamu Watanabe 0001 |
A Short Implicant of a CNF Formula with Many Satisfying Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings, pp. 273-284, 2014, Springer, 978-3-319-13074-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
29 | Tony Ribeiro, Katsumi Inoue |
Learning Prime Implicant Conditions from Interpretation Transition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ILP ![In: Inductive Logic Programming - 24th International Conference, ILP 2014, Nancy, France, September 14-16, 2014, Revised Selected Papers, pp. 108-125, 2014, Springer, 978-3-319-23707-7. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
29 | Daniel M. Kane, Osamu Watanabe 0001 |
A Short Implicant of CNFs with Relatively Many Satisfying Assignments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
29 | Camilla Schwind |
Belief Base Change on Implicant Sets: How to Give Up Elements of a Belief Based on Literal Level. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIS ![In: Seventh International Conference on Computational Intelligence and Security, CIS 2011, Sanya, Hainan, China, December 3-4, 2011, pp. 239-243, 2011, IEEE Computer Society, 978-1-4577-2008-6. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
29 | Neil V. Murray, Erik Rosenthal |
Linear response time for implicate and implicant queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Knowl. Inf. Syst. ![In: Knowl. Inf. Syst. 22(3), pp. 287-317, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
29 | Sirzat Kahramanli, Suleyman Tosun |
A Novel Essential Prime Implicant Identification Method for Exact Direct Cover Logic Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CDES ![In: Proceedings of the 2006 International Conference on Computer Design & Conference on Computing in Nanotechnology, CDES 2006, Las Vegas, Nevada, USA, June 26-29, 2006, pp. 10-16, 2006, CSREA Press, 1-60132-009-4. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP BibTeX RDF |
|
29 | Daniel Le Berre |
Autour de SAT : le calcul d'impliquants P-restreints, algorithmes et applications. (Beyond SAT: P-restricted implicant, algorithms and applications). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2000 |
RDF |
|
29 | Ron Rymon |
An Se-Tree-Based Prime Implicant Generation Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 11(1-4), pp. 351-366, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
29 | Yasuhiro Igarashi |
The Size of Arrays for a Prime Implicant Generating Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 23(1), pp. 73-77, 1980. The full citation details ...](Pics/full.jpeg) |
1980 |
DBLP DOI BibTeX RDF |
|
29 | M. Ikram, Donald A. Roy |
A Simple Technique to Improve the Pi-Algorithm for Prime Implicant Determination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 25(11), pp. 1184-1187, 1976. The full citation details ...](Pics/full.jpeg) |
1976 |
DBLP DOI BibTeX RDF |
|
29 | Bernie L. Hulme |
Richard B. Worrell: A Prime Implicant Algorithm with Factoring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 24(11), pp. 1129-1131, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
Boolean functions, factoring, symbolic manipulation, prime implicants |
29 | Eugenio Morreale |
Recursive Operators for Prime Implicant and Irredundant Normal Form Determination. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 19(6), pp. 504-509, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
|
29 | Robert M. Bowman, Eugene S. McVey |
A Method for the Fast Approximate Solution of Large Prime Implicant Charts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 19(2), pp. 169-173, 1970. The full citation details ...](Pics/full.jpeg) |
1970 |
DBLP DOI BibTeX RDF |
|
29 | Eugenio Morreale |
Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Electron. Comput. ![In: IEEE Trans. Electron. Comput. 16(5), pp. 611-620, 1967. The full citation details ...](Pics/full.jpeg) |
1967 |
DBLP DOI BibTeX RDF |
|
29 | James F. Gimpel |
A Reduction Technique for Prime Implicant Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Electron. Comput. ![In: IEEE Trans. Electron. Comput. 14(4), pp. 535-541, 1965. The full citation details ...](Pics/full.jpeg) |
1965 |
DBLP DOI BibTeX RDF |
|
29 | James F. Gimpel |
A Method of Producing a Boolean Function Having an Arbitrarily Prescribed Prime Implicant Table. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Electron. Comput. ![In: IEEE Trans. Electron. Comput. 14(3), pp. 485-488, 1965. The full citation details ...](Pics/full.jpeg) |
1965 |
DBLP DOI BibTeX RDF |
|
29 | James F. Gimpel |
A reduction technique for prime implicant tables ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWCT ![In: 5th Annual Symposium on Switching Circuit Theory and Logical Design, Princeton, New Jersey, USA, November 11-13, 1964, pp. 183-191, 1964, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1964 |
DBLP DOI BibTeX RDF |
|
29 | Insley B. Pyne, Edward Joseph McCluskey Jr. |
The Reduction of Redundancy in Solving Prime Implicant Tables. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IRE Trans. Electron. Comput. ![In: IRE Trans. Electron. Comput. 11(4), pp. 473-482, 1962. The full citation details ...](Pics/full.jpeg) |
1962 |
DBLP DOI BibTeX RDF |
|
29 | Roger W. Hockney |
An Intersection Algorithm Giving All Irredundant Normal Forms from a Prime Implicant List. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IRE Trans. Electron. Comput. ![In: IRE Trans. Electron. Comput. 11(2), pp. 289-290, 1962. The full citation details ...](Pics/full.jpeg) |
1962 |
DBLP DOI BibTeX RDF |
|
25 | Eduardo Romero-Aguirre, Juan Carlos Murrieta-Lee |
A Survey of the Graphic Alternate Method for Boolean Functions Simplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CONIELECOMP ![In: 15th International Conference on Electronics, Communications, and Computers (CONIELECOMP 2005), 28 February 2005 - 2 March 2005, Puebla, Mexico, pp. 328-334, 2005, IEEE Computer Society, 0-7695-2283-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Subminiterms, logic adjacency, variable-entered, miniterms rings, prime implicant |
25 | Hafiz Md. Hasan Babu, Moinul Islam Zaber, Md. Rafiqul Islam 0001, Md. Mazder Rahman |
On the Minimization of Multiple-Valued Input Binary-Valued Output Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 34th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2004), 19-22 May 2004, Toronto, Canada, pp. 321-326, 2004, IEEE Computer Society, 0-7695-2130-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Multiple-Valued Input Two-Valued Output Functions, Sum-of-Products (SOPs), Logic Minimization, Prime Implicant |
25 | Yoshinori Yamamoto, Masao Mukaidono |
P-Functions-Ternary Logic Functions Capable of Correcting Input Failures and Suitable for Treating Ambiguities. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 41(1), pp. 28-35, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
P-functions, ternary logic functions, input failures, regular ternary logic, all-prime-implicant disjoint, Boolean connective, irredundant disjunctive form, Boolean functions, ambiguities, ternary logic |
25 | Parthasarathy P. Tirumalai, Jon T. Butler |
Minimization Algorithms for Multiple-Valued Programmable Logic Arrays. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 40(2), pp. 167-177, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
minimisation algorithms, multiple-valued programmable logic arrays, sum-of products, MIN operation, random-symmetric functions, constrained implicant sets, charge-coupled device circuits, performance, CMOS, heuristic algorithms, many-valued logics, minimisation, CMOS integrated circuits, backtracking, logic arrays, tree search, multiple-valued functions, charge-coupled device |
25 | Yue-Sun Kuo |
Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 36(3), pp. 356-359, 1987. The full citation details ...](Pics/full.jpeg) |
1987 |
DBLP DOI BibTeX RDF |
Boolean function with multiple-valued inputs, essential prime implicant, tautology checking, consensus, logic minimization, unate function |
25 | Hsiao-Peng Sherman Lee |
An Algorithm for Minimal TANT Network Generation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 27(12), pp. 1202-1206, 1978. The full citation details ...](Pics/full.jpeg) |
1978 |
DBLP DOI BibTeX RDF |
TANT network, Minimal gate design, prime permissible implicant, second level minimization, third level minimization, tail factor |
25 | Sureshchander |
Minimization of Switching Functions - A Fast Technique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 24(7), pp. 753-756, 1975. The full citation details ...](Pics/full.jpeg) |
1975 |
DBLP DOI BibTeX RDF |
DON'T CARE term, minimal sum, minterm, product-i, product-0, Consensus, prime implicant, subcube, literal |
19 | Sos S. Agaian, Ethan E. Danahy, Karen A. Panetta |
Logical System Representation of Images and Removal of Impulse Noise. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Syst. Man Cybern. Part A ![In: IEEE Trans. Syst. Man Cybern. Part A 38(6), pp. 1349-1362, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
19 | Matthias P. Krieger |
On the Incompressibility of Monotone DNFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 41(2), pp. 211-231, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Judy Goldsmith, Matthias Hagen, Martin Mundhenk |
Complexity of DNF and Isomorphism of Monotone Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 410-421, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Matthias P. Krieger |
On the Incompressibility of Monotone DNFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005, Proceedings, pp. 32-43, 2005, Springer, 3-540-28193-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
19 | Jovanka Ciric, Carl Sechen |
Efficient canonical form for Boolean matching of complex functions in large libraries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(5), pp. 535-544, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
19 | Tsutomu Sasao, Jon T. Butler |
Worst and Best Irredundant Sum-of-Products Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Computers ![In: IEEE Trans. Computers 50(9), pp. 935-948, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
complete sum-of-products expressions, irredundant sum-of-products, heuristic minimization, minimum sum-of-products expressions, worst sum-of-products expressions, graph enumeration, minimally strongly connected digraphs, Logic minimization, prime implicants, symmetric functions, multiple-output functions |
19 | Petr Fiser, Jan Hlavicka |
On the Use of Mutations in Boolean Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DSD ![In: Euromicro Symposium on Digital Systems Design 2001 (Euro-DSD 2001), 4-6 September 2001, Warsaw, Poland, pp. 300-309, 2001, IEEE Computer Society, 0-7695-1239-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
19 | Michael Theobald, Steven M. Nowick |
An Implicit Method for Hazard-Free Two-Level Logic Minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASYNC ![In: 4th International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '98), 30 March - 2 April 1998, San Diego, CA, USA, pp. 58-69, 1998, IEEE Computer Society, 0-8186-8392-9. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
hazard-free, two-level, dynamic-hazard-free prime implicants, asynchronous, BDD, logic minimization, implicit |
19 | Bernhard Beckert, Reiner Hähnle, Anavai Ramesh, Neil V. Murray |
On Anti-Links. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning, 5th International Conference, LPAR'94, Kiev, Ukraine, July 16-22, 1994, Proceedings, pp. 275-289, 1994, Springer, 3-540-58216-9. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
19 | Liliana Díaz-Olavarrieta, K. Illanko, Safwat G. Zaky |
Goal-oriented decomposition of switching functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(5), pp. 655-665, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
19 | Srinivas Devadas, A. Richard Newton |
Exact algorithms for output encoding, state assignment, and four-level Boolean minimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. ![In: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10(1), pp. 13-27, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
19 | Gianfranco Bilardi, Abha Moitra |
Time Lower Bounds For CREW-PRAM Computation Of Monotone Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 16th International Colloquium, ICALP89, Stresa, Italy, July 11-15, 1989, Proceedings, pp. 95-107, 1989, Springer, 3-540-51371-X. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|