1993 | ||
---|---|---|
6 | Rafi Heiman, Ilan Newman, Avi Wigderson: On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. Theor. Comput. Sci. 107(1): 63-76 (1993) | |
1992 | ||
5 | EE | Rafi Heiman: Secure Audio Teleconferencing: A Practical Solution. EUROCRYPT 1992: 437-448 |
4 | EE | Rafi Heiman: A Note on Discrete Logorithms with Special Structure. EUROCRYPT 1992: 454-457 |
1991 | ||
3 | Rafi Heiman, Avi Wigderson: Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. Structure in Complexity Theory Conference 1991: 172-179 | |
2 | Rafi Heiman, Avi Wigderson: Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. Computational Complexity 1: 311-329 (1991) | |
1990 | ||
1 | Rafi Heiman, Ilan Newman, Avi Wigderson: On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity. Structure in Complexity Theory Conference 1990: 78-87 |
1 | Ilan Newman | [1] [6] |
2 | Avi Wigderson | [1] [2] [3] [6] |