David P Woodruff


Ontology type: schema:Person     


Person Info

NAME

David P

SURNAME

Woodruff

Publications in SciGraph latest 50 shown

  • 2017-10 When distributed computation is communication expensive in DISTRIBUTED COMPUTING
  • 2016-12 True Randomness from Big Data in SCIENTIFIC REPORTS
  • 2016-11 Guest Editorial for Information Complexity and Applications in ALGORITHMICA
  • 2016-11 Certifying Equality With Limited Interaction in ALGORITHMICA
  • 2016-02 Space-Efficient Estimation of Statistics Over Sub-Sampled Streams in ALGORITHMICA
  • 2016 Frequency Moments in ENCYCLOPEDIA OF DATABASE SYSTEMS
  • 2015-10 A General Method for Estimating Correlated Aggregates Over a Data Stream in ALGORITHMICA
  • 2015 Amplification of One-Way Information Complexity via Codes and Noise Sensitivity in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2015 The Simultaneous Communication of Disjointness with Applications to Data Streams in AUTOMATA, LANGUAGES, AND PROGRAMMING
  • 2014-06 Steiner transitive-closure spanners of low-dimensional posets in COMBINATORICA
  • 2014 On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model in DISTRIBUTED COMPUTING
  • 2013 A Tight Lower Bound for High Frequency Moment Estimation with Small Error in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2013 When Distributed Computation Is Communication Expensive in DISTRIBUTED COMPUTING
  • 2012 On Deterministic Sketching and Streaming for Sparse Recovery and Norm Estimation in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011 Streaming Algorithms with One-Sided Estimation in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011 Optimal Random Sampling from Distributed Streams Revisited in DISTRIBUTED COMPUTING
  • 2011 Steiner Transitive-Closure Spanners of Low-Dimensional Posets in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2011 Tolerant Algorithms in ALGORITHMS – ESA 2011
  • 2010 Additive Spanners in Nearly Quadratic Time 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 A Quadratic Lower Bound for Three-Query Linear Locally Decodable Codes over Any Field in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2008 Corruption and Recovery-Efficient Locally Decodable Codes in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2007 Revisiting the Efficiency of Malicious Two-Party Computation in ADVANCES IN CRYPTOLOGY - EUROCRYPT 2007
  • 2006 Polylogarithmic Private Approximations and Efficient Matching in THEORY OF CRYPTOGRAPHY
  • 2006 Fast Algorithms for the Free Riders Problem in Broadcast Encryption in ADVANCES IN CRYPTOLOGY - CRYPTO 2006
  • 2006 Better Approximations for the Minimum Common Integer Partition Problem in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2005 Practical Cryptography in High Dimensional Tori in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2005
  • 2004 Asymptotically Optimal Communication for Torus-Based Cryptography in ADVANCES IN CRYPTOLOGY – CRYPTO 2004
  • 2002-04-29 Cryptography in an Unbounded Computational Model in ADVANCES IN CRYPTOLOGY — EUROCRYPT 2002
  • Affiliations

    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.481551.c", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Woodruff", 
        "givenName": "David P", 
        "id": "sg:person.012727410605.86", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012727410605.86"
        ], 
        "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_1730.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.012727410605.86'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...