Best Book Mart

SUBJECTS

ADV. SEARCH

Home > Subjects > Others

Lower Bound Techniques for Data Structure

	Lower Bound Techniques For Data Structure by Nina Verma And Ravindra Thakur
	Price : Rs 750.00
	Your Price : Rs 660.00

This book invented new techniques for proving lower bounds on data-structure problems with the following broad consequences: the first (lg n) lower bound for any dynamic problem, improving on a bound that had been standing since 1989; and for static data structures, the first separation between linear and polynomial space. Using these techniques, authors analyze a variety of central data-structure problems, and obtain improved lower bounds for the partial-sums problem; the predecessor problem; dynamic trees and dynamic connectivity; orthogonal range stabbing; orthogonal range counting, and orthogonal range reporting; the partial match problem; (1 )- approximate near neighbor on the hypercube; and approximate nearest neighbor in the metric. Authors have introduced the various data-structure problems that has been consider throughout this book with hope that the discussion of each topic is sufficiently self-contained, and the reader can quickly jump to his or her topic of interest.ISBN-9788182204485