Algorithms and Computations
Subtitle: 10th International Symposium, ISAAC'99, Chennai, India, December 16-18, 1999 Proceedings (Lecture Notes in Computer Science)
Contributors: Alok Aggarwal (Editor); C. Pandu Rangan (Editor)
Edition: 1 edition
Publisher: Springer
Published: January 14, 2000
Language: eng
Format: Paperback
Number of pages: 448
ISBN-13: 9783540669166
Subjects: Algorithms & procedures; Mathematical theory of computation; Mathematics for scientists & engineers; Programming - General; Computers - General Information; Algorithms (Computer Programming); Theory Of Computing; Computers; Numerical calculations; Business/Economics; General; Congresses; Computer Science; Approximation algorithms; Computers / Computer Science; algorithm engineering; algorithms; computational complexity; Computer algorithms; Data processing
First sentence: The directory problem, that of handling an on-line series of INSERT, DELETE and FIND requests, is for most applications addressed satisfactorily by balanced search trees (BST) (see e.g., [9] for a trace of BST's from [2] onwards), which guarantee O(log N) worst time for each of these operations.