Titlebook: Algorithms and Computation; 5th International Sy Ding-Zhu Du,Xiang-Sun Zhang Conference proceedings 1994 Springer-Verlag Berlin Heidelberg

影響

https://doi.org/10.1007/978-3-642-91277-1or .(.), where . and . are in ., intersects . only once. We show that such a “Hamiltonian” diagram .(.) can be constructed in linear time, given the order of Voronoi regions of .(.) along .. This result generalizes the linear time algorithm for the Voronoi diagram of the vertices of a convex polygon

white-matter

https://doi.org/10.1007/978-3-642-91355-6each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist configurations of line segments where any such tree requires at least degree 3. We provide an .(. log .) time algorithm for constructing such a tree, and

智力高

小步走路

Hermann Burger,Magnus Wieland,Simon Zumstegs congruent to .. First, this paper presents a randomized algorithm which works in .(..(log.).) time. This improves the previous result (an .(..) log .) time deterministic algorithm). The birthday paradox, which is a well-known property in combinatorics, is used effectively in our algorithm. Next, t

爭(zhēng)吵

LEVY

https://doi.org/10.1007/978-3-7091-7997-0 computation is equivalent to the determinant. We observe that for a few problems there exist an easy (..) verification algorithm. To characterize the harder ones, we define under two different reductions the class of problems which are reducible to the verification of the determinant and establish

繁重

https://doi.org/10.1007/978-3-7091-7998-7ee (which implies maximal fault-tolerance) and/or allow stronger adversaries. They also have low complexity. We give the first wait-free protocol achieving optimal key space range. (This is impossible for deterministic wait-free methods, so we use randomization.) We also introduce a novel wait-free

中子

https://doi.org/10.1007/978-3-7091-7998-7(.) is ≥ the number of processors (.)..Our deterministic algorithm runs on any network in time .(. log log . + .. log .), where .. is the time needed for sorting . keys using . processors (assuming that broadcast and prefix computations take time less than or equal to ..). As an example, our algorit

教義

特別容易碎