Pages that link to "Item:Q1056541"

The following pages link to Sorting in \(c \log n\) parallel steps (Q1056541):

Displaying 50 items.

• Distributed sorting algorithms for multi-channel broadcast networks (Q1098273) (← links)
• Towards optimal parallel bucket sorting (Q1098305) (← links)
• An optimal parallel algorithm for triangulating a set of points in the plane (Q1100899) (← links)
• An O(log n) time parallel algorithm for triangulating a set of points in the plane (Q1107999) (← links)
• An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
• A parallel bucket sort (Q1108803) (← links)
• Broadcasting with random faults (Q1111578) (← links)
• Eigenvalues and expanders (Q1112844) (← links)
• An efficient parallel algorithm for planarity (Q1114415) (← links)
• On the distribution of comparisons in sorting algorithms (Q1115198) (← links)
• Parallel computational geometry (Q1115600) (← links)
• L-infinity interdistance selection by parametric search (Q1115620) (← links)
• An efficient parallel algorithm for random sampling (Q1116335) (← links)
• Sorting in rounds (Q1117700) (← links)
• Optimal parallel selection has complexity O(log log N) (Q1118404) (← links)
• Efficient monotone circuits for threshold functions (Q1122560) (← links)
• Hybridsort revisited and parallelized (Q1123628) (← links)
• The queue-read queue-write asynchronous PRAM model (Q1128706) (← links)
• Real-time emulations of bounded-degree networks (Q1128816) (← links)
• A note on the token distribution problem (Q1178250) (← links)
• Randomized optimal algorithm for slope selection (Q1182097) (← links)
• An optimal parallel adaptive sorting algorithm (Q1182099) (← links)
• Optimal randomized parallel algorithms for computational geometry (Q1187202) (← links)
• Finding effective ``Force targets'' for two-dimensional, multifinger frictional grips (Q1188112) (← links)
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
• A parallelization of Miller's \(n^{\log n}\) isomorphism technique (Q1198063) (← links)
• Parallel iterated bucket sort (Q1263965) (← links)
• Sorting in linear time? (Q1273863) (← links)
• More general parallel tree contraction: Register allocation and broadcasting in a tree (Q1274316) (← links)
• A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
• Shallow grates (Q1314391) (← links)
• Deterministic sorting in nearly logarithmic time on the hypercube and related computers (Q1317489) (← links)
• Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
• Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
• Algorithms for ham-sandwich cuts (Q1329191) (← links)
• On the relationship between the diameter and the size of a boundary of a directed graph (Q1329425) (← links)
• Methods for message routing in parallel machines (Q1330418) (← links)
• Multi-processor scheduling and expanders (Q1336770) (← links)
• A theory of strict P-completeness (Q1337145) (← links)
• Recursive construction for 3-regular expanders (Q1343165) (← links)
• Parallel integer sorting using small operations (Q1346223) (← links)
• A parallel algorithm for the generation of a permutation and applications (Q1351208) (← links)
• Better lower bounds for monotone threshold formulas (Q1356879) (← links)
• Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM (Q1356881) (← links)
• Braking the \(\Theta(n\log^ 2 n)\) barrier for sorting with faults (Q1356885) (← links)
• Sorting strings and constructing digital search trees in parallel (Q1365679) (← links)
• Exploiting few inversions when sorting: Sequential and parallel algorithms (Q1365941) (← links)
• Optimal slope selection via cuttings (Q1388130) (← links)
• Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q1391297) (← links)
• Periodic comparator networks (Q1575741) (← links)