ResearcherID Thomson Reuters  

Håstad, Johan
Create a ResearcherID badge for this researcher View publications analytics for this researcher
Close
ResearcherID: C-1954-2016
E-mail:
URL: http://www.researcherid.com/rid/C-1954-2016
ORCID: http://orcid.org/0000-0002-5379-345X
My Institutions (more details)
Primary Institution:
Sub-org/Dept:
Role:
 
 

This list contains papers that I have authored.

publication(s)  
First Page Previous Page Page   of  8  Go Next Page Last Page
  Sort by:    Results per page: 
1.  Title: The Square Lattice Shuffle (vol 29, pg 466, 2006)
 Author(s): Hastad, Johan
 Source: Random Structures & Algorithms Volume: 48 Issue: 1 Pages: 213 Published: JAN 2016
 Times Cited: 0
 DOI: 10.1002/rsa.20620
added
10-Feb-16
2.  Title: MAKING THE LONG CODE SHORTER
 Author(s): Barak, Boaz; Gopalan, Parikshit; Hastad, Johan; et al.
 Source: Siam Journal on Computing Volume: 44 Issue: 5 Pages: 1287-1324 Published: 2015
 Times Cited: 1
 DOI: 10.1137/130929394
added
10-Feb-16
3.  Title: (2+epsilon)-SAT is NP-hard
 Author(s): Austrin, Per; Guruswami, Venkatesan; Hastad, Johan; et al.
 Source: 2014 55th Annual Ieee Symposium on Foundations of Computer Science (Focs 2014) Pages: 1-10 Published: 2014
 Times Cited: 0
 DOI: 10.1109/FOCS.2014.9
added
10-Feb-16
4.  Title: On DNF Approximators for Monotone Boolean Functions
 Author(s): Blais, Eric; Hastad, Johan; Servedio, Rocco A.; et al.
 Source: Automata, Languages, and Programming (Icalp 2014), Pt I Volume: 8572 Pages: 235-246 Published: 2014
 Times Cited: 0
added
10-Feb-16
5.  Title: ON THE CORRELATION OF PARITY AND SMALL-DEPTH CIRCUITS
 Author(s): Hastad, Johan
 Source: Siam Journal on Computing Volume: 43 Issue: 5 Pages: 1699-1708 Published: 2014
 Times Cited: 7
 DOI: 10.1137/120897432
added
10-Feb-16
6.  Title: ON THE NP-HARDNESS OF MAX-NOT-2
 Author(s): Hastad, Johan
 Source: Siam Journal on Computing Volume: 43 Issue: 1 Pages: 179-193 Published: 2014
 Times Cited: 1
 DOI: 10.1137/120882718
added
10-Feb-16
7.  Title: POLYNOMIAL TIME ALGORITHMS FOR FINDING INTEGER RELATIONS AMONG REAL NUMBERS (vol 18, pg 859, 1989)
 Author(s): Hastad, J.; Just, B.; Lagarias, J. C.; et al.
 Source: Siam Journal on Computing Volume: 43 Issue: 1 Pages: 254 Published: 2014
 Times Cited: 0
 DOI: 10.1137/130947799
added
10-Feb-16
8.  Title: Making the Long Code Shorter
 Author(s): Barak, Boaz; Gopalan, Parikshit; Hastad, Johan; et al.
 Source: 2012 Ieee 53rd Annual Symposium on Foundations of Computer Science (Focs) Pages: 370-379 Published: 2012
 Times Cited: 8
 DOI: 10.1109/FOCS.2012.83
added
10-Feb-16
9.  Title: On the Usefulness of Predicates
 Author(s): Austrin, Per; Hastad, Johan; IEEE
 Source: 2012 Ieee 27th Annual Conference on Computational Complexity (Ccc) Pages: 53-63 Published: 2012
 Times Cited: 0
 DOI: 10.1109/CCC.2012.18
added
10-Feb-16
10.  Title: BEATING THE RANDOM ORDERING IS HARD: EVERY ORDERING CSP IS APPROXIMATION RESISTANT
 Author(s): Guruswami, Venkatesan; Hastad, Johan; Manokaran, Rajsekar; et al.
 Source: Siam Journal on Computing Volume: 40 Issue: 3 Pages: 878-914 Published: 2011
 Times Cited: 11
 DOI: 10.1137/090756144
added
10-Feb-16
publication(s)  
First Page Previous Page Page   of  8  Go Next Page Last Page
  Sort by:    Results per page: