Any AND-OR Formula of Size $N$ Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
SIAM Journal on Computing
Gate evaluation secret sharing and secure one-round two-party computation
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Faster quantum algorithm for evaluating game trees
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On the applicability of Post's lattice
Information Processing Letters
A generalization of spira's theorem and circuits with small segregators or separators
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.89 |