Sartaj Sahni


Ontology type: schema:Person     


Person Info

NAME

Sartaj

SURNAME

Sahni

Publications in SciGraph latest 50 shown

  • 2017-12 Cache and energy efficient algorithms for Nussinov’s RNA Folding in BMC BIOINFORMATICS
  • 2017-10 Offline first-fit decreasing height scheduling of power loads in JOURNAL OF SCHEDULING
  • 2014-07 Multicore and GPU algorithms for Nussinov RNA folding in BMC BIOINFORMATICS
  • 2012-03 In-advance path reservation for file transfers in e-science applications in THE JOURNAL OF SUPERCOMPUTING
  • 2011 Fast in-Place File Carving for Digital Forensics in FORENSICS IN TELECOMMUNICATIONS, INFORMATION, AND MULTIMEDIA
  • 2010 Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture in DISTRIBUTED COMPUTING AND NETWORKING
  • 2010 Network Centered Multiple Resource Scheduling in e-Science Applications in NETWORKS FOR GRID APPLICATIONS
  • 2009 Algorithms for Sequencing Multileaf Collimators in HANDBOOK OF OPTIMIZATION IN MEDICINE
  • 2005 Data Structures and Algorithms for Packet Forwarding and Classification in PARALLEL AND DISTRIBUTED PROCESSING AND APPLICATIONS
  • 2004 Fast Update Algorithm for IP Forwarding Table Using Independent Sets in HIGH SPEED NETWORKS AND MULTIMEDIA COMMUNICATIONS
  • 2002-07-02 Variable-Bit-Length Coding: An Effective Coding Method in VISUAL INFORMATION AND INFORMATION SYSTEMS
  • 2002-03-15 A Blocked All-Pairs Shortest-Paths Algorithm in ALGORITHM THEORY - SWAT 2000
  • 2002 Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching in COMPUTING AND COMBINATORICS
  • 2001-03 Efficient Algorithms for Local Alignment Search in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2001-03 Efficient Algorithms for Similarity Search in JOURNAL OF COMBINATORIAL OPTIMIZATION
  • 2001 Optical and Optoelectronic Interconnection Networks in SWITCHING NETWORKS: RECENT ADVANCES
  • 1999 A Framework for Matching Applications with Parallel Machines in HIGH PERFORMANCE COMPUTING – HIPC’99
  • 1999 Efficient Algorithms for Lossless Compression of 2D/3D Images in VISUAL INFORMATION AND INFORMATION SYSTEMS
  • 1998 Fundamental Algorithms for the Array with Reconfigurable Optical Buses in PARALLEL COMPUTING USING OPTICAL INTERCONNECTIONS
  • 1998 Otis Optoelectronic Computers in PARALLEL COMPUTING USING OPTICAL INTERCONNECTIONS
  • 1997 A robust and efficient algorithm for image registration in INFORMATION PROCESSING IN MEDICAL IMAGING
  • 1996-12 The master-slave paradigm in parallel computer and industrial settings in JOURNAL OF GLOBAL OPTIMIZATION
  • 1996 Weight biased leftist trees and modified skip lists in COMPUTING AND COMBINATORICS
  • 1995 Scheduling master-slave multiprocessor systems in EURO-PAR '95 PARALLEL PROCESSING
  • 1993 Reconfigurable Mesh Algorithms For Fundamental Data Manipulation Operations in PARALLEL COMPUTING ON DISTRIBUTED MEMORY MULTIPROCESSORS
  • 1992 Computing display conflicts in string and circular string visualization in COMBINATORIAL PATTERN MATCHING
  • 1991-06 Computing biconnected components on a hypercube in THE JOURNAL OF SUPERCOMPUTING
  • 1990-06 Computing Hough transforms on hypercube multicomputers in THE JOURNAL OF SUPERCOMPUTING
  • 1990 Parallel Algorithms for Image Template Matching in PARALLEL ALGORITHMS FOR MACHINE INTELLIGENCE AND VISION
  • 1989-09 Hypercube computing: Connected components in THE JOURNAL OF SUPERCOMPUTING
  • 1989-03 Hypercube-to-host sorting in THE JOURNAL OF SUPERCOMPUTING
  • 1988-12 A balanced bin sort for hypercube multicomputers in THE JOURNAL OF SUPERCOMPUTING
  • 1988-11 A linear algorithm to find a rectangular dual of a planar triangulated graph in ALGORITHMICA
  • 1988-09 Maze routing on a hypercube multicomputer in THE JOURNAL OF SUPERCOMPUTING
  • 1986 Via assignment in single row routing in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1985 VLSI systems for matrix multiplication in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1984 VLSI systems for design rule checks in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1981 Binary trees and parallel scheduling algorithms in CONPAR 81
  • 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.15276.37", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.63054.34", 
            "type": "Organization"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.17635.36", 
            "type": "Organization"
          }
        ], 
        "familyName": "Sahni", 
        "givenName": "Sartaj", 
        "id": "sg:person.01105625042.70", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01105625042.70"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:16", 
        "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_1080.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.01105625042.70'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...