Rajmohan Rajaraman


Ontology type: schema:Person     


Person Info

NAME

Rajmohan

SURNAME

Rajaraman

Publications in SciGraph latest 50 shown

  • 2018-03-13 Plane Gossip: Approximating Rumor Spread in Planar Graphs in LATIN 2018: THEORETICAL INFORMATICS
  • 2016 Information Spreading in Dynamic Networks Under Oblivious Adversaries in DISTRIBUTED COMPUTING
  • 2016 Balls and Funnels: Energy Efficient Group-to-Group Anycasts in COMPUTING AND COMBINATORICS
  • 2016 Essentially Optimal Robust Secret Sharing with Maximal Corruptions in ADVANCES IN CRYPTOLOGY – EUROCRYPT 2016
  • 2016 Randomized Rounding in ENCYCLOPEDIA OF ALGORITHMS
  • 2015-12 Coupled and k-sided placements: generalizing generalized assignment in MATHEMATICAL PROGRAMMING
  • 2014-10 Foreword: Parallelism in Algorithms and Architectures in THEORY OF COMPUTING SYSTEMS
  • 2014 On Constructing DAG-Schedules with Large AREAs in EURO-PAR 2014 PARALLEL PROCESSING
  • 2014 Coupled and k-Sided Placements: Generalizing Generalized Assignment in INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION
  • 2014 Performance-Driven Clustering in ENCYCLOPEDIA OF ALGORITHMS
  • 2013-10 Performance of IEEE 802.11 under Jamming in MOBILE NETWORKS AND APPLICATIONS
  • 2012 Cache Me If You Can: Capacitated Selfish Replication Games in LATIN 2012: THEORETICAL INFORMATICS
  • 2010-11 Approximation Algorithms for Multiprocessor Scheduling under Uncertainty in THEORY OF COMPUTING SYSTEMS
  • 2009 Approximation Algorithms for Key Management in Secure Multicast in COMPUTING AND COMBINATORICS
  • 2008 Performance-Driven Clustering in ENCYCLOPEDIA OF ALGORITHMS
  • 2008 Randomized Rounding in ENCYCLOPEDIA OF ALGORITHMS
  • 2006 GIST: Group-Independent Spanning Tree for Data Aggregation in Dense Sensor Networks in DISTRIBUTED COMPUTING IN SENSOR SYSTEMS
  • 2005 Directions in Multi-Query Optimization for Sensor Networks in ADVANCES IN PERVASIVE COMPUTING AND NETWORKING
  • 2005 Multi-query Optimization for Sensor Networks in DISTRIBUTED COMPUTING IN SENSOR SYSTEMS
  • 2004-05 Approximation Algorithms for Average Stretch Scheduling in JOURNAL OF SCHEDULING
  • 2002-12 An efficient distributed algorithm for constructing small dominating sets in DISTRIBUTED COMPUTING
  • 2001-09 Towards More Complete Models of TCP Latency and Throughput in THE JOURNAL OF SUPERCOMPUTING
  • 1999-06 Accessing Nearby Copies of Replicated Objects in a Distributed Environment in THEORY OF COMPUTING SYSTEMS
  • 1997 Rapid convergence of a local load balancing algorithm for asynchronous rings in DISTRIBUTED ALGORITHMS
  • 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.261112.7", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.5386.8", 
            "type": "Organization"
          }
        ], 
        "familyName": "Rajaraman", 
        "givenName": "Rajmohan", 
        "id": "sg:person.014716044531.06", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014716044531.06"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:46", 
        "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_1553.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.014716044531.06'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...