R C T Lee


Ontology type: schema:Person     


Person Info

NAME

R C T

SURNAME

Lee

Publications in SciGraph latest 50 shown

  • 2002-06-04 An Optimal Algorithm for Finding the Minimum Cardinality Dominating Set on Permutation Graphs in COMPUTING AND COMBINATORICS
  • 1993-04 The searching over separators strategy to solve some NP-hard problems in subexponential time in ALGORITHMICA
  • 1993-01 The slab dividing approach to solve the EuclideanP-Center problem in ALGORITHMICA
  • 1992-12 Solving the Euclidean bottleneck matching problem byk-relative neighborhood graphs in ALGORITHMICA
  • 1992-12 Amortized analysis of some disk scheduling algorithms: SSTF, SCAN, andN-StepSCAN in BIT NUMERICAL MATHEMATICS
  • 1992-03 An average case analysis of a resolution principle algorithm in mechanical theorem proving in ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE
  • 1992 The application of the searching over separators strategy to solve some NP-complete problems on planar graphs in ALGORITHMS AND COMPUTATION
  • 1991 Conflict-free sorting algorithms under single-channel and multi-channel broadcast communication models in ADVANCES IN COMPUTING AND INFORMATION — ICCI '91
  • 1991 An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm in ISA'91 ALGORITHMS
  • 1990-06 An optimal approximation algorithm for the rectilinearm-center problem in ALGORITHMICA
  • 1990 20-Relative neighborhood graphs are Hamiltonian in ALGORITHMS
  • 1990 Voronoi diagrams of moving points in the plane in FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE
  • 1987-06 A new systolic architecture for convex hull and half-plane intersection problems in BIT NUMERICAL MATHEMATICS
  • 1986-03 AnO(N logN) minimal spanning tree algorithm forN points in the plane in BIT NUMERICAL MATHEMATICS
  • 1985-12 A parallel sorting scheme whose basic operation sortsN elements in INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING
  • 1984-09 On the average length of Delaunay triangulations in BIT NUMERICAL MATHEMATICS
  • 1984-09 A parallel algorithm to solve the stable marriage problem in BIT NUMERICAL MATHEMATICS
  • 1984-06 A new parallel sorting algorithm based upon min-mid-max operations in BIT NUMERICAL MATHEMATICS
  • 1981 Clustering Analysis and Its Applications in ADVANCES IN INFORMATION SYSTEMS SCIENCE
  • 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.38348.34", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Lee", 
        "givenName": "R C T", 
        "id": "sg:person.07540250215.50", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.07540250215.50"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T13:51", 
        "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_1621.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.07540250215.50'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...