Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
From MaRDI portal
(Redirected from Publication:579273)
Recommendations
- scientific article; zbMATH DE number 3875168
- scientific article; zbMATH DE number 3893127
- scientific article; zbMATH DE number 4106902
- Orderings on graphs and game coloring number
- Some classes of perfectly orderable graphs
- Almost all comparability graphs are UPO
- scientific article; zbMATH DE number 1028228
- scientific article; zbMATH DE number 3889587
- scientific article; zbMATH DE number 436086
- scientific article; zbMATH DE number 4079483
Cites work
- scientific article; zbMATH DE number 3765164 (Why is no real title available?)
- scientific article; zbMATH DE number 3487716 (Why is no real title available?)
- scientific article; zbMATH DE number 3204304 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- A note on time-space tradeoffs for computing continuous functions
- Asymptotic lower bounds for Ramsey functions
- Asymptotically tight bounds on time-space trade-offs in a pebble game
- Better expanders and superconcentrators
- Eigenvalues and expanders
- Explicit Concentrators from Generalized N-Gons
- Explicit constructions of linear-sized superconcentrators
- Graph-theoretic properties in computational complexity
- Intersection theorems with geometric consequences
- On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
- Parallel Sorting with Constant Time for Comparisons
- Parallel sorting
- Parallelism in Comparison Problems
- Sorting and Merging in Rounds
- Sorting and Selecting in Rounds
- Sorting in \(c \log n\) parallel steps
- Sorting in one round
- Space bounds for a game on graphs
- Superconcentrators
- Time-space tradeoffs for computing functions, using connectivity properties of their circuits
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
Cited in
(42)- More on configurations in Priestley spaces, and some new problems
- The size Ramsey number of a directed path
- Non-representability of finite projective planes by convex sets
- Constant time parallel sorting: An empirical view.
- Embedding graphs with bounded degree in sparse pseudorandom graphs
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Constructive bounds for a Ramsey-type problem
- Unimodular graphs and Eisenstein sums
- Pach's selection theorem does not admit a topological extension
- Simple proofs for Furstenberg sets over finite fields
- On the spectrum of projective norm-graphs
- Extending Erdős-Beck's theorem to higher dimensions
- On the growth rate in SL2(Fp)${\rm SL_2}(\mathbb {F}_p)$, the affine group and sum‐product type implications
- Candidate one-way functions based on expander graphs
- The hardest halfspace
- On the number of flats spanned by a set of points in \(PG(d,q)\)
- Domination in transitive colorings of tournaments
- The number of submatrices of a given type in a Hadamard matrix and related results
- The size-Ramsey number of trees
- On the second eigenvalue of hypergraphs
- Ramanujan edge-indexed graphs
- Hardness of fully dense problems
- Scalable secure storage when half the system is faulty
- The conjunctive complexity of quadratic Boolean functions
- On embeddings of finite metric spaces in \(l^n_\infty \)
- A Ramsey type problem concerning vertex colourings
- Dense expanders and pseudo-random bipartite graphs
- Fast algorithms for general spin systems on bipartite expanders
- Elementary methods for incidence problems in finite fields
- Incidence bounds for block designs
- Sorting in rounds
- Universal traversal sequences for expander graphs
- Highly symmetric expanders
- A sample of samplers: a computational perspective on sampling
- Generalisations of matrix partitions: complexity and obstructions
- Random Cayley graphs and expanders
- Parallel comparison algorithms for approximation problems
- Ramanujan graphs
- Sign rank versus Vapnik-Chervonenkis dimension
- On distinct perpendicular bisectors and pinned distances in finite fields
- Number of directions determined by a set in \(\mathbb{F}_q^2\) and growth in \(\mathrm{Aff}(\mathbb{F}_q)\)
- scientific article; zbMATH DE number 3926257 (Why is no real title available?)
This page was built for publication: Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579273)
