Nathan Linial


Ontology type: schema:Person     


Person Info

NAME

Nathan

SURNAME

Linial

Publications in SciGraph latest 50 shown

  • 2022-01-07 In Search of Hyperpaths in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2021-07-21 Genetic association studies of alterations in protein function expose recessive effects on cancer predisposition in SCIENTIFIC REPORTS
  • 2020-08-18 Functional Evolutionary Modeling Exposes Overlooked Protein-Coding Genes Involved in Cancer in BIOINFORMATICS RESEARCH AND APPLICATIONS
  • 2020-08-10 Expanding cancer predisposition genes with ultra-rare cancer-exclusive human variations in SCIENTIFIC REPORTS
  • 2020-07-22 Efficient, local and symmetric Markov chains that generate one-factorizations in ACTA MATHEMATICA HUNGARICA
  • 2020-07-14 PWAS: proteome-wide association study—linking genes and phenotypes by functional variation in proteins in GENOME BIOLOGY
  • 2020-04-21 PWAS: Proteome-Wide Association Study in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2019-11-27 Asymptotically Almost Every 2r-Regular Graph Has an Internal Partition in GRAPHS AND COMBINATORICS
  • 2017-05-10 Random Simplicial Complexes: Around the Phase Transition in A JOURNEY THROUGH DISCRETE MATHEMATICS
  • 2014-08 An upper bound on the number of high-dimensional permutations in COMBINATORICA
  • 2014-06-12 An upper bound on the number of high-dimensional permutations in COMBINATORICA
  • 2013-11-07 On the Vertices of the d-Dimensional Birkhoff Polytope in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2013-04-05 ProtoNet: charting the expanding universe of protein sequences in NATURE BIOTECHNOLOGY
  • 2012-12-11 Collapsibility and Vanishing of Top Homology in Random Simplicial Complexes in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2011 Geometric Interpretation of Gene Expression by Sparse Reconstruction of Transcript Profiles in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2010-08-12 The Expected Genus of a Random Chord Diagram in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2010-03-03 Sum Complexes—a New Family of Hypertrees in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2009-12-08 Codon usage is associated with the evolutionary age of genes in metazoan genomes in BMC ECOLOGY AND EVOLUTION
  • 2007 Eigenvectors of Random Graphs: Nodal Domains in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2006-12-01 Limitations to Fréchet’s metric embedding method in ISRAEL JOURNAL OF MATHEMATICS
  • 2006-10 Lifts, Discrepancy and Nearly Optimal Spectral Gap* in COMBINATORICA
  • 2006-08 Homological Connectivity Of Random 2-Complexes in COMBINATORICA
  • 2006-06-02 EVEREST: automatic identification and classification of protein domains in all protein sequences in BMC BIOINFORMATICS
  • 2006-04-18 How Neighborly Can a Centrally Symmetric Polytope Be? in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2005-07 Random Lifts Of Graphs: Perfect Matchings in COMBINATORICA
  • 2005 Efficient Calculation of Interval Scores for DNA Copy Number Data Analysis in RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY
  • 2004-07-02 Some Low Distortion Metric Ramsey Problems in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2004-02-09 Metric Embeddings—Beyond One-Dimensional Distortion in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2003-11-05 The One-Round Voronoi Game in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2002-10 An Extremal Problem on Degree Sequences of Graphs in GRAPHS AND COMBINATORICS
  • 2002-10 Linear Codes and Character Sums in COMBINATORICA
  • 2002-06 Girth and Euclidean distortion in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2002-03 The Moore Bound for Irregular Graphs in GRAPHS AND COMBINATORICS
  • 2002-01 Random Graph Coverings I: General Theory and Graph Connectivity in COMBINATORICA
  • 2000-04 A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents in COMBINATORICA
  • 2000-03 On the Hardness of Approximating the Chromatic Number in COMBINATORICA
  • 1999-05 Competitive Optimal On-Line Leasing in ALGORITHMICA
  • 1999-02 The Linear-Array Conjecture in Communication Complexity Is False in COMBINATORICA
  • 1998-12 Low distortion euclidean embeddings of trees in ISRAEL JOURNAL OF MATHEMATICS
  • 1998-01 Non-Expansive Hashing in COMBINATORICA
  • 1997-06 Efficient construction of a small hitting set for combinatorial rectangles in high dimension in COMBINATORICA
  • 1996-12 Inclusion-exclusion: Exact and approximate in COMBINATORICA
  • 1996-04 Central points for sets in ℝn (or: the chocolate ice-cream problem) in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1996-03 Biased random walks in COMBINATORICA
  • 1995-09 Fast perfect-information leader-election protocols with linear immunity in COMBINATORICA
  • 1995-06 The geometry of graphs and some of its algorithmic applications in COMBINATORICA
  • 1994-03 Spectral properties of threshold functions in COMBINATORICA
  • 1993-12 Low diameter graph decompositions in COMBINATORICA
  • 1993-06 The influence of large coalitions in COMBINATORICA
  • 1993-03-01 On convex body chasing in DISCRETE & COMPUTATIONAL GEOMETRY
  • 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": "http://www.grid.ac/institutes/grid.9619.7", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.250107.1", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.481551.c", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.168010.e", 
            "type": "Organization"
          }, 
          {
            "id": "http://www.grid.ac/institutes/grid.19006.3e", 
            "type": "Organization"
          }
        ], 
        "familyName": "Linial", 
        "givenName": "Nathan", 
        "id": "sg:person.015760032537.47", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015760032537.47"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2022-12-01T07:13", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-springernature-scigraph/baseset/20221201/entities/gbq_results/person/person_819.jsonl", 
        "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.015760032537.47'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...