Titlebook: Algorithm Theory - SWAT ‘92; Third Scandinavian W Otto Nurmi,Esko Ukkonen Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 199

急急忙忙

漫步

Efficient rebalancing of chromatic search trees,ime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to be postponed completely or partially until after peak working hours..The advantages of the proposal of Nurmi and Soisalon-Soininen are qui

地牢

The complexity of scheduling problems with communication delays for trees,heduling problem with the restriction that the underlying DAGs are trees and each task has unit execution time. It is shown that the problem remains .-complete for binary trees and uniform communication delays. The same holds for complete binary trees, but varying communication delays. On the other

bifurcate

interpose

Fractional cascading simplified,ered lists. The construction of our data-structure uses randomization and simplifies the algorithm of Chazelle and Guibas vastly making it practical to implement. Although our bounds are asymptotically similar to the earlier ones, there are improvements in the constant factors. Our analysis is novel

TSH582

Dynamic 2- and 3-connectivity on planar graphs,-edge-connected components can be maintained in a total of . log .) time under any sequence of at most . deletions. This gives .(log .) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of . log..) time. This gives O(log..) amortized time per del

注意到

Conference proceedings 1992together with 34 selected contributed papers.Contributionscover algorithms and data structures in all areas,includingcombinatorics, computational geometry, data bases,paralleland distributed computing, and graphics.

食草

清澈

Crohns-disease