J. Håstad

发表

Computational limitations of small-depth circuits

J. Håstad, 1987 .

Clique is hard to approximate withinn1−ε

J. Håstad, 1999 .

Almost optimal lower bounds for small depth circuits

Johan Håstad, J. Håstad, 1986, STOC '86.

Clique is hard to approximate within n 1-C

J. Håstad, 1996 .

On the power of small-depth threshold circuits

Johan Håstad, Mikael Goldmann, J. Håstad, 1991, computational complexity.

On the power of small-depth threshold circuits

Johan Håstad, Mikael Goldmann, J. Håstad, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Some optimal inapproximability results

Johan Håstad, J. Håstad, 2001, JACM.

Clique is hard to approximate within n/sup 1-/spl epsiv//

Johan Håstad, J. Håstad, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

The Random Oracle Hypothesis Is False

Oded Goldreich, Desh Ranjan, B. Chor, 1994, J. Comput. Syst. Sci..

Does co-NP Have Short Interactive Proofs?

Stathis Zachos, Johan Håstad, Ravi B. Boppana, 1987, Inf. Process. Lett..

Message integrity of IAPM and IACBC

J. Håstad, johanh nada.kth.se, 2001 .

The Security of All RSA and Discrete Log Bits

Johan Håstad, Mats Näslund, J. Håstad, 1998 .

Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes

Hugo Krawczyk, Tal Rabin, Yevgeniy Dodis, 2004, CRYPTO.

Tensor Rank is NP-Complete

Johan Håstad, J. Håstad, 1989, ICALP.

(2 + epsilon)-Sat Is NP-Hard

J. Håstad, V. Guruswami, Per Austrin, 2017, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

Simple Construction of Almost k-wise Independent Random Variables

Noga Alon, Oded Goldreich, Johan Håstad, 1992, Random Struct. Algorithms.

Inference of buffer queue times in data processing systems using Gaussian Processes

J. Håstad, 2017 .

Simultaneously good bases of a lattice and its reciprocal lattice

J. Håstad, J. Lagarias, 1990 .

The square lattice shuffle

Johan Håstad, J. Håstad, 2006 .

Complexity Theory, Proofs and Approximation

J. Håstad, 2005 .

BMGL : Synchronous Keystream Generator with Provable Security ( Revision 1 )

J. Håstad, M. Näslund, 2001 .

( 2 + ε )-S AT is NP-hard ∗

J. Håstad, V. Guruswami, Per Austrin, 2014 .

Clique is hard to approximate within n 1-C

J. Håstad, 1996 .

ONEWAY PERMUTATIONS IN NC 0

J. Håstad, 1987 .

The Bit Extraction Problem of t-Resilient Functions (Preliminary Version)

Oded Goldreich, Johan Håstad, Roman Smolensky, 1985, FOCS.

Reconfiguring a hypercube in the presence of faults

Frank Thomson Leighton, Mark Newman, Johan Håstad, 1987, STOC.

Fast Computation Using Faulty Hypercubes (Extended Abstract)

Frank Thomson Leighton, Johan Håstad, Mark Newman, 1989, Symposium on the Theory of Computing.

Clique is hard to approximate within n1-epsilon

Johan Håstad, J. Håstad, 1996, Electron. Colloquium Comput. Complex..

?J USING RSA WITH LOW EXPONENT IN A PUBLIC KEY NETWORM

J. Håstad, 2002 .

Optimal bounds for decision problems on the CRCW PRAM

J. Håstad, P. Beame, 1989, JACM.

(2+ε)-Sat Is NP-hard

Venkatesan Guruswami, Johan Håstad, Per Austrin, 2014, SIAM J. Comput..

Fast computation using faulty hypercubes

J. Håstad, F. Leighton, M. Newman, 1989, Symposium on the Theory of Computing.

Practical Construction and Analysis of Pseudo-Randomness Primitives

Johan Håstad, Mats Näslund, J. Håstad, 2008, Journal of Cryptology.

Funkspiel schemes: an alternative to conventional tamper resistance

Moti Yung, Johan Håstad, Ari Juels, 2000, CCS.

Key Feedback Mode : a Keystream Generator with Provable Security

J. Håstad, M. Näslund, 2000 .

A Pseudorandom Generator from any One-way Function

Leonid A. Levin, Russell Impagliazzo, Johan Håstad, 1999, SIAM J. Comput..

The Discrete Logarithm Modulo a Composite Hides O(n) Bits

Adi Shamir, Johan Håstad, A. W. Schrift, 1993, J. Comput. Syst. Sci..

Everything Provable is Provable in Zero-Knowledge

Silvio Micali, Joe Kilian, Oded Goldreich, 1990, CRYPTO.

Solving Simultaneous Modular Equations of Low Degree

Johan Håstad, J. Håstad, 1988, SIAM J. Comput..

An Efficient Parallel Repetition Theorem

Rafael Pass, Johan Håstad, Krzysztof Pietrzak, 2010, TCC.

On the Complexity of Interactive Proofs with Bounded Communication

Oded Goldreich, Johan Håstad, Oded Goldreich, 1998, Inf. Process. Lett..

Simple Constructions of Almost k -wise Independent Random Variables

Oded Goldreich, J. Håstad, R. Peralta, 2002 .

Simple analysis of graph tests for linearity and PCP

Avi Wigderson, Johan Håstad, A. Wigderson, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

The Shrinkage Exponent of de Morgan Formulas is 2

J. Håstad, 1998, SIAM J. Comput..

Statistical Zero-Knowledge Languages can be Recognized in Two Rounds

Johan Håstad, William Aiello, J. Håstad, 1991, J. Comput. Syst. Sci..

Simple construction of almost k-wise independent random variables

Noga Alon, Oded Goldreich, Johan Håstad, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Hardness of approximate hypergraph coloring

Venkatesan Guruswami, Madhu Sudan, Johan Håstad, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

On the List-Decodability of Random Linear Codes

Venkatesan Guruswami, Johan Håstad, Swastik Kopparty, 2010, IEEE Transactions on Information Theory.

Majority gates vs. general weighted threshold gates

Alexander A. Razborov, Johan Håstad, Mikael Goldmann, 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

On the Size of Weights for Threshold Gates

Johan Håstad, J. Håstad, 1994, SIAM J. Discret. Math..

Bounded Independence versus Symmetric Tests

Emanuele Viola, Ravi B. Boppana, Chin Ho Lee, 2019, ACM Trans. Comput. Theory.

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

Prasad Raghavendra, Venkatesan Guruswami, Johan Håstad, 2011, SIAM J. Comput..

Randomly supported independence and resistance

Johan Håstad, Per Austrin, J. Håstad, 2009, STOC '09.

On the Approximation Resistance of a Random Predicate

Johan Håstad, J. Håstad, 2007, computational complexity.

Every 2-csp Allows Nontrivial Approximation

Johan Håstad, J. Håstad, 2005, STOC '05.

An Average-Case Depth Hierarchy Theorem for Higher Depth

Johan Håstad, J. Håstad, 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

On Using RSA with Low Exponent in a Public Key Network

Johan Håstad, J. Håstad, 1985, CRYPTO.

The security of individual RSA bits

Johan Håstad, Mats Näslund, J. Håstad, 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

Perfect zero-knowledge languages can be recognized in two rounds

Johan Håstad, William Aiello, J. Håstad, 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0

Johan Håstad, Ingo Wegener, Norbert Wurm, 1994, Inf. Comput..

On bounded occurrence constraint satisfaction

Johan Håstad, J. Håstad, 2000, Inf. Process. Lett..

A new way to use semidefinite programming with applications to linear equations mod p

Johan Håstad, Lars Engebretsen, Gunnar Andersson, 2001, SODA '99.

A well-characterized approximation problem

Johan Håstad, Steven J. Phillips, Shmuel Safra, 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound pdf

Venkatesan Guruswami, Johan Håstad, J. Håstad, 2020, IEEE Transactions on Information Theory.

Combinatorial bounds for list decoding

Venkatesan Guruswami, Madhu Sudan, Johan Håstad, 2002, IEEE Trans. Inf. Theory.

(2+ε)-Sat Is NP-hard

Venkatesan Guruswami, Johan Håstad, Per Austrin, 2014, SIAM J. Comput..

Following a tangent of proofs

Johan Håstad, J. Håstad, 2019, Providing Sound Foundations for Cryptography.

Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers

Jeffrey C. Lagarias, Johan Håstad, Claus-Peter Schnorr, 1989, STACS.

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

Venkatesan Guruswami, Johan Håstad, Srikanth Srinivasan, 2013, STOC.

Special Issue “Conference on Computational Complexity 2009” Guest Editor’s Foreword

Johan Håstad, J. Håstad, 2010, Computational Complexity.

On the Correlation of Parity and Small-Depth Circuits

Johan Håstad, J. Håstad, 2014, SIAM J. Comput..

Satisfying Degree-d Equations over GF[2]n

Johan Håstad, J. Håstad, 2013, Theory of Computing.

Satisfying Degree-d Equations over GF[2] n

Johan Håstad, J. Håstad, 2011, APPROX-RANDOM.

On the Message Complexity of Interactive Proof Systems

Oded Goldreich, Johan Håstad, Oded Goldreich, 1996, Electron. Colloquium Comput. Complex..

The bit extraction problem or t-resilient functions

Oded Goldreich, Johan Håstad, Roman Smolensky, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Addendum to "Simple Construction of Almost k-wise Independent Random Variables"

Noga Alon, Oded Goldreich, Johan Håstad, 1993, Random Struct. Algorithms.

An Improved Bound on the Fraction of Correctable Deletions

Venkatesan Guruswami, Boris Bukh, Johan Håstad, 2015, IEEE Transactions on Information Theory.

The Number Field Sieve an Integer Factorization Algorithm the Number Field Sieve an Integer Factorization Algorithm

J. Håstad, 2022 .

Practical Construction and Analysis of Pseudo-Randomness Primitives

Johan Håstad, Mats Näslund, J. Håstad, 2001, ASIACRYPT.

Improved Analysis of the BMGL Keystream Generator

Johan Håstad, Mats Näslund, J. Håstad, 2001 .

A Slight Sharpening of LMN

Johan Håstad, J. Håstad, 2001, J. Comput. Syst. Sci..

On the power of interaction

Shafi Goldwasser, Johan Håstad, William Aiello, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

On the advantage over a random assignment

Srinivasan Venkatesh, Johan Håstad, J. Håstad, 2002, STOC '02.

Top-down lower bounds for depth-three circuits

Pavel Pudlák, Johan Håstad, Stasys Jukna, 1995, computational complexity.

The square lattice shuffle

Johan Håstad, J. Håstad, 2006, Random Struct. Algorithms.

Making the Long Code Shorter

Prasad Raghavendra, David Steurer, Johan Håstad, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Some optimal inapproximability results

Johan Håstad, J. Håstad, 1997, STOC '97.

Pseudo-random generators under uniform assumptions

Johan Håstad, J. Håstad, 1990, STOC '90.

Linear Consistency Testing

Yonatan Aumann, Madhu Sudan, Johan Håstad, 1999, RANDOM-APPROX.

Linearity testing in characteristic two

Mihir Bellare, Madhu Sudan, Johan Håstad, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

Quantum algorithms for computing short discrete logarithms and factoring RSA integers

Martin Ekeraa, Johan Haastad, J. Håstad, 2017, IACR Cryptol. ePrint Arch..

Dual vectors and lower bounds for the nearest lattice point problem

Johan Håstad, J. Håstad, 1988, Comb..

Towards an optimal separation of space and length in resolution

Johan Håstad, Jakob Nordström, J. Håstad, 2008, Theory Comput..

The Randomized Communication Complexity of Set Disjointness

Avi Wigderson, Johan Håstad, A. Wigderson, 2007, Theory Comput..

Composition of the Universal Relation

Avi Wigderson, Johan Håstad, A. Wigderson, 1990, Advances In Computational Complexity Theory.

Top-down lower bounds for depth 3 circuits

Pavel Pudlák, Johan Håstad, Stasys Jukna, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Reconstructing Truncated Integer Variables Satisfying Linear Congruences

Alan M. Frieze, Jeffrey C. Lagarias, Adi Shamir, 1988, SIAM J. Comput..