Pages that link to "Item:Q4120129"

The following pages link to Sorting on a mesh-connected parallel computer (Q4120129):

Displaying 50 items.

• Computing Hough transforms on hypercube multicomputers (Q547488) (← links)
• Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
• An efficient selection algorithm on the pyramid (Q674295) (← links)
• Randomized multipacket routing and sorting on meshes (Q675295) (← links)
• Integer sorting on a mesh-connected array of processors (Q688438) (← links)
• A unified algorithm for sorting on multidimensional mesh-connected processors (Q751246) (← links)
• A generalization of the zero-one principle for sorting algorithms (Q751248) (← links)
• A new parallel sorting algorithm based upon min-mid-max operations (Q795507) (← links)
• Time lower bounds for sorting on multi-dimensional mesh-connected processor arrays (Q915448) (← links)
• Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
• k-fold bitonic sort on a mesh-connected parallel computer (Q1065549) (← links)
• A VLSI algorithm for sorting variable-length character strings (Q1079374) (← links)
• Solving visibility and separability problems on a mesh-of-processors (Q1104081) (← links)
• Geometric problems on two-dimensional array processors (Q1104746) (← links)
• A VLSI partition algorithm (Q1104757) (← links)
• Sorting in constant number of row and column phases on a mesh (Q1105380) (← links)
• On O(\(\sqrt{n})\) time algorithm for the ECDF searching problem for arbitrary dimensions on a mesh-of-processors (Q1111382) (← links)
• Time lower bounds for parallel sorting on a mesh-connected processor array (Q1112618) (← links)
• VLSI-sorting evaluated under the linear model (Q1117701) (← links)
• A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation (Q1123611) (← links)
• A constant-time parallel algorithm for computing convex hulls (Q1162818) (← links)
• Computing convexity properties of images on a pyramid computer (Q1175644) (← links)
• Computational geometry algorithms for the systolic screen (Q1175650) (← links)
• Optimal routing algorithms for mesh-connected processor arrays (Q1188114) (← links)
• Indexing functions and time lower bounds for sorting on a mesh-connected computer (Q1192947) (← links)
• Efficient algorithms for parallel sorting on mesh multicomputers (Q1193763) (← links)
• Packet Routing on grids of processors (Q1207327) (← links)
• Sloping-and-shaking (Q1367257) (← links)
• Parallel geometric algorithms on a mesh-connected computer (Q1825643) (← links)
• A \(2n-2\) step algorithm for routing in an \(n \times n\) array with constant-size queues (Q1899217) (← links)
• A unified \(O(\log N)\) and optimal sorting vector algorithm (Q1907067) (← links)
• Fast deterministic selection on mesh-connected processor arrays (Q1911464) (← links)
• Discrete configuration spaces of squares and hexagons (Q2195551) (← links)
• An elegant algorithm for the construction of suffix arrays (Q2250537) (← links)
• Swapping labeled tokens on graphs (Q2347003) (← links)
• A neural sorting network with O(1) time complexity (Q2365819) (← links)
• The balanced binary tree technique on mesh-connected computers (Q2638775) (← links)
• Solving visibility problems on MCCs of smaller size (Q2638829) (← links)
• Space and time complexities of balanced sorting on processor arrays (Q2639641) (← links)
• A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
• Flit-serial packet routing on meshes and tori (Q3445270) (← links)
• A parallel sorting scheme whose basic operation sortsN elements (Q3738572) (← links)
• Scalable algorithms for the mesh with buses: merging, sorting and selection (Q4208594) (← links)
• Branch-and-bound and backtrack search on mesh-connected arrays of processors (Q4311641) (← links)
• A faster algorithm for sorting on mesh-connected computers with multiple broadcasting using fewer processors (Q4323716) (← links)
• Robust algorithms for packet routing in a mesh (Q4327376) (← links)
• AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ (Q4819959) (← links)
• SORTING ON MESH-CONNECTED COMPUTERS WITH SEGMENTED MULTIPLE BUSES∗ (Q4820034) (← links)
• TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING (Q4820157) (← links)
• Simulating the Bitonic Sort Using P Systems (Q5452056) (← links)