Richard J Lipton


Ontology type: schema:Person     


Person Info

NAME

Richard J

SURNAME

Lipton

Publications in SciGraph latest 50 shown

  • 2016 Provably-Secure Remote Memory Attestation for Heap Overflow Protection in SECURITY AND CRYPTOGRAPHY FOR NETWORKS
  • 2011 Symmetric Functions Capture General Functions in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011
  • 2010 On Tractable Exponential Sums in FRONTIERS IN ALGORITHMICS
  • 2010 Improved Simulation of Nondeterministic Turing Machines in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010
  • 2009-05 On the Fourier spectrum of symmetric Boolean functions in COMBINATORICA
  • 2009 Social Network Privacy via Evolving Access Control in WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS
  • 2009 Best-Order Streaming Model in THEORY AND APPLICATIONS OF MODELS OF COMPUTATION
  • 2008-10 Polynomials that Sign Represent Parity and Descartes’ Rule of Signs in COMPUTATIONAL COMPLEXITY
  • 2008-09 Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions in ALGORITHMICA
  • 2008-04 Algorithms for Modular Counting of Roots of Multivariate Polynomials in ALGORITHMICA
  • 2007 Intrusion-Resilient Key Exchange in the Bounded Retrieval Model in THEORY OF CRYPTOGRAPHY
  • 2006 Perfectly Secure Password Protocols in the Bounded Retrieval Model in THEORY OF CRYPTOGRAPHY
  • 2006 Algorithms for Modular Counting of Roots of Multivariate Polynomials in LATIN 2006: THEORETICAL INFORMATICS
  • 2005 Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions in INTERNET AND NETWORK ECONOMICS
  • 2005 Protecting Secret Data from Insider Attacks in FINANCIAL CRYPTOGRAPHY AND DATA SECURITY
  • 2004 Nash Equilibria via Polynomial Equations in LATIN 2004: THEORETICAL INFORMATICS
  • 2004 On the Complexity of Hilbert’s 17th Problem in FSTTCS 2004: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 2003 Randomized Time-Space Tradeoffs for Directed Graph Connectivity in FST TCS 2003: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 2003 Non-uniform Depth of Polynomial Time and Space Simulations in FUNDAMENTALS OF COMPUTATION THEORY
  • 2003 Who’sThe Weakest Link? in STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS
  • 2001-07-13 Quantum Cryptanalysis of Hidden Linear Functions in ADVANCES IN CRYPTOLOGY — CRYPT0’ 95
  • 2001-07-13 Cryptographic Primitives Based on Hard Learning Problems in ADVANCES IN CRYPTOLOGY — CRYPTO’ 93
  • 2001-07-13 Algorithms for Black-Box Fields and their Application to Cryptography in ADVANCES IN CRYPTOLOGY — CRYPTO ’96
  • 2001-07-13 On the Importance of Checking Cryptographic Protocols for Faults in ADVANCES IN CRYPTOLOGY — EUROCRYPT ’97
  • 2001-03 On the Importance of Eliminating Errors in Cryptographic Computations in JOURNAL OF CRYPTOLOGY
  • 1997 DNA2DNA computations: A potential “killer app”? in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1995 Communication complexity of key agreement on small ranges in STACS 95
  • 1994 A new approach to information theory in STACS 94
  • 1994 Straight-line complexity and integer factorization in ALGORITHMIC NUMBER THEORY
  • 1993 Social Processes and Proofs of Theorems and Programs in PROGRAM VERIFICATION
  • 1990 Efficient checking of computations in STACS 90
  • 1990 Playing games of incomplete information in STACS 90
  • 1983 Pseudorandom number generation and space complexity in FOUNDATIONS OF COMPUTATION THEORY
  • 1979-12 A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings in MATHEMATICAL SYSTEMS THEORY
  • 1976 A lower bound of 1/2n2 on linear search programs for the knapsack problem in MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1976
  • 1975 On the complexity of computations under varying sets of primitives in AUTOMATA THEORY AND FORMAL LANGUAGES 2ND GI CONFERENCE KAISERSLAUTERN, MAY 20–23, 1975
  • 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": "https://www.grid.ac/institutes/grid.213917.f", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.16750.35", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.47100.32", 
            "type": "Organization"
          }
        ], 
        "familyName": "Lipton", 
        "givenName": "Richard J", 
        "id": "sg:person.010133373171.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010133373171.27"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:57", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1725.json", 
        "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.010133373171.27'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...