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

polysomnography

書目名稱Algorithms and Data Structures影響因子(影響力)




書目名稱Algorithms and Data Structures影響因子(影響力)學(xué)科排名




書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度




書目名稱Algorithms and Data Structures網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithms and Data Structures被引頻次




書目名稱Algorithms and Data Structures被引頻次學(xué)科排名




書目名稱Algorithms and Data Structures年度引用




書目名稱Algorithms and Data Structures年度引用學(xué)科排名




書目名稱Algorithms and Data Structures讀者反饋




書目名稱Algorithms and Data Structures讀者反饋學(xué)科排名

車床

Original

劇毒

978-3-540-60220-0Springer-Verlag Berlin Heidelberg 1995

Blood-Vessels

anthropologist

Stabsfunktionen im Unternehmen,We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.

玩笑

合唱隊

Load balancing in quorum systems,This paper introduces and studies the question of balancing the load on processors participating in a given quorum system. Our proposed measure for the degree of balancing is the ratio between the load on the most frequently referenced element, and on the least frequently used one.

使糾纏

On the complexity of approximating and illuminating three-dimensional convex polyhedra,We show that several well-known computational geometry problems involving 3-dimensional convex polyhedra are NP-hard or NP-complete. One of the techniques we employ is a linear-time method for realizing a planar 3-connected triangulation as a convex polyhedron.

Forehead-Lift

Computing common tangents without a separating line,Given two disjoint convex polygons in standard representations, one can compute outer common tangents in logarithmic time without first obtaining a separating line. If the polygons are not disjoint, there is an additional factor of the logarithm of the intersection or convex hull, whichever is smaller.