|
Search the dblp DataBase
Yenjo Han:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Yenjo Han, Thomas Thierauf
Restricted Information from Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:206-213 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] Complexity Theory: Current Research, 1992, pp:1-46 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:162-173 [Conf]
- Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
Threshold Computation and Cryptographic Security. [Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:230-239 [Conf]
- Yenjo Han, Lane A. Hemaspaandra
Pseudorandom Generators and the Frequency of Simplicity. [Citation Graph (0, 0)][DBLP] STACS, 1995, pp:50-59 [Conf]
- Yenjo Han, Thomas Thierauf
Restricted Information from Nonadaptive Queries to NP. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:128, n:2, pp:119-125 [Journal]
- Yenjo Han, Lane A. Hemaspaandra
Pseudorandom Generators and the Frequency of Simplicity. [Citation Graph (0, 0)][DBLP] J. Cryptology, 1996, v:9, n:4, pp:251-261 [Journal]
- Yenjo Han, Lane A. Hemaspaandra, Thomas Thierauf
Threshold Computation and Cryptographic Security. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1997, v:26, n:1, pp:59-78 [Journal]
Search in 0.002secs, Finished in 0.003secs
|