標題: Titlebook: Algorithm Theory - SWAT ‘92; Third Scandinavian W Otto Nurmi,Esko Ukkonen Conference proceedings 1992 Springer-Verlag Berlin Heidelberg 199 [打印本頁] 作者: Ejaculation 時間: 2025-3-21 16:34
書目名稱Algorithm Theory - SWAT ‘92影響因子(影響力)
書目名稱Algorithm Theory - SWAT ‘92影響因子(影響力)學科排名
書目名稱Algorithm Theory - SWAT ‘92網(wǎng)絡(luò)公開度
書目名稱Algorithm Theory - SWAT ‘92網(wǎng)絡(luò)公開度學科排名
書目名稱Algorithm Theory - SWAT ‘92被引頻次
書目名稱Algorithm Theory - SWAT ‘92被引頻次學科排名
書目名稱Algorithm Theory - SWAT ‘92年度引用
書目名稱Algorithm Theory - SWAT ‘92年度引用學科排名
書目名稱Algorithm Theory - SWAT ‘92讀者反饋
書目名稱Algorithm Theory - SWAT ‘92讀者反饋學科排名
作者: Paradox 時間: 2025-3-21 22:14 作者: Immunotherapy 時間: 2025-3-22 00:59 作者: infantile 時間: 2025-3-22 05:26
An elementary approach to some analytic asymptotics,h as . The asymptotic behavior of . as .→∞ with . and . fixed depends on whether log ./ log . is rational or irrational. The solution of Fredman and Knuth used analytic methods in both cases, and used in particular the Wiener-Ikehara Tauberian theorem in the irrational case. We show that a more expl作者: 否決 時間: 2025-3-22 11:30
An optimal parallel algorithm for computing a near-optimal order of matrix multiplications,umber of operations. The best sequential algorithm for computing an optimal order of matrix multiplication runs in . log . time while the best known parallel NC algorithm runs in .(log..) time using ../ log.. processors. This paper presents the first approximating optimal parallel algorithm for this作者: harangue 時間: 2025-3-22 16:18
,Generating sparse 2—spanners,the distance between any two vertices in . is larger than that distance in . by no more than a factor of .. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(.).作者: 反饋 時間: 2025-3-22 18:23
Parallel algorithm for cograph recognition with applications,RCW PRAM, where . and m are the number of vertices and edges of the graph. Using cotree representation, we obtain a parallel algorithm for the permutation representation problem for cographs using .(log .) time with . processors. We also present a parallel algorithm for the depthfirst spanning tree 作者: demote 時間: 2025-3-22 22:19 作者: Crayon 時間: 2025-3-23 02:19 作者: 擦掉 時間: 2025-3-23 07:08
Parallel algorithms for priority queue operations,e Min-path Heap (MH), which is obtained as an extension of the traditional binary-heap organization. Using an MH, it is shown that insertion of a new item or deletion of the smallest item from a priority queue of . elements can be performed in . log n/p + log log .) parallel time, while construction作者: 急急忙忙 時間: 2025-3-23 13:47 作者: 漫步 時間: 2025-3-23 16:37
Efficient rebalancing of chromatic search trees,ime performance by allowing a greater degree of concurrency, which, in turn, is obtained by uncoupling updating from rebalancing. This also allows rebalancing to be postponed completely or partially until after peak working hours..The advantages of the proposal of Nurmi and Soisalon-Soininen are qui作者: 地牢 時間: 2025-3-23 22:05
The complexity of scheduling problems with communication delays for trees,heduling problem with the restriction that the underlying DAGs are trees and each task has unit execution time. It is shown that the problem remains .-complete for binary trees and uniform communication delays. The same holds for complete binary trees, but varying communication delays. On the other 作者: bifurcate 時間: 2025-3-24 00:54 作者: interpose 時間: 2025-3-24 02:37
Fractional cascading simplified,ered lists. The construction of our data-structure uses randomization and simplifies the algorithm of Chazelle and Guibas vastly making it practical to implement. Although our bounds are asymptotically similar to the earlier ones, there are improvements in the constant factors. Our analysis is novel作者: TSH582 時間: 2025-3-24 09:59
Dynamic 2- and 3-connectivity on planar graphs,-edge-connected components can be maintained in a total of . log .) time under any sequence of at most . deletions. This gives .(log .) amortized time 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 del作者: 注意到 時間: 2025-3-24 12:15
Conference proceedings 1992together with 34 selected contributed papers.Contributionscover algorithms and data structures in all areas,includingcombinatorics, computational geometry, data bases,paralleland distributed computing, and graphics.作者: 食草 時間: 2025-3-24 16:23 作者: 清澈 時間: 2025-3-24 21:44 作者: Crohns-disease 時間: 2025-3-25 02:08 作者: 托運 時間: 2025-3-25 04:32
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
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 作者: CHAR 時間: 2025-3-25 17:09 作者: 無能力 時間: 2025-3-25 22:40
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 作者: anarchist 時間: 2025-3-26 04:42
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 作者: 爭吵 時間: 2025-3-26 14:41
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
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 作者: 急性 時間: 2025-3-26 23:54
Retrieval of scattered information by EREW, CREW and CRCW PRAMs,me, even if the number of processors is arbitrarily large and .=2. On the CREW PRAM, we show that every .-processor algorithm for .-compaction problem requires Ω(loglog .) time, even if .=2. Finally, we show that .(log .) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.作者: 有罪 時間: 2025-3-27 01:34 作者: HUSH 時間: 2025-3-27 07:47
Parallel algorithms for priority queue operations, of an MH from a set of . items takes .(n/p+log .) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors ., with . ∈ .(log n/log log .), while the MH construction algorithm employs up to .(n/log .) processors optimally.作者: Missile 時間: 2025-3-27 12:29 作者: 疏遠天際 時間: 2025-3-27 16:14
Fractional cascading simplified, and captures some of the inherent difficulties associated with the fractional casading data structure. In particular, we use tools from branching process theory and derive some useful asymptotic bounds. The probability of deviation from the expected performance bounds decreases rapidly with number of keys.作者: Generator 時間: 2025-3-27 21:26
https://doi.org/10.1007/978-3-658-29556-1me, even if the number of processors is arbitrarily large and .=2. On the CREW PRAM, we show that every .-processor algorithm for .-compaction problem requires Ω(loglog .) time, even if .=2. Finally, we show that .(log .) time can be achieved on the ROBUST PRAM, a very weak CRCW PRAM model.作者: 羊齒 時間: 2025-3-27 22:42
Mandana Biegi,Jürgen F?rster,Thomas Philipped algorithm routes packets consisting of . flits each (. arbitrary), with . · n/4 + 2 · . + . · log .).) routing steps, with very high probability. The practical importance of this work is enhanced even more by the fact that the distribution of the packets only needs to be approximately a . permutation.作者: 門閂 時間: 2025-3-28 02:19
Kai Hafez,Susanne Frank,Sandra T?nzer of an MH from a set of . items takes .(n/p+log .) time. The given algorithms for insertion and deletion achieve the best possible running time for any number of processors ., with . ∈ .(log n/log log .), while the MH construction algorithm employs up to .(n/log .) processors optimally.作者: Pageant 時間: 2025-3-28 08:06 作者: neutralize 時間: 2025-3-28 13:04 作者: Entropion 時間: 2025-3-28 15:01 作者: glomeruli 時間: 2025-3-28 19:03 作者: sparse 時間: 2025-3-29 00:39 作者: 圍裙 時間: 2025-3-29 04:50 作者: debase 時間: 2025-3-29 09:00 作者: Vulnerable 時間: 2025-3-29 12:26
Efficient rebalancing of chromatic search trees,log.(N+1)]?2 rebalancing operations per deletion, where . is the maximum size the tree could ever have, given its initial size and the number of insertions performed. Most of these rebalancing operations, in fact, do no restructuring; they simply move weights around. The number of operations which a作者: 有角 時間: 2025-3-29 18:06 作者: 被告 時間: 2025-3-29 23:39 作者: 損壞 時間: 2025-3-30 03:52
https://doi.org/10.1007/978-3-531-90903-5the distance between any two vertices in . is larger than that distance in . by no more than a factor of .. This note concerns the problem of finding the sparsest 2-spanner in a given graph, and presents an approximation algorithm for this problem with approximation ratio log(.).作者: arthroplasty 時間: 2025-3-30 04:04
https://doi.org/10.57088/978-3-7329-8946-1d in . time on . processors, in the randomized parallel comparison tree model, where . is an inverse of Ackerman‘s function. I prove similar bounds for the related problem of putting . values into a min-max heap.作者: Archipelago 時間: 2025-3-30 09:10 作者: hemoglobin 時間: 2025-3-30 14:09 作者: nominal 時間: 2025-3-30 18:09 作者: 集聚成團 時間: 2025-3-30 23:52 作者: Free-Radical 時間: 2025-3-31 01:10
Heap construction in the parallel comparison tree model,d in . time on . processors, in the randomized parallel comparison tree model, where . is an inverse of Ackerman‘s function. I prove similar bounds for the related problem of putting . values into a min-max heap.作者: jagged 時間: 2025-3-31 07:56 作者: 債務(wù) 時間: 2025-3-31 09:32 作者: paleolithic 時間: 2025-3-31 14:29
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/a/image/152838.jpg作者: 注射器 時間: 2025-3-31 18:23
