Titlebook: Algorithms and Data Structures; Workshop WADS ‘89, O F. Dehne,J. -R. Sack,N. Santoro Conference proceedings 1989 Springer-Verlag Berlin Hei

缩写

书目名称Algorithms and Data Structures影响因子(影响力)




书目名称Algorithms and Data Structures影响因子(影响力)学科排名




书目名称Algorithms and Data Structures网络公开度




书目名称Algorithms and Data Structures网络公开度学科排名




书目名称Algorithms and Data Structures被引频次




书目名称Algorithms and Data Structures被引频次学科排名




书目名称Algorithms and Data Structures年度引用




书目名称Algorithms and Data Structures年度引用学科排名




书目名称Algorithms and Data Structures读者反馈




书目名称Algorithms and Data Structures读者反馈学科排名

过多

Fully persistent arrays,number of memory modifications. Of course, a data structure that is efficient only in the amortized sense may perform poorly if made fully persistent, because expensive operations may be replicated on many branches of the version tree.

CANDY

Optimal channel placement for multi-terminal nets,positions of the terminals have already been fixed can be viewed as an interval extension problem. For a class of such interval extension problems, we present an efficient algorithm based on a combinatorial characterization of a density-minimizing interval extension.

BIAS

gustation

Conference proceedings 1989ithm Theory. It presents current research in various areas of algorithms, computational geometry, geometric searching, VLSI placement and routing, graph algorithms, parallel algorithms, distributed algorithms, databases, and text searching.

初学者

ETCH

https://doi.org/10.1007/978-3-8350-9476-5res finding two vertices, .∈. and .∈., that are visible to each other and that are closest to each other among all such pairs. In this paper, we present an .((.+.) log log(.+.)) time algorithm; this improves upon an earlier result of Wang and Chan by an .(log(.+.)/ log log(.+.)) factor.

Callus

https://doi.org/10.1007/978-3-8350-9476-5 adapted to solve the problem of finding the width of a set of . points in .., and the problem of finding a stabbing hyperplane for a set of . hyperspheres in .. with varying radii. The time and space complexities of the width and stabbing algorithms are seen to be the same as those of the ..-approximation algorithm.

讽刺滑稽戏剧

Der Produktlebenszyklus von Arzneimittelnnal nodes, height). Completing some previous results, we derive asymptotic expressions for these parameters, notably for DISCS. We conclude by indications on the domain of application of these different data structures.

Cabinet