Parallel general prefix computations with geometric, algebraic, and other applications
From MaRDI portal
Publication:916378
DOI10.1007/BF01381719zbMath0703.68054OpenAlexW2084052112MaRDI QIDQ916378
Ivan Stojmenović, Frederick Neil Springsteel
Publication date: 1990
Published in: International Journal of Parallel Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01381719
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)
Related Items
TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING ⋮ Sorting signed permutations by reversals, revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Listing and counting subtrees of equal size of a binary tree
- Optimal computation of prefix sums on a binary tree of processors
- An optimal parallel algorithm for triangulating a set of points in the plane
- On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors
- Two algorithms for constructing a binary tree from its traversals
- Constructing a binary tree from its traversals
- Optimal parallel generation of a computation tree form
- New Data Structures for Orthogonal Range Queries
- Solving tree problems on a mesh-connected processor array
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- Database Location in Computer Networks
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- A Self-Routing Benes Network and Parallel Permutation Algorithms
- Sorting on a mesh-connected parallel computer