Sofya Raskhodnikova


Ontology type: schema:Person     


Person Info

NAME

Sofya

SURNAME

Raskhodnikova

Publications in SciGraph latest 50 shown

  • 2018-07-31 The Power and Limitations of Uniform Samples in Testing Properties of Figures in ALGORITHMICA
  • 2018-06-29 Bipartite Graphs of Small Readability in COMPUTING AND COMBINATORICS
  • 2016-04-22 Linearity Testing/Testing Hadamard Codes in ENCYCLOPEDIA OF ALGORITHMS
  • 2016-04-22 Differentially Private Analysis of Graphs in ENCYCLOPEDIA OF ALGORITHMS
  • 2016-04-22 Testing if an Array Is Sorted in ENCYCLOPEDIA OF ALGORITHMS
  • 2015-09-02 Linearity and Group Homomorphism Testing/Testing Hadamard Codes in ENCYCLOPEDIA OF ALGORITHMS
  • 2015-08-11 Private Analysis of Graph Data in ENCYCLOPEDIA OF ALGORITHMS
  • 2015-06-16 On the Readability of Overlap Digraphs in COMBINATORIAL PATTERN MATCHING
  • 2015-03-25 Testing Lipschitz Functions on Hypergrid Domains in ALGORITHMICA
  • 2015-02-06 Testing if an Array Is Sorted in ENCYCLOPEDIA OF ALGORITHMS
  • 2014-02-08 Steiner transitive-closure spanners of low-dimensional posets in COMBINATORICA
  • 2013 Analyzing Graphs with Node Differential Privacy in THEORY OF CRYPTOGRAPHY
  • 2013 Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy in THEORY OF CRYPTOGRAPHY
  • 2012-02-22 Sublinear Algorithms for Approximating String Compressibility in ALGORITHMICA
  • 2012 Limitations of Local Filters of Lipschitz and Monotone Functions in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2012 Testing Lipschitz Functions on Hypergrid Domains in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011 Steiner Transitive-Closure Spanners of Low-Dimensional Posets in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Improved Approximation for the Directed Spanner Problem in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2010 Lower Bounds for Local Monotonicity Reconstruction from Transitive-Closure Spanners in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2010 Transitive-Closure Spanners: A Survey in PROPERTY TESTING
  • 2010 Approximation Algorithms for Min-Max Generalization Problems in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2007 Sublinear Algorithms for Approximating String Compressibility in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2003 Approximate Testing of Visual Properties in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION.. ALGORITHMS AND TECHNIQUES
  • 1999 Improved Testing Algorithms for Monotonicity in RANDOMIZATION, APPROXIMATION, 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.189504.1", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.116068.8", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.29857.31", 
            "type": "Organization"
          }
        ], 
        "familyName": "Raskhodnikova", 
        "givenName": "Sofya", 
        "id": "sg:person.07502404747.45", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07502404747.45"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-08-04T17:38", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/person/person_764.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.07502404747.45'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...