Efficient Parallel Algorithms for Tree Accumulations

Efficient Parallel Algorithms for Tree Accumulations

Accumulations are higher-order operations on structured objects; they leave the shape of an object unchanged, but replace elements of that object with accumulated information about other elements. Upwards and downwards accumulations on trees are two such operations; they form the basis of many tree...

Detaylı Bibliyografya
Asıl Yazarlar:	Gibbons, J, Cai, W, Skillicorn, D
Materyal Türü:	Journal article
Baskı/Yayın Bilgisi:	1994

Benzer Materyaller

EFFICIENT PARALLEL ALGORITHMS FOR TRE ACCUMULATIONS
Yazar:: Gibbons, J, ve diğerleri
Baskı/Yayın Bilgisi: (1994)

Upwards and Downwards Accumulations on Trees
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1993)

Computing downwards accumulations on trees quickly
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1996)

Computing Downwards Accumulations on Trees Quickly
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1993)

Computing Downwards Accumulations on Trees Quickly
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1996)

Algebras for tree algorithms
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1991)

Algebras for Tree Algorithms
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1991)

Programming languages for parallel processing /
Yazar:: Skillicorn, David B., ve diğerleri
Baskı/Yayın Bilgisi: (1995)

Efficient Parallel Processing of R-Tree on GPUs
Yazar:: Jian Nong, ve diğerleri
Baskı/Yayın Bilgisi: (2024-07-01)

An efficient parallel algorithm for planarity
Yazar:: Klein, Philip N. (Philip Nathan)
Baskı/Yayın Bilgisi: (2006)

The efficiency of crypt algorithms parallelization
Yazar:: A. S. Poljakov, ve diğerleri
Baskı/Yayın Bilgisi: (2019-06-01)

Designing efficient algorithms for parallel computers /
Yazar:: 444879 Quinn, Michael J.
Baskı/Yayın Bilgisi: (1987)

Parallelizing Multiple Flow Accumulation Algorithm using CUDA and OpenACC
Yazar:: Natalija Stojanovic, ve diğerleri
Baskı/Yayın Bilgisi: (2019-09-01)

Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
Yazar:: A. S. Nepomniaschaya
Baskı/Yayın Bilgisi: (2013-04-01)

Associative Parallel Algorithm for Dynamic Update of the Shortest Paths Tree
Yazar:: A. S. Nepomniaschaya
Baskı/Yayın Bilgisi: (2013-01-01)

Communication-efficient Parallel Graph Algorithms
Yazar:: Leiserson, Charles E., ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Against the Grain: Linear−Time Breadth−First Tree Algorithms
Yazar:: Gibbons, J, ve diğerleri
Baskı/Yayın Bilgisi: (1998)

Efficient Graph Algorithms for Sequential and Parallel Computers
Yazar:: Goldberg, Andrew V.
Baskı/Yayın Bilgisi: (2023)

Efficient graph algorithms for sequential and parallel computers
Yazar:: Goldberg, Andrew Vladislav
Baskı/Yayın Bilgisi: (2005)

Parallelizing discrete geodesic algorithms with perfect efficiency
Yazar:: Ying, Xiang, ve diğerleri
Baskı/Yayın Bilgisi: (2021)

Polytypic Downwards Accumulations
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (1998)

Generic Downwards Accumulations
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (2000)

Generic downwards accumulations
Yazar:: Gibbons, J
Baskı/Yayın Bilgisi: (2000)

Linear−time Breadth−first Tree Algorithms: An Exercise in the Arithmetic of Folds and Zips
Yazar:: Jones, G, ve diğerleri
Baskı/Yayın Bilgisi: (1993)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Yazar:: Wang, Yiqiu, ve diğerleri
Baskı/Yayın Bilgisi: (2022)

Tree projections and constraint optimization problems: Fixed-parameter tractability and parallel algorithms
Yazar:: Gottlob, G, ve diğerleri
Baskı/Yayın Bilgisi: (2017)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering
Yazar:: Wang, Yiqiu, ve diğerleri
Baskı/Yayın Bilgisi: (2022)

DC-RST: a parallel algorithm for random spanning trees in network analytics
Yazar:: Luke Henke, ve diğerleri
Baskı/Yayın Bilgisi: (2024-08-01)

PARALLEL BUCKET-SORT ALGORITHM ON OPTICAL CHAINED-CUBIC TREE INTERCONNECTION NETWORK
Yazar:: Basel A. Mahafzah
Baskı/Yayın Bilgisi: (2024-04-01)

RFID Adaptive Parallel Response Collision Tree Algorithm Based on Lock-Bit
Yazar:: Xuan Luo, ve diğerleri
Baskı/Yayın Bilgisi: (2024-01-01)

Full Binary Tree-Based Fixed Degree Graph Design and Parallel Algorithm
Yazar:: Bo Ok Seong, ve diğerleri
Baskı/Yayın Bilgisi: (2023-01-01)

Efficient Stepping Algorithms and Implementations for Parallel Shortest Paths
Yazar:: Dong, Xiaojun, ve diğerleri
Baskı/Yayın Bilgisi: (2022)

Algorithms for ellipitc problems : efficient sequential and parallel solvers /
Yazar:: 261486 Vajtersic, Marian
Baskı/Yayın Bilgisi: (1993)

The analysis of the efficiency of a master-slave parallel algorithm
Yazar:: Raimondas Čiegis, ve diğerleri
Baskı/Yayın Bilgisi: (1998-12-01)

An Efficient Data Retrieval Parallel Reeb Graph Algorithm
Yazar:: Mustafa Hajij, ve diğerleri
Baskı/Yayın Bilgisi: (2020-10-01)

An efficient algorithm for data parallelism based on stochastic optimization
Yazar:: Khalid Abdulaziz Alnowibet, ve diğerleri
Baskı/Yayın Bilgisi: (2022-12-01)

An Efficient Parallel Algorithm for Detecting Packet Filter Conflicts
Yazar:: Chun-Liang Lee, ve diğerleri
Baskı/Yayın Bilgisi: (2022-07-01)

Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering (Abstract)
Yazar:: Wang, Yiqiu, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Sage: parallel semi-asymmetric graph algorithms for NVRAMs
Yazar:: Dhulipala, Laxman, ve diğerleri
Baskı/Yayın Bilgisi: (2021)

Parallel construction of binary tree based on sorting
Yazar:: Ya. E. Romm, ve diğerleri
Baskı/Yayın Bilgisi: (2018-12-01)