The following pages link to Nathan Linial (Q178480):
Displaying 50 items.
- An upper bound on the number of Steiner triple systems (Q2868080) (← links)
- Tight products and graph expansion (Q2891052) (← links)
- Are stable instances easy? (Q2911066) (← links)
- Musical Chairs (Q2935289) (← links)
- On the practically interesting instances of MAXCUT (Q2957913) (← links)
- Word maps and spectra of random graph lifts (Q3057070) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- (Q3128884) (← links)
- (Q3138968) (← links)
- Constant depth circuits, Fourier transform, and learnability (Q3140018) (← links)
- Improved routing strategies with succinct tables (Q3212257) (← links)
- (Q3320411) (← links)
- The Information-Theoretic Bound is Good for Merging (Q3340174) (← links)
- Minors in lifts of graphs (Q3419590) (← links)
- On the Local Profiles of Trees (Q3466358) (← links)
- Bounds on Universal Sequences (Q3472132) (← links)
- Graph coloring with no large monochromatic components (Q3503460) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Learning Complexity vs Communication Complexity (Q3557511) (← links)
- Girth and euclidean distortion (Q3579194) (← links)
- Eigenvectors of Random Graphs: Nodal Domains (Q3603485) (← links)
- Searching ordered structures (Q3700849) (← links)
- Hard Enumeration Problems in Geometry and Combinatorics (Q3730017) (← links)
- Some Bounds for the Banzhaf Index and Other Semivalues (Q3809609) (← links)
- (Q3830840) (← links)
- The Counterfeit Coin Problem Revisited (Q3947129) (← links)
- Incidence Matrices of Subsets—A Rank Formula (Q3964584) (← links)
- Locality in Distributed Graph Algorithms (Q3990110) (← links)
- Single round simulation on radio networks (Q3990605) (← links)
- (Q4024324) (← links)
- On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels (Q4034446) (← links)
- (Q4220403) (← links)
- (Q4228448) (← links)
- (Q4228506) (← links)
- Local-Global Phenomena in Graphs (Q4290099) (← links)
- An optimal on-line algorithm for metrical task system (Q4302787) (← links)
- (Q4347906) (← links)
- (Q4386290) (← links)
- Fault-tolerant Computation in the Full Information Model (Q4388884) (← links)
- Random lifts of graphs: Independence and chromatic number (Q4534214) (← links)
- (Q4542534) (← links)
- (Q4542587) (← links)
- (Q4549227) (← links)
- The one-round Voronoi game (Q4557542) (← links)
- Monotone Subsequences in High-Dimensional Permutations (Q4601054) (← links)
- Random Simplicial Complexes: Around the Phase Transition (Q4604389) (← links)
- Ramanujan Signing of Regular Graphs (Q4650646) (← links)
- ON METRIC RAMSEY-TYPE DICHOTOMIES (Q4677842) (← links)
- (Q4733694) (← links)
- On the distance distribution of codes (Q4859770) (← links)
