Följ
Johan Håstad
Johan Håstad
Professor i teoretisk datalogi, KTH
Verifierad e-postadress på kth.se
Titel
Citeras av
Citeras av
År
Some optimal inapproximability results
J Håstad
Journal of the ACM (JACM) 48 (4), 798-859, 2001
23702001
A pseudorandom generator from any one-way function
J Håstad, R Impagliazzo, LA Levin, M Luby
SIAM Journal on Computing 28 (4), 1364-1396, 1999
18301999
Clique is hard to approximate within n1−ε
J Håstad
13051999
Clique is hard to approximate within n/sup 1-/spl epsiv
J Hastad
Proceedings of 37th Conference on Foundations of Computer Science, 627-636, 1996
10201996
Almost optimal lower bounds for small depth circuits
J Hastad
Proceedings of the eighteenth annual ACM symposium on Theory of computing, 6-20, 1986
9521986
Simple constructions of almost k‐wise independent random variables
N Alon, O Goldreich, J Håstad, R Peralta
Random Structures & Algorithms 3 (3), 289-304, 1992
8441992
Tensor rank is NP-complete
J Håstad
Journal of Algorithms 11 (4), 644-654, 1990
7781990
Computational limitations for small depth circuits
J Håstad
Massachusetts Institute of Technology, 1986
6451986
The bit extraction problem or t-resilient functions
B Chor, O Goldreich, J Hasted, J Freidmann, S Rudich, R Smolensky
26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 396-407, 1985
5491985
Does co-NP have short interactive proofs?
RB Boppana, J Hastad, S Zachos
Information Processing Letters 25 (2), 127-132, 1987
5241987
Everything provable is provable in zero-knowledge
M Ben-Or, O Goldreich, S Goldwasser, J Håstad, J Kilian, S Micali, ...
Advances in Cryptology—CRYPTO’88: Proceedings 8, 37-56, 1990
3641990
On the power of small-depth threshold circuits
J Håstad, M Goldmann
Computational Complexity 1, 113-129, 1991
3561991
Solving simultaneous modular equations of low degree
J Hastad
siam Journal on Computing 17 (2), 336-341, 1988
3311988
Optimal bounds for decision problems on the CRCW PRAM
P Beame, J Hastad
Journal of the ACM (JACM) 36 (3), 643-670, 1989
3101989
Analysis of backoff protocols for multiple access channels
J Hastad, T Leighton, B Rogoff
Proceedings of the nineteenth annual ACM symposium on Theory of computing …, 1987
2931987
Majority gates vs. general weighted threshold gates
M Goldmann, J Håstad, A Razborov
Computational Complexity 2, 277-300, 1992
2781992
Linearity testing in characteristic two
M Bellare, D Coppersmith, J Hastad, M Kiwi, M Sudan
IEEE Transactions on Information Theory 42 (6), 1781-1795, 1996
2551996
N using RSA with low exponent in a public key network
J Hastad
Advances in Cryptology—CRYPTO’85 Proceedings 5, 403-408, 1986
2231986
Randomness extraction and key derivation using the CBC, cascade and HMAC modes
Y Dodis, R Gennaro, J Håstad, H Krawczyk, T Rabin
Advances in Cryptology–CRYPTO 2004: 24th Annual International Cryptology …, 2004
2132004
Construction of pseudorandom generator from any one-way function
J Hastad
21^< st> ACM Symposium on the theory of Computing, 12-24, 1989
2031989
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20