Titlebook: Algorithms and Data Structures; Third Workshop, WADS Frank Dehne,J?rg-Rüdiger Sack,Sue Whitesides Conference proceedings 1993 Springer-Verl

euphoria

Limpid

CRACK

Der Privatisierungsproze? in Ru?landWe describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time .(log .) for point set input and .(log . log .) time for planar straight-line graphs, using .(.+./ log .) processors, where . measures input size and . output size.

eardrum

Balanced search trees made simple,As a contribution to the recent debate on simple implementations of dictionaries, we present new maintenance algorithms for balanced trees. In terms of code simplicity, our algorithms compare favourably with those for deterministic and probabilistic skip lists.

Colonnade

Parallel construction of quadtrees and quality triangulations,We describe efficient PRAM algorithms for constructing unbalanced quadtrees, balanced quadtrees, and quadtree-based finite element meshes. Our algorithms take time .(log .) for point set input and .(log . log .) time for planar straight-line graphs, using .(.+./ log .) processors, where . measures input size and . output size.

欄桿

Abominate

Algorithms and Data Structures978-3-540-47918-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

adroit

危機

環(huán)形