F R K Chung


Ontology type: schema:Person     


Person Info

NAME

F R K

SURNAME

Chung

Publications in SciGraph latest 50 shown

  • 2015 Computing Heat Kernel Pagerank and a Local Clustering Algorithm in COMBINATORIAL ALGORITHMS
  • 2013 Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank in ALGORITHMS AND MODELS FOR THE WEB GRAPH
  • 2013 Integer Sets Containing No Solution to $$x + y = 3z$$ in THE MATHEMATICS OF PAUL ERDŐS I
  • 2012 Ranking and Sparsifying a Connection Graph in ALGORITHMS AND MODELS FOR THE WEB GRAPH
  • 2010 A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification in ALGORITHMS AND MODELS FOR THE WEB-GRAPH
  • 2010 PageRank and Random Walks on Graphs in FETE OF COMBINATORICS AND COMPUTER SCIENCE
  • 2009 The Giant Component in a Random Subgraph of a Given Graph in ALGORITHMS AND MODELS FOR THE WEB-GRAPH
  • 2007-06 Oblivious and Adaptive Strategies for the Majority and Plurality Problems in ALGORITHMICA
  • 2007-04 Drawing Power Law Graphs Using a Local/Global Decomposition in ALGORITHMICA
  • 2007-04 No-Three-in-Line-in-3D in ALGORITHMICA
  • 2006-11 Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines in THEORY OF COMPUTING SYSTEMS
  • 2005 Drawing Power Law Graphs in GRAPH DRAWING
  • 2004 Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract) in ALGORITHMS AND MODELS FOR THE WEB-GRAPH
  • 2004 The Small World Phenomenonin Hybrid Power Law Graphs in COMPLEX NETWORKS
  • 2003-06 Eigenvalues of Random Power law Graphs in ANNALS OF COMBINATORICS
  • 2002-11 Connected Components in Random Graphs with Given Expected Degree Sequences in ANNALS OF COMBINATORICS
  • 2002-04 Sparse Quasi-Random Graphs in COMBINATORICA
  • 2002 Random Evolution in Massive Graphs in HANDBOOK OF MASSIVE DATA SETS
  • 2002 Spectral Partitioning with Indefinite Kernels Using the Nyström Extension in COMPUTER VISION — ECCV 2002
  • 1999 Logarithmic Sobolev Techniques for Random Walks on Graphs in EMERGING APPLICATIONS OF NUMBER THEORY
  • 1998-03 Forced Convex n -Gons in the Plane in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1997 Integer Sets Containing no Solution to x + y = 3z in THE MATHEMATICS OF PAUL ERDÖS I
  • 1995 Eigenvalues of Graphs in PROCEEDINGS OF THE INTERNATIONAL CONGRESS OF MATHEMATICIANS
  • 1994 Groups and the Buckyball in LIE THEORY AND GEOMETRY
  • 1992-01 The number of different distances determined by a set of points in the Euclidean plane in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1992 Tolerating faults in synchronization networks in PARALLEL PROCESSING: CONPAR 92—VAPP V
  • 1991-06 Partitioning circuits for improved testability in ALGORITHMICA
  • 1989-12 Quasi-random graphs in COMBINATORICA
  • 1989-06 A Dynamic location problem for graphs in COMBINATORICA
  • 1989-03 Sphere-and-point incidence relations in high dimensions with applications to unit distances and furthest-neighbor pairs in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1987-12 The maximum number of edges in a 3-graph not containing a given star in GRAPHS AND COMBINATORICS
  • 1986-12 Monotone subsequences in (0, 1)-matrices in GRAPHS AND COMBINATORICS
  • 1986-12 Minced trees, with applications to fault-tolerant VLSI processor arrays in MATHEMATICAL SYSTEMS THEORY
  • 1985-12 On the addressing problem for directed graphs in GRAPHS AND COMBINATORICS
  • 1985-12 Cross-monotone subsequences in ORDER
  • 1983-09 Edge-colored complete graphs with precisely colored subgraphs in COMBINATORICA
  • 1983-06 On unavoidable graphs in COMBINATORICA
  • 1983 On the decomposition of graphs into complete bipartite subgraphs in STUDIES IN PURE MATHEMATICS
  • 1983 On complete bipartite subgraphs contained in spanning tree complements in STUDIES IN PURE MATHEMATICS
  • 1981-09 On Steiner trees for bounded point sets in GEOMETRIAE DEDICATA
  • 1981-03 Minimal decompositions of graphs into mutually isomorphic subgraphs in COMBINATORICA
  • 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.432790.b", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }
        ], 
        "familyName": "Chung", 
        "givenName": "F R K", 
        "id": "sg:person.013624262576.00", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013624262576.00"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:09", 
        "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_1924.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.013624262576.00'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...