Matching nuts and bolts faster
From MaRDI portal
Publication:6487988
DOI10.1007/BFB0015446zbMath1512.68179MaRDI QIDQ6487988
Rudolf Fleischer, Phillip G. Bradford
Publication date: 21 March 2023
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Selection and sorting with limited storage
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Better expanders and superconcentrators
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima
This page was built for publication: Matching nuts and bolts faster