托运
发表于 2025-3-25 04:32:36
An elementary approach to some analytic asymptotics,ficients over a triangular subregion of Pascal‘s triangle. Apart from Stirling‘s formula, we need in the irrational case only the Kronecker-Weyl theorem (which can itself be proved by elementary methods), to the effect that if . is irrational, the fractional parts of the sequence ., ... are uniformly distributed in the unit interval.
CLEAR
发表于 2025-3-25 10:04:14
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications, on a CREW PRAM, and in .(log log .) time using . log log . processors on a weak CRCW PRAM. It produces an order of matrix multiplications and a partition of polygon which differ from the optimal ones at most 0.1547 times.
CUB
发表于 2025-3-25 15:33:14
http://reply.papertrans.cn/16/1529/152838/152838_23.png
CHAR
发表于 2025-3-25 17:09:53
http://reply.papertrans.cn/16/1529/152838/152838_24.png
无能力
发表于 2025-3-25 22:40:51
Siegfried George,Wolfgang Sander-complete for binary trees and uniform communication delays. The same holds for complete binary trees, but varying communication delays. On the other hand, by a nontrivial analysis a polynomial time algorithm is obtained that solves the problem for complete .-ary trees and uniform communication delays.
largesse
发表于 2025-3-26 01:31:05
http://reply.papertrans.cn/16/1529/152838/152838_26.png
anarchist
发表于 2025-3-26 04:42:48
Parallel algorithm for cograph recognition with applications,tion representation problem for cographs using .(log .) time with . processors. We also present a parallel algorithm for the depthfirst spanning tree problem for permutation graphs (a class properly contains cographs) which takes .(log.. time with . processors.
滔滔不绝的人
发表于 2025-3-26 11:02:40
http://reply.papertrans.cn/16/1529/152838/152838_28.png
争吵
发表于 2025-3-26 14:41:30
Dynamic 2- and 3-connectivity on planar graphs, per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total of . log..) time. This gives O(log..) amortized time per deletion. The space required by all our data structures is O(.).
amenity
发表于 2025-3-26 17:53:52
Conference proceedings 1992SWAT 88, SWAT 90,and the Workshop on Algorithms and Data Structures (WADS89,WADS 91), is intended as an international forum forresearchers inthe area of design and analysis ofalgorithms. The volume contains invitedpapers by L.G.Valiant (Direct bulk-synchronous parallel algorithms), A.A.Razborov (On