Subhash Suri


Ontology type: schema:Person     


Person Info

NAME

Subhash

SURNAME

Suri

Publications in SciGraph latest 50 shown

  • 2018 Quantiles on Streams in ENCYCLOPEDIA OF DATABASE SYSTEMS
  • 2017-10 Convex Hulls Under Uncertainty in ALGORITHMICA
  • 2016-10 Observability of Lattice Graphs in ALGORITHMICA
  • 2016 Quantiles on Streams in ENCYCLOPEDIA OF DATABASE SYSTEMS
  • 2016 Bundled Crossings in Embedded Graphs in LATIN 2016: THEORETICAL INFORMATICS
  • 2016 Block Crossings in Storyline Visualizations in GRAPH DRAWING AND NETWORK VISUALIZATION
  • 2016 Containment and Evasion in Stochastic Point Data in LATIN 2016: THEORETICAL INFORMATICS
  • 2015-12 Pursuit Evasion on Polyhedral Surfaces in ALGORITHMICA
  • 2015-02 Computing Klee’s Measure of Grounded Boxes in ALGORITHMICA
  • 2015 Trackability with Imprecise Localization in ALGORITHMIC FOUNDATIONS OF ROBOTICS XI
  • 2014-04 On the Complexity of Time-Dependent Shortest Paths in ALGORITHMICA
  • 2014 Convex Hulls under Uncertainty in ALGORITHMS - ESA 2014
  • 2014-01 Conflict-Free Chromatic Art Gallery Coverage in ALGORITHMICA
  • 2014-01 Erratum to: Conflict-Free Chromatic Art Gallery Coverage in ALGORITHMICA
  • 2014 On the Most Likely Voronoi Diagramand Nearest Neighbor Searching in ALGORITHMS AND COMPUTATION
  • 2013 Geometric Computing over Uncertain Data in ALGORITHMS FOR SENSOR SYSTEMS
  • 2013 On the Most Likely Convex Hull of Uncertain Points in ALGORITHMS – ESA 2013
  • 2013 Euclidean Traveling Salesman Tours through Stochastic Neighborhoods in ALGORITHMS AND COMPUTATION
  • 2013 Pursuit Evasion on Polyhedral Surfaces in ALGORITHMS AND COMPUTATION
  • 2011 Closest Pair and the Post Office Problem for Stochastic Points in ALGORITHMS AND DATA STRUCTURES
  • 2011 The Union of Probabilistic Boxes: Maintaining the Volume in ALGORITHMS – ESA 2011
  • 2010 Reconstructing Visibility Graphs with Simple Robots in STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY
  • 2010 Multiagent Pursuit Evasion, or Playing Kabaddi in ALGORITHMIC FOUNDATIONS OF ROBOTICS IX
  • 2008-12 Bandwidth-Constrained Allocation in Grid Computing in ALGORITHMICA
  • 2008 Simplified Planar Coresets for Data Streams in ALGORITHM THEORY – SWAT 2008
  • 2008 Counting Targets with Mobile Sensors in an Unknown Environment in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2008 Angle Optimization in Target Tracking in ALGORITHM THEORY – SWAT 2008
  • 2008 Target Counting under Minimal Sensing: Complexity and Approximations in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2008 Simple Robots in Polygonal Environments: A Hierarchy in ALGORITHMIC ASPECTS OF WIRELESS SENSOR NETWORKS
  • 2007-01 Selfish Load Balancing and Atomic Congestion Games in ALGORITHMICA
  • 2007 Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks in COMPUTING AND COMBINATORICS
  • 2006-12 Range Counting over Multidimensional Data Streams in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2006-09 Adaptive Spatial Partitioning for Multidimensional Data Streams in ALGORITHMICA
  • 2006 Contour Approximation in Sensor Networks in DISTRIBUTED COMPUTING IN SENSOR SYSTEMS
  • 2005 Congestion Games, Load Balancing, and Price of Anarchy in COMBINATORIAL AND ALGORITHMIC ASPECTS OF NETWORKING
  • 2005 Uncoordinated Load Balancing and Congestion Games in P2P Systems in PEER-TO-PEER SYSTEMS III
  • 2005 Interval Subset Sum and Uniform-Price Auction Clearing in COMPUTING AND COMBINATORICS
  • 2005 Attribute-Based Access to Distributed Data over P2P Networks in DATABASES IN NETWORKED INFORMATION SYSTEMS
  • 2004 Adaptive Spatial Partitioning for Multidimensional Data Streams in ALGORITHMS AND COMPUTATION
  • 2003-04 Compressing Two-Dimensional Routing Tables in ALGORITHMICA
  • 2003-02-17 On the Difficulty of Some Shortest Path Problems in STACS 2003
  • 2003-02-11 Collision Detection Using Bounding Boxes: Convexity Helps in ALGORITHMS - ESA 2000
  • 2003 Bandwidth-Constrained Allocation in Grid Computing in ALGORITHMS AND DATA STRUCTURES
  • 2002-11-08 Optimal Clearing of Supply/Demand Curves in ALGORITHMS AND COMPUTATION
  • 2002-03-15 Optimal Flow Aggregation in ALGORITHM THEORY - SWAT 2000
  • 2001-04 Kinetic Connectivity for Unit Disks in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2001 Profile-Based Routing: A New Framework for MPLS Traffic Engineering in QUALITY OF FUTURE INTERNET SERVICES
  • 2000 Space Decomposition Techniques for Fast Layer-4 Switching in PROTOCOLS FOR HIGH-SPEED NETWORKS VI
  • 2000-01 Morphing Simple Polygons in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1997 Efficient breakout routing in printed circuit boards in ALGORITHMS AND DATA STRUCTURES
  • 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.133342.4", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.4367.6", 
            "type": "Organization"
          }
        ], 
        "familyName": "Suri", 
        "givenName": "Subhash", 
        "id": "sg:person.012347751512.96", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012347751512.96"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:15", 
        "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_2020.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.012347751512.96'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...