A complexity theory based on Boolean algebra
Journal of the ACM (JACM)
Two lower bounds for branching programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Limits on the power of concurrent-write parallel machines
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Mesh arrays and LOGICIAN: a tool for their efficient generation
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
On the complexity of branching programs and decision trees for clique functions
Journal of the ACM (JACM)
Using smoothness to achieve parallelism
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient simulation of finite automata by neural nets
Journal of the ACM (JACM)
Factorization and circuit in the connection method
Journal of the ACM (JACM)
On the complexity of negation-limited Boolean networks
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
NP trees and Carnap's modal logic
Journal of the ACM (JACM)
Complex Properties of Grammars
Journal of the ACM (JACM)
Journal of the ACM (JACM)
The Area-Time Complexity of Binary Multiplication
Journal of the ACM (JACM)
Bounding Fan-out in Logical Networks
Journal of the ACM (JACM)
Sequential abstract-state machines capture sequential algorithms
ACM Transactions on Computational Logic (TOCL)
ACM Computing Surveys (CSUR)
On the generation of cryptographically strong pseudorandom sequences
ACM Transactions on Computer Systems (TOCS)
Speeding up an overrelaxation method of division in Radix-2n machine
Communications of the ACM
An overview of computational complexity
Communications of the ACM
An overrelaxation for a numerical inverse of a constant
Communications of the ACM
The complexity of testing predicate locks
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Cosmological lower bound on the circuit complexity of a small problem in logic
Journal of the ACM (JACM)
BDD-based logic synthesis for LUT-based FPGAs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Star-Free Open Languages and Aperiodic Loops
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Random Benchmark Circuits with Controlled Attributes
EDTC '97 Proceedings of the 1997 European conference on Design and Test
Measuring energy consumption in VLSI circuits: A foundation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Universal circuits (Preliminary Report)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A 2.5 n-lower bound on the combinational complexity of Boolean functions
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Switching functions whose monotone complexity
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Negation can be exponentially powerful
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The chip complexity of binary arithmetic
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
An algorithm for selection of migration candidates
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Comparison of arithmetic functions with respect to boolean circuit depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Exponential lower bounds for restricted monotone circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Prediction models for cyclomatic complexity
ACM SIGPLAN Notices
On teaching theoretical foundations of Computer Science
ACM SIGACT News
Selection and evaluation of EDP equipment
ACM SIGSMALL Newsletter
An overview of computational complexity
ACM Turing award lectures
A Feebly Secure Trapdoor Function
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Binary Representations of Finite Fields and Their Application to Complexity Theory
Finite Fields and Their Applications
Generic complexity of undecidable problems
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.05 |