Tali Kaufman


Ontology type: schema:Person     


Person Info

NAME

Tali

SURNAME

Kaufman

Publications in SciGraph latest 50 shown

  • 2021-10-27 Erratum to: High Order Random Walks: Beyond Spectral Gap in COMBINATORICA
  • 2020-03-04 High Order Random Walks: Beyond Spectral Gap in COMBINATORICA
  • 2017-11-04 On expansion and topological overlap in GEOMETRIAE DEDICATA
  • 2016-02 Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2015-07-23 Symmetric LDPC codes and local testing in COMBINATORICA
  • 2012-12-18 2-Transitivity is Insufficient for Local Testability in COMPUTATIONAL COMPLEXITY
  • 2012-09-21 Comparing the strength of query types in property testing: The case of k-colorability in COMPUTATIONAL COMPLEXITY
  • 2011 Proximity Oblivious Testing and the Role of Invariances in STUDIES IN COMPLEXITY AND CRYPTOGRAPHY. MISCELLANEA ON THE INTERPLAY BETWEEN RANDOMNESS AND COMPUTATION
  • 2011 Dense Locally Testable Codes Cannot Have Constant Rate and Distance in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011 Proximity Oblivious Testing and the Role of Invariances in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2010 Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability in PROPERTY TESTING
  • 2010 Symmetric LDPC Codes and Local Testing in PROPERTY TESTING
  • 2010 Locally Testable vs. Locally Decodable Codes in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2009 Succinct Representation of Codes with Applications to Testing in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2008 Breaking the ε-Soundness Bound of the Linearity Test over GF(2) in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2006 Long Extended BCH Codes Are Spanned by Minimum Weight Words in APPLIED ALGEBRA, ALGEBRAIC ALGORITHMS AND ERROR-CORRECTING CODES
  • 2003 Testing Low-Degree Polynomials over GF(2) in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION.. ALGORITHMS AND TECHNIQUES
  • 2003 Tight Bounds for Testing Bipartiteness in General Graphs in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION.. ALGORITHMS AND TECHNIQUES
  • 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.22098.31", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.13992.30", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.78989.37", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.12136.37", 
            "type": "Organization"
          }
        ], 
        "familyName": "Kaufman", 
        "givenName": "Tali", 
        "id": "sg:person.011723444630.05", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011723444630.05"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-05-10T11:31", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/person/person_960.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.011723444630.05'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...