Narsingh Deo

Ontology type: schema:Person     

Person Info





Publications in SciGraph latest 50 shown

  • 2018 Detecting and Identifying Communities in Dynamic and Complex Networks: Definition and Survey in ENCYCLOPEDIA OF SOCIAL NETWORK ANALYSIS AND MINING
  • 2017-06 A theorem proving approach for automatically synthesizing visualizations of flow cytometry data in BMC BIOINFORMATICS
  • 2014 Community Identification in Dynamic and Complex Networks in ENCYCLOPEDIA OF SOCIAL NETWORK ANALYSIS AND MINING
  • 2012-12 Efficient community identification in complex networks in SOCIAL NETWORK ANALYSIS AND MINING
  • 2005-12 Cluster Computing for Determining Three-Dimensional Protein Structure in THE JOURNAL OF SUPERCOMPUTING
  • 2002-12-16 Coarse-Grained Parallelization of Distance-Bound Smoothing for the Molecular Conformation Problem in DISTRIBUTED COMPUTING
  • 2001-06-28 Graph-Theoretic Web Algorithms: An Overview in INNOVATIVE INTERNET COMPUTING SYSTEMS
  • 2000-02-14 Computing a Diameter-Constrained Minimum Spanning Tree in Parallel in ALGORITHMS AND COMPLEXITY
  • 1999-09 Computational experience with a parallel algorithm for tetrangle inequality bound smoothing in BULLETIN OF MATHEMATICAL BIOLOGY
  • 1997 Computation of Constrained Spanning Trees: A Unified Approach in NETWORK OPTIMIZATION
  • 1992-03 Parallel heap: An optimal parallel priority queue in THE JOURNAL OF SUPERCOMPUTING
  • 1990 Data Structures for Parallel Computation on Shared-Memory Machines in SUPERCOMPUTING
  • 1989 Gate matrix layout revisited: Algorithmic performance and probabilistic analysis in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1988-04 Parallel algorithms and architectures report of a workshop in THE JOURNAL OF SUPERCOMPUTING
  • 1988 Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses in SUPERCOMPUTING
  • 1986-03 An upper bound for the speedup of parallel best-bound branch-and-bound algorithms in BIT NUMERICAL MATHEMATICS
  • 1984-09 On the power of a perturbation for testing non-isomorphism of graphs in BIT NUMERICAL MATHEMATICS
  • 1982-03 Parallel algorithms for the single source shortest path problem in COMPUTING
  • 1977-03 A new algorithm for digraph isomorphism in BIT NUMERICAL MATHEMATICS
  • 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": "", 
        "affiliation": [
            "affiliation": {
              "id": "", 
              "type": "Organization"
            "isCurrent": true, 
            "type": "OrganizationRole"
            "id": "", 
            "type": "Organization"
        "familyName": "Deo", 
        "givenName": "Narsingh", 
        "id": "sg:person.010274011142.47", 
        "sameAs": [
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:09", 
        "sdLicense": "", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        "sdSource": "s3://com-uberresearch-data-dimensions-researchers-20181010/20181011/dim_researchers/base/researchers_1923.json", 
        "type": "Person"

    Download the RDF metadata as:  json-ld nt turtle xml License info


    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' ''

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

    curl -H 'Accept: application/n-triples' ''

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' ''

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

    curl -H 'Accept: application/rdf+xml' ''


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