Matching nuts and bolts faster

DOI10.1016/0020-0190(96)00104-4zbMath0875.68545OpenAlexW2003841666MaRDI QIDQ671403

Noga Alon, Phillip G. Bradford, Rudolf Fleischer

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-A846-5

zbMATH Keywords

Analysis of algorithmsNuts and boltsSorting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

Matching nuts and bolts faster

Cites Work

• Matching nuts and bolts faster
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matching nuts and bolts faster