The following pages link to Noga Alon (Q178698):
Displaying 50 items.
- Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs (extended abstract) (Q2817625) (← links)
- A spectral technique for coloring random 3-colorable graphs (preliminary version) (Q2817627) (← links)
- Eigenvalues of \(K_{1,k}\)-free graphs and the connectivity of their independence complexes (Q2833255) (← links)
- Nearly tight bounds for testing function isomorphism (Q2840979) (← links)
- Basic network creation games (Q2848528) (← links)
- Playing to retain the advantage (Q2851498) (← links)
- Restricted integer partition functions (Q2855590) (← links)
- How to Put through Your Agenda in Collective Binary Decisions (Q2868543) (← links)
- Ordinal embeddings of minimum relaxation, general properties, trees, and ultrametrics (Q2921724) (← links)
- Linear equations, arithmetic progressions and hypergraph property testing (Q2921732) (← links)
- Admission control to minimize rejections and online set cover with repetitions (Q2930285) (← links)
- Balanced families of perfect hash functions and their applications (Q2930337) (← links)
- A combinatorial characterization of the testable graph properties (Q2931390) (← links)
- (Q2934626) (← links)
- On the Compatibility of Quartet Trees (Q2935283) (← links)
- Correction: Basic Network Creation Games (Q2935293) (← links)
- The Asymmetric Matrix Partition Problem (Q2937740) (← links)
- Chasing a Fast Robber on Planar Graphs and Random Graphs (Q2940989) (← links)
- Economical Graph Discovery (Q2941419) (← links)
- Algorithmic construction of sets for <i>k</i> -restrictions (Q2944511) (← links)
- A general approach to online network optimization problems (Q2944534) (← links)
- More on the Bipartite Decomposition of Random Graphs (Q2958197) (← links)
- The Cover Number of a Matrix and its Algorithmic Applications (Q2969040) (← links)
- Linear Boolean Classification, Coding and the Critical Problem (Q2976887) (← links)
- Modular Orientations of Random and Quasi-Random Regular Graphs (Q2998847) (← links)
- Linear equations, arithmetic progressions and hypergraph property testing (Q3002762) (← links)
- The Brunn–Minkowski Inequality and Nontrivial Cycles in the Discrete Torus (Q3008014) (← links)
- A note on regular Ramsey graphs (Q3055921) (← links)
- High degree graphs contain large-star factors (Q3060855) (← links)
- Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions (Q3068635) (← links)
- (Q3078200) (← links)
- Hypergraph list coloring and Euclidean Ramsey theory (Q3094608) (← links)
- Sparse Balanced Partitions and the Complexity of Subgraph Problems (Q3094934) (← links)
- A Biological Solution to a Fundamental Distributed Computing Problem (Q3101797) (← links)
- Matching nuts and bolts (Q3128932) (← links)
- A linear time erasure-resilient code with nearly optimal recovery (Q3129459) (← links)
- (Q3129926) (← links)
- (Q3137169) (← links)
- (Q3142409) (← links)
- Linear hash functions (Q3158554) (← links)
- Dense graphs are antimagic (Q3159384) (← links)
- The number of sumsets in a finite field (Q3162664) (← links)
- Almost K-Wise vs. K-Wise Independent Permutations, and Uniformity for General Group Actions (Q3167409) (← links)
- Strategyproof Approximation of the Minimax on Networks (Q3169105) (← links)
- On graphs and algebraic graphs that do not contain cycles of length 4 (Q3174238) (← links)
- Uniformly Discrete Forests with Poor Visibility (Q3177357) (← links)
- Almost \(k\)-wise vs. \(k\)-wise independent permutations, and uniformity for general group actions (Q3191585) (← links)
- Maximizing the Number of Nonnegative Subsets (Q3192165) (← links)
- Reflection Sequences (Q3199631) (← links)
- Lovász, Vectors, Graphs and Codes (Q3295262) (← links)
