Abstract
Examples of fruitful interaction between geometrical combinatorics and the design and analysis of algorithms are presented. A demonstration is given of the way in which a simple geometrical construction yields new and efficient algorithms for various searching and list manipulation problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have