Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Self-routing superconcentrators
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On Sparse Parity Check Matrices
Designs, Codes and Cryptography
Computational sample complexity and attribute-efficient learning
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Asymptotically good codes correcting insertions, deletions, and transpositions
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Sparse 0-1-matrices and forbidden hypergraphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Sparse Parity-Check Matrices over ${GF(q)}$
Combinatorics, Probability and Computing
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
A note on the decoding complexity of error-correcting codes
Information Processing Letters
Cryptography with constant computational overhead
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Quantum oblivious mutual identification
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Finite Fields and Their Applications
| Hi-index | 0.00 |