The following pages link to Nathan Linial (Q178480):
Displaying 50 items.
- A note on the influence of an \(\epsilon\)-biased random source (Q1305932) (← links)
- Non-expansive hashing (Q1307346) (← links)
- Low diameter graph decompositions (Q1316650) (← links)
- Spectral properties of threshold functions (Q1323477) (← links)
- Local and global clique numbers (Q1328379) (← links)
- The Moore bound for irregular graphs (Q1348665) (← links)
- Inclusion-exclusion: exact and approximate (Q1375692) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Linear codes and character sums (Q1410404) (← links)
- Low dimensional embeddings of ultrametrics. (Q1422397) (← links)
- The one-round Voronoi game (Q1424320) (← links)
- Girth and Euclidean distortion (Q1606019) (← links)
- The distribution of knots in the Petaluma model (Q1631708) (← links)
- Extremal hypercuts and shadows of simplicial complexes (Q1717600) (← links)
- Some low distortion metric Ramsey problems (Q1764172) (← links)
- Essential covers of the cube by hyperplanes (Q1770439) (← links)
- The influence of variables in product spaces (Q1802329) (← links)
- Competitive optimal on-line leasing (Q1818280) (← links)
- On the cover time of random walks on graphs (Q1823548) (← links)
- Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders (Q1850474) (← links)
- A continuous analogue of the girth problem (Q1850595) (← links)
- The Euclidean distortion of complete binary trees (Q1864125) (← links)
- An extremal problem on degree sequences of graphs (Q1865144) (← links)
- The geometry of graphs and some of its algorithmic applications (Q1894703) (← links)
- Fast perfect-information leader-election protocols with linear immunity (Q1900182) (← links)
- Witness sets for families of binary vectors (Q1906149) (← links)
- Biased random walks (Q1912749) (← links)
- Central points for sets in \(\mathbb{R}^ n\) (or: the chocolate ice-cream problem) (Q1913696) (← links)
- Collapsibility and vanishing of top homology in random simplicial complexes (Q1943661) (← links)
- On the local structure of oriented graphs -- a case study in flag algebras (Q2170792) (← links)
- Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
- Matroidal bijections between graphs (Q2276983) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- Limitations to Fréchet's metric embedding method (Q2382346) (← links)
- On the vertices of the \(d\)-dimensional Birkhoff polytope (Q2441581) (← links)
- On the expansion rate of Margulis expanders. (Q2490842) (← links)
- On metric Ramsey-type phenomena (Q2496968) (← links)
- How neighborly can a centrally symmetric polytope be? (Q2505226) (← links)
- Random lifts of graphs: perfect matchings (Q2568496) (← links)
- Monotone maps, sphericity and bounded second eigenvalue (Q2573647) (← links)
- A counterexample to a conjecture of Björner and Lovász on the \(\chi\)-coloring complex (Q2573652) (← links)
- Geodesic geometry on graphs (Q2671180) (← links)
- In search of hyperpaths (Q2690124) (← links)
- Random lifts of graphs (Q2768394) (← links)
- Neighborhood preserving hashing and approximate queries (Q2784503) (← links)
- The threshold for \(d\)-collapsibility in random complexes (Q2795743) (← links)
- Internal partitions of regular graphs (Q2825476) (← links)
- No justified complaints: on fair sharing of multiple resources (Q2826045) (← links)
- Discrepancy of high-dimensional permutations (Q2826225) (← links)
- On the number of 4-cycles in a tournament (Q2833121) (← links)
