Johan T Håstad


Ontology type: schema:Person     


Person Info

NAME

Johan T

SURNAME

Håstad

Publications in SciGraph latest 50 shown

  • 2017-06-04 Quantum Algorithms for Computing Short Discrete Logarithms and Factoring RSA Integers in POST-QUANTUM CRYPTOGRAPHY
  • 2014 On DNF Approximators for Monotone Boolean Functions in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2012 On the NP-Hardness of Max-Not-2 in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011 Satisfying Degree-d Equations over GF[2]n in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2010-05-20 Special Issue “Conference on Computational Complexity 2009” Guest Editor’s Foreword in COMPUTATIONAL COMPLEXITY
  • 2010 Approximating Linear Threshold Predicates in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2010 An Efficient Parallel Repetition Theorem in THEORY OF CRYPTOGRAPHY
  • 2009-05-05 On the Approximation Resistance of a Random Predicate in COMPUTATIONAL COMPLEXITY
  • 2008-11-19 Every 2-csp Allows Nontrivial Approximation in COMPUTATIONAL COMPLEXITY
  • 2007-09-15 Practical Construction and Analysis of Pseudo-Randomness Primitives in JOURNAL OF CRYPTOLOGY
  • 2007-07 A Smaller Sleeping Bag for a Baby Snake in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2007-02-06 The Security of the IAPM and IACBC Modes in JOURNAL OF CRYPTOLOGY
  • 2007 On the Approximation Resistance of a Random Predicate in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2006 On Nontrivial Approximation of CSPs in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2004 Randomness Extraction and Key Derivation Using the CBC, Cascade and HMAC Modes in ADVANCES IN CRYPTOLOGY – CRYPTO 2004
  • 2001-11-20 Practical Construction and Analysis of Pseudo-Randomness Primitives in ADVANCES IN CRYPTOLOGY — ASIACRYPT 2001
  • 2001-01-01 A Smaller Sleeping Bag for a Baby Snake in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2000 Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms? in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1999-03 Clique is hard to approximate withinn1−ε in ACTA MATHEMATICA
  • 1999 Linear Consistency Testing in RANDOMIZATION, APPROXIMATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 1998 Fitting Points on the Real Line and Its Application to RH Mapping in ALGORITHMS — ESA’ 98
  • 1998 Some recent strong inapproximability results in ALGORITHM THEORY — SWAT'98
  • 1995-06 Top-down lower bounds for depth-three circuits in COMPUTATIONAL COMPLEXITY
  • 1994 Recent results in hardness of approximation in ALGORITHM THEORY — SWAT '94
  • 1992-12 Majority gates vs. general weighted threshold gates in COMPUTATIONAL COMPLEXITY
  • 1991-06 On the power of small-depth threshold circuits in COMPUTATIONAL COMPLEXITY
  • 1990-03 On the power of interaction in COMBINATORICA
  • 1990-03 Simultaneously good bases of a lattice and its reciprocal lattice in MATHEMATISCHE ANNALEN
  • 1990 Everything Provable is Provable in Zero-Knowledge in ADVANCES IN CRYPTOLOGY — CRYPTO’ 88
  • 1989 Tensor rank is NP-complete in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1988-03 Dual vectors and lower bounds for the nearest lattice point problem in COMBINATORICA
  • 1986 Polynomial time algorithms for finding integer relations among real numbers in STACS 86
  • 1986 N Using RSA with Low Exponent in a Public Key Network in ADVANCES IN CRYPTOLOGY — CRYPTO ’85 PROCEEDINGS
  • JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "http://www.grid.ac/institutes/grid.5037.1", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.5675.1", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }
        ], 
        "familyName": "H\u00e5stad", 
        "givenName": "Johan T", 
        "id": "sg:person.011562747461.61", 
        "identifier": [
          {
            "name": "orcid_id", 
            "type": "PropertyValue", 
            "value": "0000-0002-5379-345X"
          }
        ], 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011562747461.61", 
          "https://orcid.org/0000-0002-5379-345X"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-12-01T07:13", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221201/entities/gbq_results/person/person_733.jsonl", 
        "type": "Person"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/person.011562747461.61'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/person.011562747461.61'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/person.011562747461.61'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/person.011562747461.61'


     




    Preview window. Press ESC to close (or click here)


    ...