 | 1997 |
|---|
| 8 |       | Yenjo Han,
Lane A. Hemaspaandra,
Thomas Thierauf:
Threshold Computation and Cryptographic Security.
SIAM J. Comput. 26(1): 59-78 (1997) |
| 1996 |
|---|
| 7 | | Yenjo Han,
Thomas Thierauf:
Restricted Information from Nonadaptive Queries to NP.
Inf. Comput. 128(2): 119-125 (1996) |
| 6 | | Yenjo Han,
Lane A. Hemaspaandra:
Pseudorandom Generators and the Frequency of Simplicity.
J. Cryptology 9(4): 251-261 (1996) |
| 1995 |
|---|
| 5 |  | Yenjo Han,
Lane A. Hemaspaandra:
Pseudorandom Generators and the Frequency of Simplicity.
STACS 1995: 50-59 |
| 4 | | Yenjo Han,
Thomas Thierauf:
Restricted Information from Nonadaptive Queries to NP.
Structure in Complexity Theory Conference 1995: 206-213 |
| 1993 |
|---|
| 3 | | Yenjo Han,
Lane A. Hemaspaandra,
Thomas Thierauf:
Threshold Computation and Cryptographic Security.
ISAAC 1993: 230-239 |
| 1992 |
|---|
| 2 | | Vikraman Arvind,
Yenjo Han,
Lane A. Hemachandra,
Johannes Köbler,
Antoni Lozano,
Martin Mundhenk,
Mitsunori Ogiwara,
Uwe Schöning,
Riccardo Silvestri,
Thomas Thierauf:
Reductions to Sets of Low Information Content.
Complexity Theory: Current Research 1992: 1-46 |
| 1 | | Vikraman Arvind,
Yenjo Han,
Lane A. Hemachandra,
Johannes Köbler,
Antoni Lozano,
Martin Mundhenk,
Mitsunori Ogiwara,
Uwe Schöning,
Riccardo Silvestri,
Thomas Thierauf:
Reductions to Sets of Low Information Content.
ICALP 1992: 162-173 |
