The proceedings of the January 1995 symposium, sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics, comprise 70 papers. Among the topics: on-line approximate list indexing with applications; finding subsets maximizing minimum structures; register allocation in structured programs; and splay trees for data compression. No index. Annotation copyright by Book News, Inc., Portland, OR1-4/2 = n0- The denominator of this expression grows monotonically with log(Apno ), which is a positive integer. ... Having proven correctness of the updating algorithms, we now turn to their time requirements. ... sublist is guaranteed to stay strictly between mi(l - 0 and (m\ + 1)(1 +0- When an update would cause a sublist to violate the size condition, we restore the condition by merging and splitting sublists.
|Title||:||Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms|
|Publisher||:||SIAM - 1995-01-01|