Noga Alon


Ontology type: schema:Person     


Person Info

NAME

Noga

SURNAME

Alon

Publications in SciGraph latest 50 shown

  • 2018-12 Permutations Resilient to Deletions in ANNALS OF COMBINATORICS
  • 2018-09-28 Gregory Gutin and Graph Optimization Problems in OPTIMIZATION PROBLEMS IN GRAPH THEORY
  • 2017-10 Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles in ISRAEL JOURNAL OF MATHEMATICS
  • 2017-05-27 Reliable communication over highly connected noisy networks in DISTRIBUTED COMPUTING
  • 2017-05 Counting contours on trees in LETTERS IN MATHEMATICAL PHYSICS
  • 2017-02 Asymptotically optimal induced universal graphs in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2017-01 Revenue and Reserve Prices in a Probabilistic Single Item Auction in ALGORITHMICA
  • 2017 Fair Representation by Independent Sets in A JOURNEY THROUGH DISCRETE MATHEMATICS
  • 2016-07 Coloring, sparseness and girth in ISRAEL JOURNAL OF MATHEMATICS
  • 2015-12 On Rigid Matrices and U-Polynomials in COMPUTATIONAL COMPLEXITY
  • 2015-11 Size and Degree Anti-Ramsey Numbers in GRAPHS AND COMBINATORICS
  • 2015-02 Local Correction with Constant Error Rate in ALGORITHMICA
  • 2014-06 Additive Patterns in Multiplicative Subgroups in GEOMETRIC AND FUNCTIONAL ANALYSIS
  • 2014-01 Counting sum-free sets in abelian groups in ISRAEL JOURNAL OF MATHEMATICS
  • 2013-08 Beeping a maximal independent set in DISTRIBUTED COMPUTING
  • 2013-06 On sunflowers and matrix multiplication in COMPUTATIONAL COMPLEXITY
  • 2013 Paul Erdős and Probabilistic Reasoning in ERDŐS CENTENNIAL
  • 2013 The Asymmetric Matrix Partition Problem in WEB AND INTERNET ECONOMICS
  • 2013 How to Put through Your Agenda in Collective Binary Decisions in ALGORITHMIC DECISION THEORY
  • 2013 Two notions of unit distance graphs in THE SEVENTH EUROPEAN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND APPLICATIONS
  • 2013 Neighborly Families of Boxes and Bipartite Coverings in THE MATHEMATICS OF PAUL ERDŐS II
  • 2012-12 The de Bruijn–Erdős theorem for hypergraphs in DESIGNS, CODES AND CRYPTOGRAPHY
  • 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
  • 2012 Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2011-11 Solving MAX-r-SAT Above a Tight Lower Bound in ALGORITHMICA
  • 2011 Beeping a Maximal Independent Set in DISTRIBUTED COMPUTING
  • 2011 Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems in STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS
  • 2010-03 The inverse Banzhaf problem in SOCIAL CHOICE AND WELFARE
  • 2010 High Degree Graphs Contain Large-Star Factors in FETE OF COMBINATORICS AND COMPUTER SCIENCE
  • 2010 Brief Announcement: Sharing Memory in a Self-stabilizing Manner 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-11 Poisson approximation for non-backtracking random walks 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-08 Tell Me Who I Am: An Interactive Recommendation System in THEORY OF COMPUTING SYSTEMS
  • 2009-07 Uniformly cross intersecting families in COMBINATORICA
  • 2009 Deterministic Approximation Algorithms for the Nearest Codeword Problem in APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2009 Balanced Hashing, Color Coding and Approximate Counting in PARAMETERIZED AND EXACT COMPUTATION
  • 2009 Fast FAST in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2008-05 A separation theorem in property testing in COMBINATORICA
  • 2008 Color Coding in ENCYCLOPEDIA OF ALGORITHMS
  • 2008 Small Sample Spaces Cannot Fool Low Degree Polynomials in APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION. ALGORITHMS AND TECHNIQUES
  • 2008 Optimal Monotone Encodings in AUTOMATA, LANGUAGES AND PROGRAMMING
  • 2007-11 Embedding nearly-spanning bounded degree trees in COMBINATORICA
  • 2007-11 Privileged users in zero-error transmission over a noisy channel in COMBINATORICA
  • 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)


    ...