A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits
IEEE Transactions on Computers
Computing with unreliable information
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Lower bounds for the complexity of reliable boolean circuits with noisy gates
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Reliable computation with noisy circuits and decision trees—a general n log n lower bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Computation in noisy radio networks
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Locating Information with Uncertainty in Fully Interconnected Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
| Hi-index | 0.00 |