Noga Alon


Ontology type: schema:Person     


Person Info

NAME

Noga

SURNAME

Alon

Publications in SciGraph latest 50 shown

  • 2017-05-27 Reliable communication over highly connected noisy networks in DISTRIBUTED COMPUTING
  • 2017-02 Asymptotically optimal induced universal graphs in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2015-12 On Rigid Matrices and U-Polynomials in COMPUTATIONAL COMPLEXITY
  • 2015-11 Size and Degree Anti-Ramsey Numbers in GRAPHS AND COMBINATORICS
  • 2014-06 Additive Patterns in Multiplicative Subgroups in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2013 The Asymmetric Matrix Partition Problem in WEB AND INTERNET ECONOMICS
  • 2012-03 Sums and products along sparse graphs in ISRAEL JOURNAL OF MATHEMATICS
  • 2012-03 A Non-linear Lower Bound for Planar Epsilon-nets in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2011 Beeping a Maximal Independent Set in DISTRIBUTED COMPUTING
  • 2010 Testing Boolean Function Isomorphism in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2010 Universality, Tolerance, Chaos and Order in AN IRREGULAR MIND
  • 2010 Open Problems in FETE OF COMBINATORICS AND COMPUTER SCIENCE
  • 2010 On Constant Time Approximation of Parameters of Bounded Degree Graphs in PROPERTY TESTING
  • 2009-11 Discrete Kakeya-type problems and small bases in ISRAEL JOURNAL OF MATHEMATICS
  • 2009-10 Polychromatic Colorings of Plane Graphs in DISCRETE & COMPUTATIONAL GEOMETRY
  • 2009-08 Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs in ALGORITHMICA
  • 2009 Deterministic Approximation Algorithms for the Nearest Codeword Problem in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2008-05 A separation theorem in property testing in COMBINATORICA
  • 2007-02 Codes And Xor Graph Products in COMBINATORICA
  • 2007 Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs in COMPUTING AND COMBINATORICS
  • 2007 Can a Graph Have Distinct Regular Partitions? in COMPUTING AND COMBINATORICS
  • 2006-02 The Number Of Orientations Having No Fixed Tournament in COMBINATORICA
  • 2006 Homomorphisms in Graph Property Testing in TOPICS IN DISCRETE MATHEMATICS
  • 2005-11 Tight bounds for shared memory systems accessed by Byzantine processes in DISTRIBUTED COMPUTING
  • 2004-10 Graph Products, Fourier Analysis and Spectral Techniques in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2003-06 Equilateral Sets in lpn in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2003 Testing Low-Degree Polynomials over GF(2) in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION.. ALGORITHMS AND TECHNIQUES
  • 2002-02-18 Scalable Secure Storage when Half the System Is Faulty in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2001-04 Ramsey-type Theorems with Forbidden Subgraphs in COMBINATORICA
  • 1999-03 Large Sets of Nearly Orthogonal Vectors in GRAPHS AND COMBINATORICS
  • 1999 Independent Sets in Hypergraphs with Applications to Routing Via Fixed Paths in RANDOMIZATION, APPROXIMATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 1998-12 The choice number of random bipartite graphs in ANNALS OF COMBINATORICS
  • 1998-07 An Asymptotic Isoperimetric Inequality in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 1998-03 The Shannon Capacity of a Union in COMBINATORICA
  • 1998-03 Piercing d -Intervals in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1998-02 Approximating the independence number via theϑ-function in MATHEMATICAL PROGRAMMING
  • 1997-09 The concentration of the chromatic number of random graphs in COMBINATORICA
  • 1997-09 Constructive Bounds for a Ramsey-Type Problem in GRAPHS AND COMBINATORICS
  • 1997-04 Improved parallel approximation of a class of integer programming problems in ALGORITHMICA
  • 1996 Improved parallel approximation of a class of integer programming problems in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 1995-09 A lattice point problem and additive number theory in COMBINATORICA
  • 1995-03 Derandomized graph products in COMPUTATIONAL COMPLEXITY
  • 1994 Disjoint systems (Extended abstract) in ALGEBRAIC CODING
  • 1993-08 On-line steiner trees in the Euclidean plane in DISCRETE & COMPUTATIONAL GEOMETRY
  • 1992-06 AlmostH-factors in dense graphs in GRAPHS AND COMBINATORICS
  • 1992-06 Colorings and orientations of graphs in COMBINATORICA
  • 1992-03 Uniform dilations in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 1992-03 Generalized sum graphs in GRAPHS AND COMBINATORICS
  • 1991-09 Economical coverings of sets of lattice points in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 1991-06 Independent sets in regular graphs and sum-free subsets of finite groups in ISRAEL JOURNAL OF 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": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "affiliation": [
          {
            "affiliation": {
              "id": "https://www.grid.ac/institutes/grid.12136.37", 
              "type": "Organization"
            }, 
            "isCurrent": true, 
            "type": "OrganizationRole"
          }, 
          {
            "id": "https://www.grid.ac/institutes/grid.78989.37", 
            "type": "Organization"
          }
        ], 
        "familyName": "Alon", 
        "givenName": "Noga", 
        "id": "sg:person.0765221225.03", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.0765221225.03"
        ], 
        "sdDataset": "persons", 
        "sdDatePublished": "2019-03-07T14:49", 
        "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_548.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.0765221225.03'

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

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

    Turtle is a human-readable linked data format.

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

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

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


     




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


    ...