Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. - Rafi Heiman; Avi Wigderson (SCT, 1991)

Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. - Rafi Heiman; Avi Wigderson (Comput. Complex., 1991)

Secure Audio Teleconferencing: A Practical Solution. - Rafi Heiman (EUROCRYPT, 1992)

A Note on Discrete Logorithms with Special Structure. - Rafi Heiman (EUROCRYPT, 1992)

On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. - Rafi Heiman; Ilan Newman; Avi Wigderson (Theor. Comput. Sci., 1993)