This edition has developed 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. ABOUT THE AUTHORS Nina Verma currently manages the academic programs and personnel of the Business Applications and IT Management department in the faculty of ICT of Tshwane University of Technology, Pretoria. Ravindra Thakur is a lecturer in the School of Information Systems at Queensland University of Technology, Brisbane, coordinating IT project management units.
