Titlebook: Algorithms and Computation; 4th International Sy K. W. Ng,P. Raghavan,F. Y. L. Chin Conference proceedings 1993 Springer-Verlag Berlin Heid

慢慢流出

使痛苦

A simple balanced search tree with ,(1) worst-case update time,st-case time (once the position of the inserted or deleted key is known). Our data structure is quite natural and much simpler than previous worst-case optimal solutions. It is based on two techniques: 1) ., i.e. storing an ordered list of 2log . keys in each leaf of an (.) tree, and 2) ., i.e. post

Palate

是貪求

Permutation routing on reconfigurable meshes,troduce both worst case algorithms and algorithms that are better on average. The time bounds presented are better than those achievable on the conventional mesh and previously known algorithms..We present two variants of the reconfigurable mesh. In the first model, M., the processors are attached t

盡忠

Adaptive and oblivious algorithms for d-cube permutation routing, 7 (called 7-cube). We also prove an ./log .) lower bound for the class of deterministic restricted oblivious permutation routing algorithms. Finally, we design optimal deterministic oblivious permutation routing on the .-cube, . ≤ 6.

類型

On quadratic lattice approximations,re given this is the well known lattice approximation problem. We call the general version the quadratic lattice approximation problem. In this paper we construct via derandomization lattice points with small linear and quadratic discrepancies. Unfortunately the known derandomization methods do not

BOLUS

How to treat delete requests in semi-online problems,