Search the dblp DataBase
Rafi Heiman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Rafi Heiman, Ilan Newman, Avi Wigderson
On Read-Once Threshold Formulae and Their Randomized Decision Tree Complexity. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1990, pp:78-87 [Conf] - Rafi Heiman, Avi Wigderson
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP]
Structure in Complexity Theory Conference, 1991, pp:172-179 [Conf] - Rafi Heiman
Secure Audio Teleconferencing: A Practical Solution. [Citation Graph (0, 0)][DBLP]
EUROCRYPT, 1992, pp:437-448 [Conf] - Rafi Heiman
A Note on Discrete Logorithms with Special Structure. [Citation Graph (0, 0)][DBLP]
EUROCRYPT, 1992, pp:454-457 [Conf] - Rafi Heiman, Avi Wigderson
Randomized VS. Deterministic Decision Tree Complexity for Read-Once Boolean Functions. [Citation Graph (0, 0)][DBLP]
Computational Complexity, 1991, v:1, n:, pp:311-329 [Journal] - Rafi Heiman, Ilan Newman, Avi Wigderson
On Read-Once Threshold Formulae and Their Randomized Decision in Tree Complexity. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 1993, v:107, n:1, pp:63-76 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002