Pages that link to "Item:Q1056541"
From MaRDI portal
The following pages link to Sorting in \(c \log n\) parallel steps (Q1056541):
Displaying 46 items.
- Small extended formulation for knapsack cover inequalities from monotone circuits (Q4612478) (← links)
- On the theory of interconnection networks for parallel computers (Q4632449) (← links)
- A super-logarithmic lower bound for hypercubic sorting networks (Q4632461) (← links)
- LABELING POINTS WITH RECTANGLES OF VARIOUS SHAPES (Q4818575) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- (Q5005185) (← links)
- Comparator networks for binary heap construction (Q5054852) (← links)
- PRAM's towards realistic parallelism: BRAM's (Q5055910) (← links)
- Computing the smallest k-enclosing circle and related problems (Q5060125) (← links)
- Fragile complexity of comparison-based algorithms (Q5075734) (← links)
- Sorting Short Keys in Circuits of Size ${o(n \log n)}$ (Q5080485) (← links)
- The Half Cleaner Lemma: Constructing Efficient Interconnection Networks from Sorting Networks (Q5087836) (← links)
- (Q5089148) (← links)
- Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits (Q5091231) (← links)
- Time-optimal simulations of networks by universal parallel computers (Q5096148) (← links)
- Linear-time algorithms for parametric minimum spanning tree problems on planar graphs (Q5096337) (← links)
- Reliable minimum finding comparator networks (Q5096888) (← links)
- On (Valiant’s) Polynomial-Size Monotone Formula for Majority (Q5098767) (← links)
- An O(n log n)-Time Algorithm for the k-Center Problem in Trees (Q5116532) (← links)
- Atomic snapshots using lattice agreement (Q5136986) (← links)
- Counting networks with arbitrary fan-out (Q5136991) (← links)
- Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
- On Expressing Majority as a Majority of Majorities (Q5220471) (← links)
- On the diameter and bisector size of Cayley graphs (Q5289272) (← links)
- Cooperative Boolean systems with generically long attractors I (Q5301058) (← links)
- Parallel matching for ranking all teams in a tournament (Q5395362) (← links)
- Generic top-down discrimination for sorting and partitioning in linear time (Q5398338) (← links)
- (Q5743386) (← links)
- An $O(n\log n)$-Time Algorithm for the $k$-Center Problem in Trees (Q5858648) (← links)
- Deterministic Graphical Games Revisited (Q5900106) (← links)
- The impact of randomization in smoothing networks (Q5901191) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5915623) (← links)
- Is there an oblivious RAM lower bound for online reads? (Q5918328) (← links)
- Fragile complexity of adaptive algorithms (Q5918676) (← links)
- Locality-preserving oblivious RAM (Q5925543) (← links)
- Fragile complexity of adaptive algorithms (Q5925676) (← links)
- Searching games with errors -- fifty years of coping with liars (Q5958303) (← links)
- Assouad-Nagata dimension and gap for ordered metric spaces (Q6058052) (← links)
- Discrete Fréchet distance for closed curves (Q6101836) (← links)
- Algorithms and lower bounds for comparator circuits from shrinkage (Q6107895) (← links)
- More Efficient Parallel Integer Sorting (Q6114876) (← links)
- Linear-time 2-party secure merge from additively homomorphic encryption (Q6168324) (← links)
- Decentralized Online Scheduling of Malleable NP-hard Jobs (Q6487361) (← links)
- Anonymous permutation routing (Q6582210) (← links)
- Parameterized complexity classes defined by threshold circuits and their connection with sorting networks (Q6610088) (← links)
