Håstad, Johan - Department of Numerical Analysis and Computer Science, Royal Institute of Technology, Sweden (KTH)

• THEORY OF COMPUTING, Volume 3 (2007), pp. 103128 http://theoryofcomputing.org
• The square lattice shu#e Johan Hastad
• MAJORITY GATES VS. GENERAL WEIGHTED THRESHOLD GATES
• Almost Optimal Lower Bounds for Small Depth Circuits Johan Hastad*
• Addendum to the paper ``Simple Constructions of Almost kwise Independent Random Variables''
• Linear Consistency Testing Yonatan Aumann y Johan H astad z Michael O. Rabin x Madhu Sudan {
• On the Complexity of Interactive Proof with Bounded Communication
• ON LOWER BOUNDS FOR SELECTING THE MEDIAN DORIT DOR , JOHAN HSTAD y , STAFFAN ULFBERG y , AND URI ZWICK
• Practical Construction and Analysis of Pseudorandomness Primitives
• Funkspiel Schemes: An Alternative to Conventional Tamper Resistance Johan H astad
• OPTIMAL DEPTH, VERY SMALL SIZE CIRCUITS FOR SYMMETRIC FUNCTIONS IN AC 0
• Composition of the Universal Relation Johan Hastad \Lambda Avi Wigderson y
• A Simple Lower Bound for Monotone Clique Using a Communication Game
• ONEWAY PERMUTATIONS IN NC 0 Johan Hastad*
• On Average Time Hierarchies Mikael Goldmann Per Grape
• A slight sharpening of LMN Johan Hastad
• The Security of all RSA and Discrete Log Bits JOHAN H ASTAD
• Relativized Perfect Zero Knowledge is not BPP . William Aiello* Johan Hastad**
• ON THE POWER OF SMALLDEPTH THRESHOLD CIRCUITS
• The Discrete Logarithm Modulo a Composite Hides O(n) Bits
• RANDOMLY SUPPORTED INDEPENDENCE AND RESISTANCE PER AUSTRIN AND JOHAN HSTAD
• On the advantage over a random assignment Johan Hastad 1,3 S. Venkatesh 2 ,3
• Hardness of Approximate Hypergraph Coloring # Venkatesan Guruswami + Johan Hastad # Madhu Sudan
• A WellCharacterized Approximation Problem Johan Hastad
• SIAM J. on Computing c fl1995 Society for Industrial and Applied Mathematics
• Division in O(log n) Depth Using O(n 1+ffl ) Processors Johan Hastad* and Tom Leightony
• Perfect zero knowledge in AM T coAM Johan Hastad
• Tensor Rank is NPcomplete Johan Hastad
• On bounded occurrence constraint satisfaction Johan H astad
• The Random Oracle Hypothesis is False Richard Chang 1;2 Benny Chor 3;4 Oded Goldreich 3;5
• THEORY OF COMPUTING, Volume 2 (2006), pp. 249266 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 225247 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 65--90 http://theoryofcomputing.org
• The square lattice shuffle Johan Hastad
• THEORY OF COMPUTING, Volume 6 (2010), pp. 113--134 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 211--219 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 191--193 http://theoryofcomputing.org
• Notes for the course advanced algorithms January 2000
• THEORY OF COMPUTING, Volume 1 (2005), pp. 177--216 http://theoryofcomputing.org
• The Random Oracle Hypothesis is False Richard Chang1 2 Benny Chor3 4 Oded Goldreich3 5
• THEORY OF COMPUTING, Volume 3 (2007), pp. 81102 http://theoryofcomputing.org
• ON THE POWER OF SMALL-DEPTH THRESHOLD CIRCUITS
• ON THE POWER OF INTERACTION William Aielloy Shafi Goldwasser* Johan Hastadz
• Warning: Essentially this paper has been published in Discrete and Computational Geometry and is subject to copyright restrictions. In
• Statistical ZeroKnowledge Languages Can Be Recognized in Two Rounds William Aiello* Johan Hastad**
• A Pseudorandom Generator Oneway Function
• GURUSWAMI, H ASTAD, SUDAN, AND ZUCKERMAN 1
• Tight bounds for searching a sorted array of strings Arne Andersson \Lambda Torben Hagerup y Johan Hastad z Ola Petersson x
• Clique is hard to approximate within n 1 Johan H astad
• THE SHRINKAGE EXPONENT OF DE MORGAN FORMULAE IS 2 JOHAN HaSTAD
• A New Way of Using Semide nite Programming with Applications to Linear Equations mod p
• Introduction Let f be Boolean function from nite binary strings to the set f0; 1g.
• Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem
• On the Shrinkage Exponent for ReadOnce Formulae Johan Hastad
• Simple Constructions of Almost kwise Independent Random Variables
• Every 2CSP Allows Nontrivial Approximation Royal Institute of Technology
• Monotone Circuits for Connectivity Have Depth (log n) 2\Gammao(1) Mikael Goldmann \Lambda
• Circuit Bottom Fanin and Computational Power
• THEORY OF COMPUTING, Volume 5 (2009), pp. 257282 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 69--82 www.theoryofcomputing.org
• SIAM J. on Computing c 1995 Society for Industrial and Applied Mathematics Vol. 0, No. 1, pp. 000{000, October 1995 000
• SOLVING SIMULTANEOUS MODULAR EQUATIONS OF LOW DEGREE Johan Hastad*
• THEORY OF COMPUTING, Volume 3 (2007), pp. 6179 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 75--99 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 2936 http://theoryofcomputing.org
• A slight sharpening of LMN Johan Hastad
• Tight bounds for searching a sorted array of strings Arne Andersson Torben Hagerupy Johan Hastadz Ola Peterssonx
• THEORY OF COMPUTING, Volume 7 (2011), pp. 4974 www.theoryofcomputing.org
• EVERY 2-CSP ALLOWS NONTRIVIAL APPROXIMATION
• THEORY OF COMPUTING, Volume 1 (2005), pp. 47--79 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 135--177 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 1--25 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 141--172 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 207224 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 119129 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 1--20 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 27--43 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 129--157 http://theoryofcomputing.org
• GURUSWAMI, H ASTAD, SUDAN, AND ZUCKERMAN 1 Combinatorial Bounds for List Decoding
• THEORY OF COMPUTING, Volume 4 (2008), pp. 191193 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 149--176 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 177216 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 149--176 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 291--308 www.theoryofcomputing.org
• On the Complexity of Interactive Proof with Bounded Communication
• THEORY OF COMPUTING, Volume 4 (2008), pp. 111128 http://theoryofcomputing.org
• A Pseudorandom Generator One-way Function
• The Discrete Logarithm Modulo a Composite Hides O(n) Bits
• THEORY OF COMPUTING, Volume 1 (2005), pp. 81--103 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 135--140 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 53--64 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 120 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 4560 http://theoryofcomputing.org
• On Average Time Hierarchies Mikael Goldmann Per Grape
• THEORY OF COMPUTING, Volume 6 (2010), pp. 113134 www.theoryofcomputing.org
• Simple Constructions of Almost k-wise Independent Random Variables
• Addendum to the paper \Simple Constructions of Almost k-wise Independent Random Variables"
• THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 3 (2011), pp. 115
• THEORY OF COMPUTING, Volume 3 (2007), pp. 179195 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 141172 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 137--168 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 119--148 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 103--128 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 45--60 http://theoryofcomputing.org
• An Efficient Parallel Repetition Theorem Johan Hastad1
• THEORY OF COMPUTING, Volume 5 (2009), pp. 1--42 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 21--51 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 207--224 http://theoryofcomputing.org
• Linearity Testing in Characteristic Two \Lambda M. Bellare y D. Coppersmith z J. H astad x M. Kiwi --M. Sudan k
• THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 3 (2011), pp. 1--15
• THEORY OF COMPUTING, Volume 6 (2010), pp. 227--245 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 129--135 http://theoryofcomputing.org
• Some optimal inapproximability results Johan H astad
• THEORY OF COMPUTING, Volume 7 (2011), pp. 19--25 www.theoryofcomputing.org
• On the efficient approximability of constraint satisfaction problems
• THEORY OF COMPUTING, Volume 1 (2005), pp. 119148 http://theoryofcomputing.org
• MAJORITY GATES VS. GENERAL WEIGHTED THRESHOLD GATES
• THEORY OF COMPUTING, Volume 4 (2008), pp. 137168 http://theoryofcomputing.org
• A Well-Characterized Approximation Problem Johan Hastad
• THEORY OF COMPUTING, Volume 6 (2010), pp. 179199 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 118 www.theoryofcomputing.org
• ONEWAY PERMUTATIONS IN NC0 Johan Hastad*
• Dual Vectors and Lower Bounds for the Nearest Lattice Point Problem
• Tensor Rank is NP-complete Johan Hastad
• ON THE POWER OF INTERACTION William Aielloy Sha Goldwasser* Johan Hastadz
• Relativized Perfect Zero Knowledge is not BPP. William Aiello* Johan Hastad**
• Composition of the Universal Relation Johan Hastad Avi Wigdersony
• OPTIMAL DEPTH, VERY SMALL SIZE CIRCUITS FOR SYMMETRIC FUNCTIONS IN AC0
• On the Shrinkage Exponent for Read-Once Formulae Johan Hastad
• TOP-DOWN LOWER BOUNDS FOR DEPTH-THREE CIRCUITS
• Circuit Bottom Fan-in and Computational Power
• THE SHRINKAGE EXPONENT OF DE MORGAN FORMULAE IS 2 JOHAN HaSTAD
• Monotone Circuits for Connectivity Have Depth (log n) Mikael Goldmann
• Hardness of Approximate Hypergraph Coloring Venkatesan Guruswami
• The Security of all RSA and Discrete Log Bits JOHAN HASTAD
• On the security of the IAPM and IACBC modes Johan Hastad
• ON THE APPROXIMATION RESISTANCE OF A RANDOM PREDICATE
• On the List-Decodability of Random Linear Codes Venkatesan Guruswami Johan Hastad Swastik Kopparty
• Complexity theory, proofs and approximation Johan Hastad
• Towards an Optimal Separation of Space and Length in Resolution
• THEORY OF COMPUTING, Volume 1 (2005), pp. 119148 http://theoryofcomputing.org
• THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 2 (2011), pp. 154
• THEORY OF COMPUTING, Volume 7 (2011), pp. 101117 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 7599 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 4548 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 2743 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 291308 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 247290 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 227245 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 177216 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 149176 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 105117 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 81103 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 3746 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 128 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 211219 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 8184 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 125 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 6982 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 142 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 129135 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 129157 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 121135 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 81103 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 4779 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 2151 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 137146 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 5364 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 83117 www.theoryofcomputing.org
• Tips for ToC authors: recommendations, policies
• THEORY OF COMPUTING, Volume 7 (2011), pp. 49--74 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 173--183 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 81--84 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 119--148 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 2543 http://theoryofcomputing.org
• Theory of Computing, Volume 2 (2006), pp. 121-135 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 37-46 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 177-216 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 81-103 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 257--282 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 201--225 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 61--79 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 247--290 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 177--216 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 101--117 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 37--46 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 1--18 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 121--135 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 179--199 www.theoryofcomputing.org
• Statistical Zero-Knowledge Languages Can Be Recognized in Two Rounds William Aiello* Johan Hastad**
• On the advantage over a random assignment Johan Hastad1,3
• THEORY OF COMPUTING, Volume 3 (2007), pp. 25--43 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 1--28 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 149176 http://theoryofcomputing.org
• A Simple Lower Bound for Monotone Clique Using a Communication Game
• Theory of Computing, Volume 3 (2007), pp. 129-157 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 105-117 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 119-148 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 105--117 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 221--238 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 119--129 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 81--103 http://theoryofcomputing.org
• Division in O(logn) Depth Using O(n1+ ) Processors
• THEORY OF COMPUTING, Volume 3 (2007), pp. 221238 http://theoryofcomputing.org
• Practical Construction and Analysis of Pseudo-randomness Primitives
• Almost Optimal Lower Bounds for Small Depth Circuits Johan Hastad*
• THEORY OF COMPUTING, Volume 7 (2011), pp. 1925 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 135140 www.theoryofcomputing.org
• Perfect zero knowledge in AM Tco-AM Johan Hastad
• Notes for the course advanced algorithms January 2000
• THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 2 (2011), pp. 1--54
• THEORY OF COMPUTING, Volume 2 (2006), pp. 225--247 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 137--146 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 4 (2008), pp. 111--128 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 179--195 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 1 (2005), pp. 29--36 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 7 (2011), pp. 45--48 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 5 (2009), pp. 83--117 www.theoryofcomputing.org
• THEORY OF COMPUTING, Volume 3 (2007), pp. 81--102 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 249--266 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 6 (2010), pp. 135177 www.theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 149-176 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 1-28 http://theoryofcomputing.org
• Theory of Computing, Volume 1 (2005), pp. 29-36 http://theoryofcomputing.org
• THEORY OF COMPUTING, Volume 2 (2006), pp. 173183 http://theoryofcomputing.org
• Approximating Linear Threshold Predicates Mahdi Cheraghchi
• Satisfying degree d equations over GF[2]n Johan Hastad
• SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics Vol. 40, No. 3, pp. 878914