Size-time complexity of Boolean networks for prefix computations
Journal of the ACM (JACM)
Extreme Area-Time Tradeoffs in VLSI
IEEE Transactions on Computers
Tight bounds for the chaining problem
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Deterministic restrictions in circuit complexity
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On monotone formulae with restricted depth
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Superconcentrators, generalizers and generalized connectors with limited depth
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The complexity of computations by networks
IBM Journal of Research and Development - Mathematics and computing
Bounded-depth circuits: separating wires from gates
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Circuit Complexity of Regular Languages
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Constant-Round Multiparty Computation for Interval Test, Equality Test, and Comparison
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Steiner transitive-closure spanners of low-dimensional posets
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |