Rafi Heiman

According to our database, Rafi Heiman authored at least 5 papers between 1991 and 1993.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

1993

On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity.

Rafi Heiman, Ilan Newman, Avi Wigderson

Theor. Comput. Sci., 1993

1992

A Note on Discrete Logorithms with Special Structure.

Rafi Heiman

Proceedings of the Advances in Cryptology, 1992

Secure Audio Teleconferencing: A Practical Solution.

Rafi Heiman

Proceedings of the Advances in Cryptology, 1992

1991

Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions.

Rafi Heiman, Avi Wigderson

Comput. Complex., 1991

Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions.

Rafi Heiman, Avi Wigderson

Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991