Pages that link to "Item:Q579273"
From MaRDI portal
The following pages link to Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273):
Displaying 40 items.
- Domination in transitive colorings of tournaments (Q403357) (← links)
- The size Ramsey number of a directed path (Q414648) (← links)
- Unimodular graphs and Eisenstein sums (Q517356) (← links)
- Highly symmetric expanders (Q700158) (← links)
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators (Q800384) (← links)
- The conjunctive complexity of quadratic Boolean functions (Q808253) (← links)
- Parallel comparison algorithms for approximation problems (Q808727) (← links)
- On distinct perpendicular bisectors and pinned distances in finite fields (Q897336) (← links)
- On the spectrum of projective norm-graphs (Q1007575) (← links)
- The number of submatrices of a given type in a Hadamard matrix and related results (Q1111555) (← links)
- Ramanujan graphs (Q1112836) (← links)
- Sorting in rounds (Q1117700) (← links)
- A Ramsey type problem concerning vertex colourings (Q1262327) (← links)
- Constructive bounds for a Ramsey-type problem (Q1376057) (← links)
- Constant time parallel sorting: An empirical view. (Q1401981) (← links)
- Universal traversal sequences for expander graphs (Q1802060) (← links)
- On the second eigenvalue of hypergraphs (Q1842569) (← links)
- Ramanujan edge-indexed graphs (Q1850521) (← links)
- Scalable secure storage when half the system is faulty (Q1854529) (← links)
- Embedding graphs with bounded degree in sparse pseudorandom graphs (Q1885587) (← links)
- On the number of flats spanned by a set of points in \(PG(d,q)\) (Q1916131) (← links)
- The hardest halfspace (Q1983325) (← links)
- Pach's selection theorem does not admit a topological extension (Q1991092) (← links)
- Extending Erdős-Beck's theorem to higher dimensions (Q2206730) (← links)
- More on configurations in Priestley spaces, and some new problems (Q2471007) (← links)
- Dense expanders and pseudo-random bipartite graphs (Q2640620) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Number of directions determined by a set in \(\mathbb{F}_q^2\) and growth in \(\mathrm{Aff}(\mathbb{F}_q)\) (Q2665267) (← links)
- Incidence Bounds for Block Designs (Q2830440) (← links)
- Elementary methods for incidence problems in finite fields (Q2957233) (← links)
- Candidate One-Way Functions Based on Expander Graphs (Q3088178) (← links)
- A Sample of Samplers: A Computational Perspective on Sampling (Q3088190) (← links)
- ON EMBEDDINGS OF FINITE METRIC SPACES IN (Q3406661) (← links)
- Random Cayley graphs and expanders (Q4286294) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Non-representability of finite projective planes by convex sets (Q4929997) (← links)
- (Q5028497) (← links)
- (Q5089204) (← links)
- The size-Ramsey number of trees (Q5916315) (← links)
- On the growth rate in SL2(Fp)${\rm SL_2}(\mathbb {F}_p)$, the affine group and sum‐product type implications (Q6051483) (← links)
