The following pages link to (Q4071451):
Displaying 50 items.
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- Pseudorandom generators for combinatorial checkerboards (Q395607) (← links)
- A concentration theorem of expanders on Hadamard manifolds (Q435855) (← links)
- On eigenvalues of random complexes (Q503252) (← links)
- Spectra of lifted Ramanujan graphs (Q555601) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Improved sorting networks with O(log N) depth (Q582098) (← links)
- The isoperimetric profile of infinite genus surfaces (Q605064) (← links)
- Classical Kloosterman sums: representation theory, magic squares, and Ramanujan multigraphs (Q627626) (← links)
- Some topics in the dynamics of group actions on rooted trees. (Q641942) (← links)
- Expander graphs from Curtis-Tits groups. (Q662026) (← links)
- Higher index theory for certain expanders and Gromov monster groups. I (Q664746) (← links)
- Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry (Q708824) (← links)
- Zimmer's conjecture for actions of \(\mathrm{SL}(m,\mathbb{Z})\) (Q785946) (← links)
- Relative property (T) and linear groups. (Q877547) (← links)
- A reinforcement of property (T) (Q935198) (← links)
- Golod-Shafarevich groups with property \((T)\) and Kac-Moody groups. (Q955157) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- Expander graphs based on GRH with an application to elliptic curve cryptography (Q1019852) (← links)
- Sorting in \(c \log n\) parallel steps (Q1056541) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
- The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
- Explicit constructions of linear-sized superconcentrators (Q1165257) (← links)
- A note on a construction of Margulis (Q1254231) (← links)
- On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- On codes from hypergraphs. (Q1427432) (← links)
- The asymptotic dimension of box spaces of virtually nilpotent groups (Q1699547) (← links)
- Rigidity of warped cones and coarse geometry of expanders (Q1731574) (← links)
- Discrete fundamental groups of warped cones and expanders (Q1741823) (← links)
- Expanders, rank and graphs of groups (Q1781946) (← links)
- Space bounds for resolution (Q1854472) (← links)
- Expansion in perfect groups. (Q1934651) (← links)
- Super-expanders and warped cones (Q2027748) (← links)
- Homological filling functions with coefficients (Q2102721) (← links)
- OptORAMa: optimal oblivious RAM (Q2119019) (← links)
- Eigenvalues of Cayley graphs (Q2138565) (← links)
- Spectral bounds of directed Cayley graphs of finite groups (Q2164442) (← links)
- Cutoff on Ramanujan complexes and classical groups (Q2165717) (← links)
- Expander construction in \(\mathrm{VNC}^1\) (Q2187260) (← links)
- The coarse Novikov conjecture and Banach spaces with property (H) (Q2344321) (← links)
- Geometric complexity of embeddings in \(\mathbb R^d\) (Q2362643) (← links)
- Property \((T)\) and rigidity for actions on Banach spaces (Q2370129) (← links)
- Expanders and time-restricted branching programs (Q2378527) (← links)
- The diameter of the thick part of moduli space and simultaneous Whitehead moves (Q2393592) (← links)
- The eigenvalues of the graphs \(D(4,q)\) (Q2396890) (← links)
- Explicit expanding expanders (Q2408170) (← links)
