IEEE Transactions on Computers
On the complexity of negation-limited Boolean networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
More on the complexity of negation-limited circuits
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On the negation-limited circuit complexity of merging
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
On the minimum number of negations leading to super-polynomial savings
Information Processing Letters
Limiting negations in bounded-depth circuits: an extension of Markov's theorem
Information Processing Letters
Using 2-domain partitioned OBDD data structure in an enhanced symbolic simulator
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Synthesis Algorithms for 2-level MOS Networks
IEEE Transactions on Computers
Synthesis of Multilevel Feed-Forward MOS Networks
IEEE Transactions on Computers
Synthesis of Feed-Forward MOS Networks with Cells of Similar Complexities
IEEE Transactions on Computers
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
Theoretical Computer Science
Limiting Negations in Formulas
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Note: Limiting negations in non-deterministic circuits
Theoretical Computer Science
Minimization over Boolean trees
IBM Journal of Research and Development
On the negation-limited circuit complexity of merging
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Linear-size log-depth negation-limited inverter for k-tonic binary sequences
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Limiting negations in bounded treewidth and upward planar circuits
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the negation-limited circuit complexity of sorting and inverting k-tonic sequences
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Negation-Limited complexity of parity and inverters
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Discrete Applied Mathematics
| Hi-index | 0.02 |