Matching nuts and bolts faster
From MaRDI portal
Recommendations
Cites work
- Better expanders and superconcentrators
- Discrete groups, expanding graphs and invariant measures. Appendix by Jonathan D. Rogawski
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- scientific article; zbMATH DE number 1003302 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 108389 (Why is no real title available?)
- scientific article; zbMATH DE number 871919 (Why is no real title available?)
- Matching nuts and bolts faster
- Optimal Randomized Algorithms for Local Sorting and Set-Maxima
- Ramanujan graphs
- Selection and sorting with limited storage
Cited in
(6)- scientific article; zbMATH DE number 1003302 (Why is no real title available?)
- Matching Nuts and Bolts in O(n log n) Time
- scientific article; zbMATH DE number 871919 (Why is no real title available?)
- Matching nuts and bolts faster
- Matching nuts and bolts faster
- Algorithms for the generalized poset sorting problem
This page was built for publication: Matching nuts and bolts faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671403)