Titlebook: Algorithms and Data Structures; 4th International Wo Selim G. Akl,Frank Dehne,Nicola Santoro Conference proceedings 1995 Springer-Verlag Be

讓你明白

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/153162.jpg

原告

Lower bounds to processor-time tradeoffs under bounded-speed message propagation,e physical limitation on speed propagation of messages. It is shown that, under this limitation, parallelism and locality combined may yield speedups superlinear in the number of processors. The results are obtained by means of on a novel technique, called the “closed-dichotomy-size technique”, desi

嫻熟

The two-line center problem from a polar view: a new algorithm and data structure,plane, find two closed strips whose union contains all of the points and such that the width of the wider strip is minimized.” An almost quadratic .. log..) solution is given. The previously best known algorithm for this problem has time complexity ..log..) and uses a parametric search methodology.

織布機

On some geometric selection and optimization problems via sorted matrices,s, some of which have previously been solved by parametric search, and provide efficient and simple algorithms. Our technique improves the solutions obtained by parametric search by a log . factor. For example, we apply the technique to the two-line-center problem, where we want to find two strips t

眼界

Balanced distributed search trees do not exist,ch trees that is based on few natural assumptions. We prove that any class of trees within our model satisfies a lower bound of . on the worst case height of distributed search trees for . keys. That is, unlike in the single site case, balance in the sense that the tree height satisfies a logarithmi

Cleave

Indebted

accessory

Dynamic algorithms for the Dyck languages,blem for the free group. We present deterministic algorithms and data structures which maintain a string under replacements of symbols, insertions, and deletions of symbols, and language membership queries. Updates and queries are handled in polylogarithmic time. We also give both Las Vegas- and Mon

needle

Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications,plexity of lower envelopes, single cells, zones, and other substructures in such arrangements, and the design of efficient algorithms (near optimal in the worst case) for constructing and manipulating these structures. We then present applications of the new results to motion planning, Voronoi diagr

exclusice